./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_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_7_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 f612eebc128d68e9b4bc81ed92184f640c3b9bd4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:10,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:03:10,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:03:10,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:03:10,720 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:03:10,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:03:10,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:03:10,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:03:10,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:03:10,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:03:10,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:03:10,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:03:10,736 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:03:10,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:03:10,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:03:10,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:03:10,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:03:10,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:03:10,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:03:10,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:03:10,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:03:10,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:03:10,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:03:10,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:03:10,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:03:10,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:03:10,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:03:10,780 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:03:10,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:03:10,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:03:10,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:03:10,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:03:10,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:03:10,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:03:10,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:03:10,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:03:10,790 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:10,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:03:10,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:03:10,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:03:10,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:03:10,818 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:03:10,818 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:03:10,819 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:03:10,819 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:03:10,819 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:03:10,819 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:03:10,819 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:03:10,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:03:10,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:03:10,823 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:03:10,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:03:10,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:03:10,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:03:10,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:03:10,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:03:10,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:03:10,825 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:03:10,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:03:10,825 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:03:10,825 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:03:10,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:03:10,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:03:10,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:03:10,826 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:03:10,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:03:10,826 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:03:10,826 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:03:10,830 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:03:10,830 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 -> f612eebc128d68e9b4bc81ed92184f640c3b9bd4 [2018-11-29 00:03:10,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:03:10,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:03:10,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:03:10,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:03:10,905 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:03:10,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c [2018-11-29 00:03:10,965 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b347ae1/90289d4ad4ca4d24a5fee8613521cfdd/FLAG57fa26b21 [2018-11-29 00:03:11,452 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:03:11,453 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c [2018-11-29 00:03:11,464 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b347ae1/90289d4ad4ca4d24a5fee8613521cfdd/FLAG57fa26b21 [2018-11-29 00:03:11,863 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b347ae1/90289d4ad4ca4d24a5fee8613521cfdd [2018-11-29 00:03:11,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:03:11,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:03:11,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:11,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:03:11,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:03:11,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:11" (1/1) ... [2018-11-29 00:03:11,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b25aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:11, skipping insertion in model container [2018-11-29 00:03:11,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:11" (1/1) ... [2018-11-29 00:03:11,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:03:11,904 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:03:12,132 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:12,139 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:03:12,162 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:12,183 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:03:12,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:12 WrapperNode [2018-11-29 00:03:12,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:12,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:12,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:03:12,186 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:03:12,198 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:12" (1/1) ... [2018-11-29 00:03:12,205 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:12" (1/1) ... [2018-11-29 00:03:12,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:12,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:03:12,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:03:12,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:03:12,245 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:12" (1/1) ... [2018-11-29 00:03:12,245 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:12" (1/1) ... [2018-11-29 00:03:12,246 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:12" (1/1) ... [2018-11-29 00:03:12,246 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:12" (1/1) ... [2018-11-29 00:03:12,249 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:12" (1/1) ... [2018-11-29 00:03:12,254 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:12" (1/1) ... [2018-11-29 00:03:12,255 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:12" (1/1) ... [2018-11-29 00:03:12,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:03:12,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:03:12,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:03:12,257 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:03:12,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:12" (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:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:03:12,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:03:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-29 00:03:12,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-29 00:03:12,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:03:12,641 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:03:12,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:12 BoogieIcfgContainer [2018-11-29 00:03:12,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:03:12,643 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:03:12,643 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:03:12,647 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:03:12,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:12,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:03:11" (1/3) ... [2018-11-29 00:03:12,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6429dba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:12, skipping insertion in model container [2018-11-29 00:03:12,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:12,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:12" (2/3) ... [2018-11-29 00:03:12,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6429dba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:12, skipping insertion in model container [2018-11-29 00:03:12,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:12,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:12" (3/3) ... [2018-11-29 00:03:12,653 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_7_true-unreach-call_true-termination.c [2018-11-29 00:03:12,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:03:12,747 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:03:12,747 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:03:12,747 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:03:12,748 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:03:12,748 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:03:12,748 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:03:12,748 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:03:12,748 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:03:12,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:03:12,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:12,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:12,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:12,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:12,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:12,827 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:03:12,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:03:12,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:12,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:12,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:12,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:12,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:12,841 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-11-29 00:03:12,841 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:12,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-11-29 00:03:12,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:12,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:12,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-11-29 00:03:12,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:12,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:12,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:12,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-11-29 00:03:12,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:12,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:12,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:12,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:13,194 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:13,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:13,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:13,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:13,196 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:13,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:13,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:13,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:13,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:13,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:13,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:13,222 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:13,251 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:13,261 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:13,269 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:13,278 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:13,459 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:13,460 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:13,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:13,474 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:13,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:13,491 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:13,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:13,525 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:13,536 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:13,537 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) [2018-11-29 00:03:13,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:13,574 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:13,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:13,589 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) [2018-11-29 00:03:13,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:13,627 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:13,637 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:13,637 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:13,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:13,663 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:13,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:13,707 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:13,758 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:13,760 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:13,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:13,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:13,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:13,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:13,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:13,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:13,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:13,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:13,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:13,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:13,764 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:13,769 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:13,775 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:13,783 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:13,797 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:13,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:13,962 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:13,964 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:13,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:13,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:13,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:13,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:13,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:13,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:13,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:13,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:13,974 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:13,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:13,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:13,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:13,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:13,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:13,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:13,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:13,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:13,980 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:13,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:13,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:13,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:13,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:13,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:13,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:13,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:13,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:13,984 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:13,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:13,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:13,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:13,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:13,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:13,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:13,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:13,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:13,989 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:13,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:13,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:13,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:13,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:13,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:13,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:13,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:13,999 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:14,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:14,004 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:14,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:14,007 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:14,007 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:14,007 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:03:14,009 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:14,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,379 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:14,400 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:14,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-29 00:03:14,767 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:14,767 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:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:03:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-29 00:03:14,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:03:14,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:14,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:03:14,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:14,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:03:14,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:14,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-29 00:03:14,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:14,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-11-29 00:03:14,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:03:14,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:03:14,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-29 00:03:14,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:14,796 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:03:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-29 00:03:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-29 00:03:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-29 00:03:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-29 00:03:14,827 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:03:14,827 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:03:14,827 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:03:14,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-29 00:03:14,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:14,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:14,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:14,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,832 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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:14,832 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:14,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-11-29 00:03:14,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:15,001 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:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:15,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:15,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:15,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-11-29 00:03:15,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:15,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:15,435 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:15,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:15,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:15,436 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:15,441 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-29 00:03:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:15,622 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-29 00:03:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:15,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-29 00:03:15,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:15,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-29 00:03:15,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:03:15,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:03:15,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-29 00:03:15,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:15,630 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-29 00:03:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:03:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:03:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-29 00:03:15,636 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:15,636 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:15,636 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:03:15,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-29 00:03:15,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:15,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:15,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:15,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:15,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:15,640 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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:15,640 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:15,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-11-29 00:03:15,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:15,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:15,727 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,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:15,728 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:15,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:15,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:15,760 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,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:15,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-29 00:03:15,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:15,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:15,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-11-29 00:03:15,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:15,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,966 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,967 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,967 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:15,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:15,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,970 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,017 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,026 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,033 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,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:16,114 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:16,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:16,118 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:16,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:16,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:16,830 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:16,833 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:16,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:16,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:16,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:16,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:16,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:16,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:16,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:16,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:16,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:16,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:16,836 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,844 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,885 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,886 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,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:16,989 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:16,990 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:16,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:16,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:16,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:16,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:16,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:16,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:16,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:16,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:16,999 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:16,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:17,021 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:17,022 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:17,023 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:17,023 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:17,023 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:17,023 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:17,024 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:17,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,249 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,250 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,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-29 00:03:17,557 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:17,561 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,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:03:17,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-29 00:03:17,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:17,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-29 00:03:17,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:17,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-29 00:03:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:17,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-29 00:03:17,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:17,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-29 00:03:17,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-29 00:03:17,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:03:17,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-29 00:03:17,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:17,585 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-29 00:03:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-29 00:03:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-29 00:03:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:03:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-29 00:03:17,604 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-29 00:03:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:03:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:03:17,604 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-29 00:03:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:17,743 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-29 00:03:17,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:03:17,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-29 00:03:17,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:17,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-29 00:03:17,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:03:17,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:03:17,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-29 00:03:17,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:17,756 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-29 00:03:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-29 00:03:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-29 00:03:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:03:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-29 00:03:17,771 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:03:17,771 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:03:17,771 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:03:17,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-29 00:03:17,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:17,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:17,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:17,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:17,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:17,778 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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:17,778 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:17,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-11-29 00:03:17,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:17,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:17,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,898 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:17,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:17,899 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:17,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,933 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:17,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:17,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:03:17,958 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:17,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-11-29 00:03:17,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:17,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:17,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:18,138 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:18,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:18,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:18,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:18,139 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:18,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:18,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:18,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:18,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:03:18,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:18,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:18,141 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:18,148 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:18,152 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:18,154 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:18,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:18,226 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:18,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:18,229 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:18,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:18,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:18,948 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:18,950 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:18,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:18,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:18,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:18,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:18,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:18,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:18,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:18,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:03:18,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:18,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:18,953 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:18,955 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:18,958 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:18,960 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:19,066 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:19,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:19,067 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:19,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:19,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:19,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:19,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:19,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:19,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:19,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:19,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:19,072 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:19,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:19,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:19,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:19,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:19,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:19,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:19,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:19,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:19,078 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:19,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:19,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:19,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:19,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:19,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:19,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:19,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:19,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:19,086 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:19,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:19,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:19,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:19,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:19,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:19,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:19,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:19,095 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:19,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:19,099 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:19,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:19,100 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:19,100 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:19,100 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:19,101 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:19,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,316 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:19,316 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:19,317 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,560 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:19,562 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,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:03:19,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:19,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:19,563 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:19,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,783 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:19,784 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:19,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:20,009 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:20,012 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:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-29 00:03:20,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:20,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,013 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:20,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,344 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:20,345 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:20,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:20,966 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:20,974 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:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-29 00:03:20,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-29 00:03:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-29 00:03:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-29 00:03:21,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:03:21,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-29 00:03:21,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-29 00:03:21,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-29 00:03:21,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-29 00:03:21,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:21,031 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-29 00:03:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-29 00:03:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-29 00:03:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-29 00:03:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-29 00:03:21,090 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-29 00:03:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:03:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:03:21,090 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-29 00:03:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:21,919 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-11-29 00:03:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:03:21,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-11-29 00:03:21,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:03:21,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-11-29 00:03:21,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-29 00:03:21,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-29 00:03:21,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-11-29 00:03:21,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:21,958 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-11-29 00:03:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-11-29 00:03:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-11-29 00:03:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-29 00:03:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-11-29 00:03:21,997 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:03:21,997 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:03:21,997 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:03:21,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-11-29 00:03:22,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:22,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:22,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:22,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:22,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:22,005 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-29 00:03:22,005 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-29 00:03:22,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-11-29 00:03:22,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:22,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:22,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:22,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-29 00:03:22,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:22,470 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:22,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,678 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:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-29 00:03:22,717 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:22,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-11-29 00:03:22,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:22,805 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:22,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:22,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:22,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:22,805 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:22,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:22,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:22,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:22,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:22,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:22,806 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:22,808 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:22,813 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:22,823 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:22,825 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:22,826 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:22,861 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:22,861 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:22,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:22,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:22,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:22,869 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:22,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:22,890 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:22,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:22,912 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:22,932 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:22,934 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:22,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:22,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:22,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:22,934 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:22,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:22,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:22,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:22,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:22,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:22,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:22,936 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:22,983 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:22,984 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:22,986 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:22,988 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:23,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:23,057 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:23,058 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:23,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:23,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:23,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:23,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:23,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:23,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:23,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:23,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:23,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:23,066 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:23,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:23,067 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:23,067 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:23,067 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:03:23,067 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:23,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:23,251 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:23,252 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:23,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:03:23,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-29 00:03:23,372 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:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:03:23,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:23,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:23,373 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:23,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:23,614 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:23,615 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:23,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:03:23,686 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-29 00:03:23,693 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:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:03:23,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:23,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:23,694 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:23,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:23,806 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:23,806 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:23,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:03:23,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-11-29 00:03:23,930 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:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-29 00:03:23,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:23,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:23,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-29 00:03:23,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:23,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-29 00:03:23,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:23,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-11-29 00:03:23,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:23,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-11-29 00:03:23,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-29 00:03:23,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-29 00:03:23,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-11-29 00:03:23,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:23,953 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-11-29 00:03:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-11-29 00:03:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-11-29 00:03:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-29 00:03:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-11-29 00:03:23,979 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-11-29 00:03:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-29 00:03:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-29 00:03:23,981 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-11-29 00:03:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:24,864 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-11-29 00:03:24,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-29 00:03:24,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-11-29 00:03:24,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:24,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-11-29 00:03:24,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-29 00:03:24,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-29 00:03:24,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-11-29 00:03:24,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:24,875 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-11-29 00:03:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-11-29 00:03:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-11-29 00:03:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:03:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:03:24,925 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:03:24,925 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:03:24,925 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:24,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-11-29 00:03:24,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:24,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:24,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:24,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:24,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:24,932 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-29 00:03:24,932 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-29 00:03:24,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-11-29 00:03:24,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:24,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:24,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:24,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-29 00:03:25,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:25,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:25,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:25,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:25,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:25,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-29 00:03:25,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:25,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-29 00:03:25,361 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:25,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-11-29 00:03:25,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:25,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:25,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:25,426 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:25,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:25,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:25,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:25,427 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:25,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:25,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:25,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:25,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:03:25,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:25,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:25,428 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:25,453 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:25,497 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:25,500 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:25,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:25,566 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:25,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:25,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:25,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:25,574 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:25,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:25,596 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:25,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:25,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:33,595 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:33,598 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:33,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:33,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:33,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:33,599 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:33,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:33,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:33,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:33,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:03:33,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:33,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:33,600 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:33,612 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:33,615 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:33,620 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:33,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:33,671 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:33,671 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:33,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:33,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:33,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:33,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:33,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:33,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:33,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:33,681 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:33,684 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:33,685 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:33,685 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:33,685 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:33,685 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:33,686 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:33,686 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:33,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:33,915 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:33,916 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:33,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:03:33,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-11-29 00:03:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:34,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:03:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,002 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:34,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:34,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:34,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:34,484 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:34,485 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:34,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:03:34,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-11-29 00:03:34,576 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:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:34,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:03:34,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,578 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:34,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:34,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:34,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:34,748 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:34,748 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 4 loop predicates [2018-11-29 00:03:34,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:03:34,954 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-11-29 00:03:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:34,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:03:34,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-11-29 00:03:34,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-11-29 00:03:34,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-11-29 00:03:34,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:34,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-11-29 00:03:34,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-29 00:03:34,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-29 00:03:34,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-11-29 00:03:34,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:34,969 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-11-29 00:03:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-11-29 00:03:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-29 00:03:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:03:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:03:34,977 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:03:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:03:34,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:03:34,981 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-11-29 00:03:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:35,444 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2018-11-29 00:03:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:03:35,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 473 transitions. [2018-11-29 00:03:35,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:35,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 315 states and 437 transitions. [2018-11-29 00:03:35,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-29 00:03:35,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-29 00:03:35,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 437 transitions. [2018-11-29 00:03:35,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:35,458 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 437 transitions. [2018-11-29 00:03:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 437 transitions. [2018-11-29 00:03:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 270. [2018-11-29 00:03:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-29 00:03:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2018-11-29 00:03:35,468 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2018-11-29 00:03:35,468 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2018-11-29 00:03:35,468 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:03:35,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 364 transitions. [2018-11-29 00:03:35,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:35,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:35,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:35,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 9, 8, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-29 00:03:35,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:35,473 INFO L794 eck$LassoCheckResult]: Stem: 8504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 8505#L25 call main_#t~ret2 := fibo(main_~x~0);< 8546#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8615#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8614#fiboENTRY ~n := #in~n; 8618#L6 assume !(~n < 1); 8612#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8639#L6 assume !(~n < 1); 8638#L8 assume !(1 == ~n); 8536#L11 call #t~ret0 := fibo(~n - 1);< 8631#fiboENTRY ~n := #in~n; 8650#L6 assume !(~n < 1); 8649#L8 assume !(1 == ~n); 8537#L11 call #t~ret0 := fibo(~n - 1);< 8631#fiboENTRY ~n := #in~n; 8650#L6 assume !(~n < 1); 8649#L8 assume !(1 == ~n); 8537#L11 call #t~ret0 := fibo(~n - 1);< 8631#fiboENTRY ~n := #in~n; 8651#L6 assume !(~n < 1); 8699#L8 assume 1 == ~n;#res := 1; 8684#fiboFINAL assume true; 8681#fiboEXIT >#32#return; 8535#L11-1 call #t~ret1 := fibo(~n - 2);< 8538#fiboENTRY ~n := #in~n; 8677#L6 assume ~n < 1;#res := 0; 8676#fiboFINAL assume true; 8675#fiboEXIT >#34#return; 8673#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8672#fiboFINAL assume true; 8662#fiboEXIT >#32#return; 8658#L11-1 call #t~ret1 := fibo(~n - 2);< 8659#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8666#L8 assume 1 == ~n;#res := 1; 8554#fiboFINAL assume true; 8657#fiboEXIT >#34#return; 8621#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8652#fiboFINAL assume true; 8626#fiboEXIT >#32#return; 8553#L11-1 call #t~ret1 := fibo(~n - 2);< 8628#fiboENTRY ~n := #in~n; 8559#L6 assume !(~n < 1); 8550#L8 assume !(1 == ~n); 8507#L11 call #t~ret0 := fibo(~n - 1);< 8540#fiboENTRY ~n := #in~n; 8755#L6 assume !(~n < 1); 8752#L8 assume !(1 == ~n); 8561#L11 call #t~ret0 := fibo(~n - 1);< 8565#fiboENTRY ~n := #in~n; 8586#L6 assume !(~n < 1); 8584#L8 assume !(1 == ~n); 8562#L11 [2018-11-29 00:03:35,473 INFO L796 eck$LassoCheckResult]: Loop: 8562#L11 call #t~ret0 := fibo(~n - 1);< 8565#fiboENTRY ~n := #in~n; 8586#L6 assume !(~n < 1); 8584#L8 assume !(1 == ~n); 8562#L11 [2018-11-29 00:03:35,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 272834295, now seen corresponding path program 3 times [2018-11-29 00:03:35,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:35,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-29 00:03:35,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:35,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:03:35,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-29 00:03:35,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:35,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-29 00:03:35,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:35,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 19 [2018-11-29 00:03:35,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:35,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-11-29 00:03:35,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:35,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:35,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:35,938 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:35,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:35,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:35,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:35,938 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:35,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:35,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:35,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:35,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:03:35,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:35,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:35,940 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:35,942 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:35,954 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:35,957 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:36,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:36,055 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:36,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:36,058 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:36,063 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:36,063 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:36,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:36,084 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:36,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:36,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:37,246 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:37,248 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:37,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:37,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:37,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:37,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:37,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:37,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:37,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:37,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:03:37,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:37,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:37,249 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:37,253 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:37,261 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:37,264 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:37,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:37,314 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:37,315 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:37,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:37,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:37,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:37,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:37,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:37,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:37,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:37,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:37,318 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:37,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:37,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:37,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:37,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:37,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:37,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:37,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:37,322 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:37,324 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:37,324 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:37,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:37,324 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:37,325 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:37,325 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:37,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:37,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,507 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:37,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:37,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-29 00:03:37,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 285 states and 380 transitions. Complement of second has 18 states. [2018-11-29 00:03:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:37,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:03:37,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:37,592 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:37,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,921 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:37,922 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:37,922 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-29 00:03:38,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 291 states and 386 transitions. Complement of second has 17 states. [2018-11-29 00:03:38,030 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:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:38,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:03:38,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:38,031 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:38,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:38,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:38,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:38,306 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:38,306 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 4 loop predicates [2018-11-29 00:03:38,306 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-29 00:03:38,374 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 349 states and 462 transitions. Complement of second has 27 states. [2018-11-29 00:03:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:38,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:03:38,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:38,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:03:38,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:38,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 8 letters. [2018-11-29 00:03:38,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:38,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 462 transitions. [2018-11-29 00:03:38,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:38,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 274 states and 369 transitions. [2018-11-29 00:03:38,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-29 00:03:38,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-29 00:03:38,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 369 transitions. [2018-11-29 00:03:38,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:38,389 INFO L705 BuchiCegarLoop]: Abstraction has 274 states and 369 transitions. [2018-11-29 00:03:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 369 transitions. [2018-11-29 00:03:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-11-29 00:03:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-29 00:03:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2018-11-29 00:03:38,401 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2018-11-29 00:03:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-29 00:03:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-11-29 00:03:38,403 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 19 states. [2018-11-29 00:03:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:38,916 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2018-11-29 00:03:38,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:03:38,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 336 transitions. [2018-11-29 00:03:38,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:38,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 0 states and 0 transitions. [2018-11-29 00:03:38,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:38,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:38,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:38,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:38,923 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:38,924 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:38,924 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:38,924 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:03:38,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:38,924 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:38,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:38,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:38 BoogieIcfgContainer [2018-11-29 00:03:38,936 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:38,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:38,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:38,936 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:38,937 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:12" (3/4) ... [2018-11-29 00:03:38,943 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:38,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:38,945 INFO L168 Benchmark]: Toolchain (without parser) took 27077.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -275.6 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:38,947 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:38,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.25 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:38,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,950 INFO L168 Benchmark]: Boogie Preprocessor took 24.38 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,951 INFO L168 Benchmark]: RCFGBuilder took 384.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:38,953 INFO L168 Benchmark]: BuchiAutomizer took 26293.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.2 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:38,954 INFO L168 Benchmark]: Witness Printer took 7.75 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,960 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 314.25 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 46.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.38 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26293.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.2 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.75 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 12 terminating modules (6 trivial, 2 deterministic, 4 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. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.2s and 8 iterations. TraceHistogramMax:12. Analysis of lassos took 16.2s. Construction of modules took 3.0s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 342 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 239 SDtfs, 640 SDslu, 300 SDs, 0 SdLazy, 1132 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...