./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7b71b458b3f08f188a62c7539b715f43fd7f97d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:34:18,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:34:18,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:34:18,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:34:18,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:34:18,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:34:18,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:34:18,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:34:18,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:34:18,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:34:18,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:34:18,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:34:18,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:34:18,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:34:18,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:34:18,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:34:18,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:34:18,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:34:18,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:34:18,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:34:18,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:34:18,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:34:18,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:34:18,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:34:18,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:34:18,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:34:18,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:34:18,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:34:18,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:34:18,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:34:18,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:34:18,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:34:18,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:34:18,750 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:34:18,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:34:18,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:34:18,753 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:34:18,798 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:34:18,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:34:18,801 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:34:18,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:34:18,803 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:34:18,804 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:34:18,804 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:34:18,804 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:34:18,805 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:34:18,807 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:34:18,807 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:34:18,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:34:18,808 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:34:18,809 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:34:18,809 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:34:18,809 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:34:18,809 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:34:18,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:34:18,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:34:18,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:34:18,812 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:34:18,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:34:18,812 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:34:18,813 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:34:18,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:34:18,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:34:18,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:34:18,814 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:34:18,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:34:18,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:34:18,815 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:34:18,816 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:34:18,817 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7b71b458b3f08f188a62c7539b715f43fd7f97d [2019-01-14 04:34:18,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:34:18,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:34:18,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:34:18,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:34:18,924 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:34:18,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c [2019-01-14 04:34:19,009 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17598948/68132d131bd74c91882f8dd1e0482513/FLAG68fe24f8e [2019-01-14 04:34:19,611 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:34:19,612 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c [2019-01-14 04:34:19,619 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17598948/68132d131bd74c91882f8dd1e0482513/FLAG68fe24f8e [2019-01-14 04:34:19,884 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17598948/68132d131bd74c91882f8dd1e0482513 [2019-01-14 04:34:19,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:34:19,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:34:19,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:19,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:34:19,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:34:19,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:19" (1/1) ... [2019-01-14 04:34:19,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be80ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:19, skipping insertion in model container [2019-01-14 04:34:19,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:19" (1/1) ... [2019-01-14 04:34:19,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:34:19,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:34:20,265 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:20,275 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:34:20,302 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:20,326 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:34:20,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20 WrapperNode [2019-01-14 04:34:20,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:20,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:20,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:34:20,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:34:20,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:20,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:34:20,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:34:20,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:34:20,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... [2019-01-14 04:34:20,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:34:20,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:34:20,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:34:20,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:34:20,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:34:20,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:34:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-14 04:34:20,610 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-14 04:34:20,851 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:34:20,852 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:34:20,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:20 BoogieIcfgContainer [2019-01-14 04:34:20,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:34:20,855 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:34:20,856 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:34:20,865 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:34:20,870 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:20,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:34:19" (1/3) ... [2019-01-14 04:34:20,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23f13fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:20, skipping insertion in model container [2019-01-14 04:34:20,876 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:20,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:20" (2/3) ... [2019-01-14 04:34:20,877 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23f13fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:20, skipping insertion in model container [2019-01-14 04:34:20,877 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:20,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:20" (3/3) ... [2019-01-14 04:34:20,880 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_5_true-unreach-call_true-termination.c [2019-01-14 04:34:21,012 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:34:21,013 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:34:21,013 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:34:21,017 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:34:21,017 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:34:21,017 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:34:21,018 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:34:21,018 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:34:21,018 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:34:21,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:21,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:21,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:21,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:21,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:21,115 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:21,115 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:34:21,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:21,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:21,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:21,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:21,120 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:21,120 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:21,131 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-14 04:34:21,132 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 [2019-01-14 04:34:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-14 04:34:21,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:21,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:21,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-14 04:34:21,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:21,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:21,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:21,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-14 04:34:21,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:21,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:21,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:21,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:21,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:21,529 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:21,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:21,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:21,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:21,532 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:21,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:21,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:21,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:21,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:21,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:21,533 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:21,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:21,796 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 04:34:21,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:21,892 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:21,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:21,939 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:21,939 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) [2019-01-14 04:34:21,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:21,989 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 [2019-01-14 04:34:22,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:22,003 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:22,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:22,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:22,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:22,056 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:22,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:22,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:22,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:22,083 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 [2019-01-14 04:34:22,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:22,112 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 [2019-01-14 04:34:22,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:22,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:22,190 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:22,192 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:22,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:22,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:22,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:22,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:22,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:22,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:22,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:22,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:22,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:22,194 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:22,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,409 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:22,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:22,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:22,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:22,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:22,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:22,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:22,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:22,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:22,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:22,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:22,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:22,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:22,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:22,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:22,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:22,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:22,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:22,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:22,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:22,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:22,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:22,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:22,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:22,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:22,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:22,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:22,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:22,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:22,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:22,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:22,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:22,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:22,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:22,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:22,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:22,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:22,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:22,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:22,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:22,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:22,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:22,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:22,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:22,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:22,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:22,467 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:22,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:22,476 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:22,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:22,480 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:22,480 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:22,481 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:22,484 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:22,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:22,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:23,053 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:34:23,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 04:34:23,495 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. [2019-01-14 04:34:23,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:34:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:34:23,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:34:23,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:23,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:34:23,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:23,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:34:23,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:23,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:34:23,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:23,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-14 04:34:23,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:34:23,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:34:23,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:34:23,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:23,544 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:34:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:34:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:34:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:34:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:34:23,581 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:23,581 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:23,582 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:34:23,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:34:23,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:23,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:23,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:23,586 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:23,587 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:23,587 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-14 04:34:23,587 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 [2019-01-14 04:34:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-14 04:34:23,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:23,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:23,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:23,763 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-14 04:34:23,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:23,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:23,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:23,919 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2019-01-14 04:34:24,084 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-01-14 04:34:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:24,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:24,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:24,296 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:24,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:34:24,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:34:24,307 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:34:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:24,567 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:34:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:34:24,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:34:24,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:24,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:34:24,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:34:24,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:34:24,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:34:24,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:24,577 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:34:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:34:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:34:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:34:24,585 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:24,585 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:24,586 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:34:24,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:34:24,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:24,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:24,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:24,589 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:24,590 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:24,591 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-14 04:34:24,591 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 [2019-01-14 04:34:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-14 04:34:24,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:24,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:24,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:24,696 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 [2019-01-14 04:34:24,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:24,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:24,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:24,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:34:24,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-14 04:34:24,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:24,979 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:24,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:24,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:24,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:24,980 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:24,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:24,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:24,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:24,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:24,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:24,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:24,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:25,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:25,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:25,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:25,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:25,144 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 [2019-01-14 04:34:25,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:25,148 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 [2019-01-14 04:34:25,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:25,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:25,934 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:25,938 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:25,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:25,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:25,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:25,938 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:25,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:25,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:25,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:25,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:25,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:25,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:25,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:25,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:25,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:26,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:26,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:26,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:26,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:26,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:26,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:26,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:26,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:26,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:26,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:26,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:26,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:26,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:26,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:26,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:26,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:26,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:26,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:26,133 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:26,142 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:26,144 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:26,144 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:26,145 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:26,145 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:26,145 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:26,147 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:26,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:26,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:26,380 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 [2019-01-14 04:34:26,380 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:34:26,750 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. [2019-01-14 04:34:26,752 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 [2019-01-14 04:34:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:26,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:34:26,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:34:26,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:34:26,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:26,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:34:26,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:26,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:34:26,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:34:26,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:26,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:34:26,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:26,781 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:34:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:34:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:34:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:34:26,801 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:34:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:34:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:34:26,802 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:34:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:26,973 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:34:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:34:26,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:34:26,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:26,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:34:26,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:34:26,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:26,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:34:26,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:26,987 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:34:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:34:27,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:34:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:34:27,005 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:27,005 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:27,005 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:34:27,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:34:27,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:27,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:27,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:27,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:27,014 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:27,015 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:34:27,015 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 [2019-01-14 04:34:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-14 04:34:27,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:27,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:27,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:27,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 04:34:27,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:27,179 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 [2019-01-14 04:34:27,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:27,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 04:34:27,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:27,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:34:27,249 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-14 04:34:27,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:27,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:27,413 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:27,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:27,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:27,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:27,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:27,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:27,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:27,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:27,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:27,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:27,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:27,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:27,534 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 [2019-01-14 04:34:27,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:27,539 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 [2019-01-14 04:34:27,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:27,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:28,299 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:28,303 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:28,303 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:28,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:28,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:28,303 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:28,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:28,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:28,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:28,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:28,304 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:28,304 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:28,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,396 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:28,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:28,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:28,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:28,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:28,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:28,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:28,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:28,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:28,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:28,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:28,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:28,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:28,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:28,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:28,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:28,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:28,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:28,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:28,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:28,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:28,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:28,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:28,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:28,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:28,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:28,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:28,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:28,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:28,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:28,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:28,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:28,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:28,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:28,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:28,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:28,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:28,436 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:28,447 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:28,447 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:28,449 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:28,449 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:28,449 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:28,450 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:28,450 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:28,753 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 [2019-01-14 04:34:28,753 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:29,037 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. [2019-01-14 04:34:29,038 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 [2019-01-14 04:34:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:29,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:29,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:29,040 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:29,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:29,256 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 [2019-01-14 04:34:29,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:29,475 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. [2019-01-14 04:34:29,481 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 [2019-01-14 04:34:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:34:29,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:29,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:29,483 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:29,865 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 [2019-01-14 04:34:29,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:30,412 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. [2019-01-14 04:34:30,416 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 [2019-01-14 04:34:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:34:30,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:30,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:34:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:34:30,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:34:30,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:30,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:34:30,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:34:30,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:34:30,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:34:30,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:30,473 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:34:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:34:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:34:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:34:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:34:30,520 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:34:30,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:34:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:34:30,522 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:34:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:31,322 INFO L93 Difference]: Finished difference Result 497 states and 787 transitions. [2019-01-14 04:34:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:34:31,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 787 transitions. [2019-01-14 04:34:31,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:31,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 784 transitions. [2019-01-14 04:34:31,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:34:31,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:34:31,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 784 transitions. [2019-01-14 04:34:31,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:31,358 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 784 transitions. [2019-01-14 04:34:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 784 transitions. [2019-01-14 04:34:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 365. [2019-01-14 04:34:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-14 04:34:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 517 transitions. [2019-01-14 04:34:31,407 INFO L729 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-01-14 04:34:31,407 INFO L609 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-01-14 04:34:31,407 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:34:31,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 517 transitions. [2019-01-14 04:34:31,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:31,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:31,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:31,419 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:31,420 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:31,420 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3586#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3597#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3594#L6 assume !(~n < 1); 3595#L8 assume !(1 == ~n); 3555#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3591#L6 assume !(~n < 1); 3593#L8 assume !(1 == ~n); 3554#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3590#L6 assume !(~n < 1); 3553#L8 assume 1 == ~n;#res := 1; 3556#fiboFINAL assume true; 3672#fiboEXIT >#32#return; 3617#L11-1 call #t~ret1 := fibo(~n - 2);< 3618#fiboENTRY ~n := #in~n; 3739#L6 assume !(~n < 1); 3736#L8 assume !(1 == ~n); 3737#L11 call #t~ret0 := fibo(~n - 1);< 3749#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3863#L8 assume !(1 == ~n); 3666#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2019-01-14 04:34:31,420 INFO L796 eck$LassoCheckResult]: Loop: 3872#fiboENTRY ~n := #in~n; 3879#L6 assume !(~n < 1); 3878#L8 assume !(1 == ~n); 3667#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2019-01-14 04:34:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-14 04:34:31,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:31,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:31,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:31,629 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 [2019-01-14 04:34:31,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:31,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:34:31,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:31,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-01-14 04:34:31,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-14 04:34:31,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:31,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:31,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:31,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:31,862 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:31,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:31,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:31,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:31,862 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:31,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:31,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:31,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:31,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:31,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:31,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:31,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:31,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:31,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:31,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:31,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:31,927 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:31,928 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 [2019-01-14 04:34:31,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:31,932 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:31,936 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:31,936 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 [2019-01-14 04:34:31,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:31,964 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 [2019-01-14 04:34:31,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:31,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:32,038 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:32,040 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:32,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:32,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:32,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:32,041 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:32,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:32,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:32,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:32,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:32,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:32,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:32,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:32,148 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:32,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:32,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:32,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:32,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:32,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:32,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:32,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:32,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:32,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:32,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:32,162 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:32,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:32,163 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:32,164 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:32,164 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:32,164 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:32,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:32,327 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 04:34:32,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-14 04:34:32,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2019-01-14 04:34:32,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:32,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:32,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,434 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:32,667 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 [2019-01-14 04:34:32,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-14 04:34:32,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2019-01-14 04:34:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:32,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:32,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:32,897 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:33,163 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 [2019-01-14 04:34:33,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2019-01-14 04:34:33,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 492 states and 654 transitions. Complement of second has 14 states. [2019-01-14 04:34:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:34:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:34:33,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:34:33,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 654 transitions. [2019-01-14 04:34:33,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:33,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 405 states and 565 transitions. [2019-01-14 04:34:33,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-01-14 04:34:33,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2019-01-14 04:34:33,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 405 states and 565 transitions. [2019-01-14 04:34:33,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:33,320 INFO L706 BuchiCegarLoop]: Abstraction has 405 states and 565 transitions. [2019-01-14 04:34:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states and 565 transitions. [2019-01-14 04:34:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 389. [2019-01-14 04:34:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-14 04:34:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 541 transitions. [2019-01-14 04:34:33,363 INFO L729 BuchiCegarLoop]: Abstraction has 389 states and 541 transitions. [2019-01-14 04:34:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:34:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:34:33,364 INFO L87 Difference]: Start difference. First operand 389 states and 541 transitions. Second operand 20 states. [2019-01-14 04:34:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:34,661 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2019-01-14 04:34:34,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:34:34,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2019-01-14 04:34:34,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:34,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 0 states and 0 transitions. [2019-01-14 04:34:34,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:34,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:34,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:34,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:34,671 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:34,671 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:34,671 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:34,671 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:34:34,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:34,671 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:34,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:34,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:34 BoogieIcfgContainer [2019-01-14 04:34:34,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:34,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:34,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:34,688 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:34,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:20" (3/4) ... [2019-01-14 04:34:34,697 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:34,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:34,699 INFO L168 Benchmark]: Toolchain (without parser) took 14802.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 947.3 MB in the beginning and 765.6 MB in the end (delta: 181.7 MB). Peak memory consumption was 380.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,700 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.49 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,705 INFO L168 Benchmark]: Boogie Preprocessor took 32.36 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,706 INFO L168 Benchmark]: RCFGBuilder took 440.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,707 INFO L168 Benchmark]: BuchiAutomizer took 13830.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 765.6 MB in the end (delta: 330.2 MB). Peak memory consumption was 418.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:34,710 INFO L168 Benchmark]: Witness Printer took 9.82 ms. Allocated memory is still 1.2 GB. Free memory is still 765.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:34,717 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.23 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 430.49 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 51.43 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.36 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 440.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13830.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 765.6 MB in the end (delta: 330.2 MB). Peak memory consumption was 418.8 MB. Max. memory is 11.5 GB. * Witness Printer took 9.82 ms. Allocated memory is still 1.2 GB. Free memory is still 765.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.7s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 5.8s. Construction of modules took 2.0s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 365 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 149 SDtfs, 379 SDslu, 185 SDs, 0 SdLazy, 716 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...