./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer --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 7e40a98558d0111ea95f3ee60a44cc14c7768182 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:09:10,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:09:10,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:09:10,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:09:10,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:09:10,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:09:10,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:09:10,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:09:10,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:09:10,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:09:10,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:09:10,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:09:10,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:09:10,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:09:10,788 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:09:10,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:09:10,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:09:10,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:09:10,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:09:10,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:09:10,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:09:10,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:09:10,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:09:10,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:09:10,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:09:10,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:09:10,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:09:10,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:09:10,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:09:10,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:09:10,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:09:10,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:09:10,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:09:10,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:09:10,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:09:10,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:09:10,801 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:09:10,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:09:10,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:09:10,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:09:10,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:09:10,812 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:09:10,812 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:09:10,812 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:09:10,813 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:09:10,813 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:09:10,813 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:09:10,813 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:09:10,813 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:09:10,813 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:09:10,813 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:09:10,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:09:10,815 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:09:10,815 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:09:10,815 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:09:10,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:09:10,815 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:09:10,815 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:09:10,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:09:10,816 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:09:10,816 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:09:10,816 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:09:10,816 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer 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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-11-18 09:09:10,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:09:10,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:09:10,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:09:10,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:09:10,850 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:09:10,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-18 09:09:10,896 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/data/058deedaf/1f010552454e4dd5a964088266c2f4d0/FLAGe3f7ad797 [2018-11-18 09:09:11,233 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:09:11,233 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-18 09:09:11,238 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/data/058deedaf/1f010552454e4dd5a964088266c2f4d0/FLAGe3f7ad797 [2018-11-18 09:09:11,654 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/data/058deedaf/1f010552454e4dd5a964088266c2f4d0 [2018-11-18 09:09:11,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:09:11,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:09:11,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:09:11,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:09:11,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:09:11,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac16c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11, skipping insertion in model container [2018-11-18 09:09:11,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:09:11,678 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:09:11,780 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:09:11,783 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:09:11,791 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:09:11,799 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:09:11,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11 WrapperNode [2018-11-18 09:09:11,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:09:11,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:09:11,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:09:11,800 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:09:11,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:09:11,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:09:11,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:09:11,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:09:11,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... [2018-11-18 09:09:11,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:09:11,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:09:11,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:09:11,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:09:11,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:11,893 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-18 09:09:11,893 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-18 09:09:11,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:09:11,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:09:11,975 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:09:11,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:11 BoogieIcfgContainer [2018-11-18 09:09:11,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:09:11,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:09:11,976 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:09:11,977 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:09:11,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:09:11,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:09:11" (1/3) ... [2018-11-18 09:09:11,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57bbfe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:09:11, skipping insertion in model container [2018-11-18 09:09:11,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:09:11,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:11" (2/3) ... [2018-11-18 09:09:11,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57bbfe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:09:11, skipping insertion in model container [2018-11-18 09:09:11,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:09:11,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:11" (3/3) ... [2018-11-18 09:09:11,980 INFO L375 chiAutomizerObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-18 09:09:12,012 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:09:12,013 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:09:12,013 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:09:12,013 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:09:12,013 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:09:12,013 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:09:12,013 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:09:12,013 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:09:12,013 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:09:12,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 09:09:12,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 09:09:12,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:12,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:12,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 09:09:12,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:09:12,043 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:09:12,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 09:09:12,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 09:09:12,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:12,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:12,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 09:09:12,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:09:12,049 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6#L27true call main_#t~ret2 := fibonacci(main_~x~0);< 17#fibonacciENTRYtrue [2018-11-18 09:09:12,049 INFO L796 eck$LassoCheckResult]: Loop: 17#fibonacciENTRYtrue ~n := #in~n; 15#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 17#fibonacciENTRYtrue [2018-11-18 09:09:12,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 42781, now seen corresponding path program 1 times [2018-11-18 09:09:12,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:12,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash 927641, now seen corresponding path program 1 times [2018-11-18 09:09:12,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:12,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 854450357, now seen corresponding path program 1 times [2018-11-18 09:09:12,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:12,205 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:12,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:12,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:12,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:12,206 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:09:12,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:12,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:12,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-18 09:09:12,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:12,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:12,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:12,284 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/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 [2018-11-18 09:09:12,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:12,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:12,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:12,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:12,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:12,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:12,327 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:12,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:12,344 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:12,344 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:12,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:12,361 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:12,361 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:12,376 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:09:12,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:12,409 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:09:12,410 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:12,410 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:12,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:12,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:12,411 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:09:12,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:12,411 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:12,411 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:12,411 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-18 09:09:12,411 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:12,411 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:12,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:12,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:12,482 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:09:12,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:12,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:12,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:12,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:12,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:12,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:12,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:12,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:12,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:12,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:12,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:12,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:12,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:12,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:12,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:12,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:12,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:12,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:12,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:12,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:12,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:12,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:12,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:12,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:12,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:12,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:12,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:12,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:12,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:12,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:12,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:12,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:12,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:12,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:12,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:12,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:12,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:12,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:12,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:12,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:12,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:12,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:12,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:12,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:12,506 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:09:12,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:09:12,509 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:09:12,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:09:12,510 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:09:12,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:09:12,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-11-18 09:09:12,512 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:09:12,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:12,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:12,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:12,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 09:09:12,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-18 09:09:12,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-11-18 09:09:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:09:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 09:09:12,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 09:09:12,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:12,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 09:09:12,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:12,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 09:09:12,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:12,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-18 09:09:12,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 09:09:12,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 25 states and 34 transitions. [2018-11-18 09:09:12,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 09:09:12,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 09:09:12,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-18 09:09:12,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:12,717 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 09:09:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-18 09:09:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-18 09:09:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 09:09:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-18 09:09:12,736 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 09:09:12,736 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 09:09:12,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:09:12,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-18 09:09:12,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 09:09:12,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:12,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:12,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:12,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:12,738 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 121#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 134#fibonacciENTRY ~n := #in~n; 131#L15 assume !(~n < 1); 132#L17 assume !(1 == ~n); 125#L20 call #t~ret0 := fibonacci(~n - 1);< 126#fibonacciENTRY ~n := #in~n; 128#L15 assume ~n < 1;#res := 0; 129#fibonacciFINAL assume true; 127#fibonacciEXIT >#29#return; 123#L20-1 [2018-11-18 09:09:12,739 INFO L796 eck$LassoCheckResult]: Loop: 123#L20-1 call #t~ret1 := fibonacci(~n - 2);< 124#fibonacciENTRY ~n := #in~n; 138#L15 assume !(~n < 1); 137#L17 assume !(1 == ~n); 122#L20 call #t~ret0 := fibonacci(~n - 1);< 124#fibonacciENTRY ~n := #in~n; 138#L15 assume ~n < 1;#res := 0; 136#fibonacciFINAL assume true; 139#fibonacciEXIT >#29#return; 123#L20-1 [2018-11-18 09:09:12,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1391758089, now seen corresponding path program 1 times [2018-11-18 09:09:12,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:09:12,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:09:12,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:09:12,799 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:09:12,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash 924369961, now seen corresponding path program 1 times [2018-11-18 09:09:12,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:09:12,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:09:12,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:09:12,831 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:09:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:09:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:09:12,835 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 09:09:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:09:12,912 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-18 09:09:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:09:12,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-18 09:09:12,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 09:09:12,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-18 09:09:12,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 09:09:12,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 09:09:12,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-18 09:09:12,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:12,915 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 09:09:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-18 09:09:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 09:09:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 09:09:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-18 09:09:12,917 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 09:09:12,917 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 09:09:12,917 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:09:12,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-18 09:09:12,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 09:09:12,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:12,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:12,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:12,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:12,919 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 186#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 199#fibonacciENTRY ~n := #in~n; 196#L15 assume !(~n < 1); 197#L17 assume !(1 == ~n); 190#L20 call #t~ret0 := fibonacci(~n - 1);< 191#fibonacciENTRY ~n := #in~n; 194#L15 assume !(~n < 1); 195#L17 assume 1 == ~n;#res := 1; 200#fibonacciFINAL assume true; 205#fibonacciEXIT >#29#return; 188#L20-1 [2018-11-18 09:09:12,919 INFO L796 eck$LassoCheckResult]: Loop: 188#L20-1 call #t~ret1 := fibonacci(~n - 2);< 189#fibonacciENTRY ~n := #in~n; 208#L15 assume !(~n < 1); 206#L17 assume !(1 == ~n); 187#L20 call #t~ret0 := fibonacci(~n - 1);< 189#fibonacciENTRY ~n := #in~n; 208#L15 assume !(~n < 1); 206#L17 assume 1 == ~n;#res := 1; 207#fibonacciFINAL assume true; 203#fibonacciEXIT >#29#return; 188#L20-1 [2018-11-18 09:09:12,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 194852287, now seen corresponding path program 1 times [2018-11-18 09:09:12,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:12,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:09:12,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:09:12,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:12,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:12,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:09:12,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 09:09:12,994 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:09:12,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1409277793, now seen corresponding path program 1 times [2018-11-18 09:09:12,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:13,081 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:13,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:13,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:13,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:13,081 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:09:13,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:13,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:13,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:13,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-18 09:09:13,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:13,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:13,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:13,139 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:13,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:13,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:13,143 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:13,143 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:13,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:13,158 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:13,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:09:13,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:13,799 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:09:13,800 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:13,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:13,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:13,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:13,800 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:09:13,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:13,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:13,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:13,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-18 09:09:13,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:13,801 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:13,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:13,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:13,849 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:09:13,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:13,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:13,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:13,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:13,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:13,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:13,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:13,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:13,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:09:13,858 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:09:13,858 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:09:13,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:09:13,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:09:13,858 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:09:13,858 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-18 09:09:13,859 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:09:13,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:13,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:13,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:13,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 09:09:13,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-18 09:09:14,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-11-18 09:09:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:09:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 09:09:14,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 09:09:14,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:14,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-18 09:09:14,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:14,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-18 09:09:14,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:14,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-18 09:09:14,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 09:09:14,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-18 09:09:14,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-18 09:09:14,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 09:09:14,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-18 09:09:14,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:14,067 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-18 09:09:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-18 09:09:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-18 09:09:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 09:09:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-18 09:09:14,075 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-18 09:09:14,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:09:14,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:09:14,075 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-18 09:09:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:09:14,122 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-18 09:09:14,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:09:14,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-18 09:09:14,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 09:09:14,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-18 09:09:14,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-18 09:09:14,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 09:09:14,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-18 09:09:14,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:14,129 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-18 09:09:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-18 09:09:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-18 09:09:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 09:09:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-18 09:09:14,138 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-18 09:09:14,138 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-18 09:09:14,138 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:09:14,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-18 09:09:14,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 09:09:14,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:14,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:14,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:14,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:14,141 INFO L794 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 708#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 709#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 729#fibonacciENTRY ~n := #in~n; 727#L15 assume !(~n < 1); 728#L17 assume !(1 == ~n); 714#L20 call #t~ret0 := fibonacci(~n - 1);< 715#fibonacciENTRY ~n := #in~n; 733#L15 assume !(~n < 1); 736#L17 assume !(1 == ~n); 731#L20 call #t~ret0 := fibonacci(~n - 1);< 715#fibonacciENTRY ~n := #in~n; 733#L15 assume !(~n < 1); 736#L17 assume !(1 == ~n); 731#L20 call #t~ret0 := fibonacci(~n - 1);< 715#fibonacciENTRY ~n := #in~n; 732#L15 assume !(~n < 1); 766#L17 assume 1 == ~n;#res := 1; 765#fibonacciFINAL assume true; 764#fibonacciEXIT >#29#return; 737#L20-1 call #t~ret1 := fibonacci(~n - 2);< 763#fibonacciENTRY ~n := #in~n; 799#L15 assume ~n < 1;#res := 0; 798#fibonacciFINAL assume true; 795#fibonacciEXIT >#31#return; 794#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 792#fibonacciFINAL assume true; 790#fibonacciEXIT >#29#return; 711#L20-1 [2018-11-18 09:09:14,141 INFO L796 eck$LassoCheckResult]: Loop: 711#L20-1 call #t~ret1 := fibonacci(~n - 2);< 713#fibonacciENTRY ~n := #in~n; 730#L15 assume !(~n < 1); 734#L17 assume !(1 == ~n); 710#L20 call #t~ret0 := fibonacci(~n - 1);< 713#fibonacciENTRY ~n := #in~n; 730#L15 assume !(~n < 1); 734#L17 assume 1 == ~n;#res := 1; 735#fibonacciFINAL assume true; 788#fibonacciEXIT >#29#return; 711#L20-1 [2018-11-18 09:09:14,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash 716279287, now seen corresponding path program 1 times [2018-11-18 09:09:14,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:14,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:14,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:14,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:14,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 09:09:14,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:09:14,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:09:14,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:14,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 09:09:14,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:09:14,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-18 09:09:14,239 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:09:14,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1409277793, now seen corresponding path program 2 times [2018-11-18 09:09:14,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:14,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:14,300 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:14,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:14,301 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:14,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:14,301 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:09:14,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:14,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:14,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:14,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-18 09:09:14,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:14,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:14,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,335 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:14,336 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:14,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:14,337 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:14,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:09:14,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:14,646 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:09:14,648 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:14,648 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:14,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:14,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:14,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:09:14,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:14,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:14,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:14,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-18 09:09:14,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:14,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:14,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:14,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:14,691 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:09:14,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:14,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:14,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:14,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:14,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:14,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:14,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:14,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:14,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:14,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:14,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:14,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:14,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:14,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:14,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:14,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:14,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:14,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:14,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:14,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:14,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:14,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:14,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:14,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:14,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:14,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:14,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:14,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:14,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:14,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:14,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:14,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:14,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:14,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:14,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:14,703 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:09:14,705 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:09:14,705 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:09:14,706 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:09:14,706 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:09:14,706 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:09:14,706 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-18 09:09:14,706 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:09:14,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:14,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:14,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:14,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 09:09:14,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 09:09:14,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-11-18 09:09:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:09:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 09:09:14,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 09:09:14,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:14,882 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:14,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:14,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:14,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:14,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 09:09:14,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 09:09:15,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-11-18 09:09:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:09:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-18 09:09:15,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 09:09:15,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:15,057 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:15,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:15,150 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 09:09:15,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 09:09:15,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-11-18 09:09:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:09:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-18 09:09:15,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 09:09:15,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:15,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-18 09:09:15,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:15,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-18 09:09:15,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:15,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-18 09:09:15,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 09:09:15,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-18 09:09:15,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-18 09:09:15,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-18 09:09:15,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-18 09:09:15,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:15,306 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-18 09:09:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-18 09:09:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-18 09:09:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-18 09:09:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-18 09:09:15,333 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-18 09:09:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:09:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:09:15,334 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-18 09:09:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:09:15,476 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-11-18 09:09:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:09:15,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-11-18 09:09:15,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 09:09:15,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-11-18 09:09:15,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-18 09:09:15,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-18 09:09:15,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-11-18 09:09:15,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:15,489 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-11-18 09:09:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-11-18 09:09:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-11-18 09:09:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 09:09:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-11-18 09:09:15,507 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-18 09:09:15,507 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-18 09:09:15,508 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:09:15,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-11-18 09:09:15,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 09:09:15,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:15,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:15,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:15,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:09:15,510 INFO L794 eck$LassoCheckResult]: Stem: 3589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 3569#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 3590#fibonacciENTRY ~n := #in~n; 3626#L15 assume !(~n < 1); 3625#L17 assume !(1 == ~n); 3621#L20 call #t~ret0 := fibonacci(~n - 1);< 3623#fibonacciENTRY ~n := #in~n; 3624#L15 assume !(~n < 1); 3620#L17 assume !(1 == ~n); 3592#L20 call #t~ret0 := fibonacci(~n - 1);< 3617#fibonacciENTRY ~n := #in~n; 3619#L15 assume !(~n < 1); 3622#L17 assume !(1 == ~n); 3593#L20 call #t~ret0 := fibonacci(~n - 1);< 3617#fibonacciENTRY ~n := #in~n; 3618#L15 assume !(~n < 1); 3591#L17 assume 1 == ~n;#res := 1; 3594#fibonacciFINAL assume true; 3670#fibonacciEXIT >#29#return; 3642#L20-1 call #t~ret1 := fibonacci(~n - 2);< 3654#fibonacciENTRY ~n := #in~n; 3845#L15 assume !(~n < 1); 3705#L17 assume !(1 == ~n); 3707#L20 call #t~ret0 := fibonacci(~n - 1);< 3854#fibonacciENTRY ~n := #in~n; 3920#L15 assume !(~n < 1); 3918#L17 assume !(1 == ~n); 3612#L20 call #t~ret0 := fibonacci(~n - 1);< 3926#fibonacciENTRY [2018-11-18 09:09:15,511 INFO L796 eck$LassoCheckResult]: Loop: 3926#fibonacciENTRY ~n := #in~n; 3611#L15 assume !(~n < 1); 3615#L17 assume !(1 == ~n); 3613#L20 call #t~ret0 := fibonacci(~n - 1);< 3926#fibonacciENTRY [2018-11-18 09:09:15,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1499701919, now seen corresponding path program 1 times [2018-11-18 09:09:15,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:15,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:15,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:09:15,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 09:09:15,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:09:15,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:09:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 09:09:15,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:09:15,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-18 09:09:15,667 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:09:15,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash 927641, now seen corresponding path program 2 times [2018-11-18 09:09:15,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:15,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:15,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:09:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:15,691 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:15,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:15,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:15,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:15,691 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:09:15,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:15,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:15,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:15,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-18 09:09:15,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:15,692 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:15,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,720 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:15,720 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:15,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:15,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:15,724 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:15,724 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:15,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:15,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:15,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:15,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:15,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:15,760 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:15,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:09:15,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:15,793 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:09:15,794 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:15,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:15,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:15,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:15,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:09:15,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:15,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:15,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:15,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-18 09:09:15,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:15,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:15,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:15,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:15,827 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:09:15,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:15,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:15,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:15,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:15,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:15,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:15,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:15,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:15,830 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:09:15,831 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:09:15,831 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:09:15,832 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:09:15,832 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:09:15,832 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:09:15,832 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-11-18 09:09:15,832 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:09:15,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:15,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 09:09:15,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 09:09:15,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-18 09:09:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:09:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 09:09:15,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 09:09:15,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:15,944 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:15,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:15,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:16,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:16,036 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 09:09:16,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 09:09:16,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-18 09:09:16,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:09:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 09:09:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 09:09:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:16,086 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:16,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:16,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:16,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:16,164 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 09:09:16,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 09:09:16,215 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 495 states and 657 transitions. Complement of second has 14 states. [2018-11-18 09:09:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:09:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 09:09:16,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 09:09:16,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:16,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-18 09:09:16,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:16,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-18 09:09:16,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:16,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-11-18 09:09:16,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 09:09:16,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-11-18 09:09:16,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-18 09:09:16,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-18 09:09:16,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-11-18 09:09:16,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:16,225 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-11-18 09:09:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-11-18 09:09:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-11-18 09:09:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-18 09:09:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-11-18 09:09:16,237 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-11-18 09:09:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:09:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:09:16,237 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-11-18 09:09:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:09:16,442 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-11-18 09:09:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:09:16,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-11-18 09:09:16,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 09:09:16,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-11-18 09:09:16,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-18 09:09:16,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-18 09:09:16,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-11-18 09:09:16,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:16,448 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-11-18 09:09:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-11-18 09:09:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-11-18 09:09:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 09:09:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-18 09:09:16,454 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 09:09:16,455 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 09:09:16,455 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:09:16,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-11-18 09:09:16,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 09:09:16,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:16,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:16,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:09:16,457 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:09:16,457 INFO L794 eck$LassoCheckResult]: Stem: 6367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6349#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 6368#fibonacciENTRY ~n := #in~n; 6454#L15 assume !(~n < 1); 6453#L17 assume !(1 == ~n); 6449#L20 call #t~ret0 := fibonacci(~n - 1);< 6452#fibonacciENTRY ~n := #in~n; 6451#L15 assume !(~n < 1); 6450#L17 assume !(1 == ~n); 6446#L20 call #t~ret0 := fibonacci(~n - 1);< 6448#fibonacciENTRY ~n := #in~n; 6445#L15 assume !(~n < 1); 6447#L17 assume !(1 == ~n); 6358#L20 call #t~ret0 := fibonacci(~n - 1);< 6442#fibonacciENTRY ~n := #in~n; 6443#L15 assume !(~n < 1); 6444#L17 assume !(1 == ~n); 6357#L20 call #t~ret0 := fibonacci(~n - 1);< 6442#fibonacciENTRY ~n := #in~n; 6443#L15 assume !(~n < 1); 6444#L17 assume !(1 == ~n); 6357#L20 call #t~ret0 := fibonacci(~n - 1);< 6442#fibonacciENTRY ~n := #in~n; 6438#L15 assume !(~n < 1); 6439#L17 assume 1 == ~n;#res := 1; 6551#fibonacciFINAL assume true; 6356#fibonacciEXIT >#29#return; 6359#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6386#fibonacciENTRY ~n := #in~n; 6550#L15 assume ~n < 1;#res := 0; 6549#fibonacciFINAL assume true; 6547#fibonacciEXIT >#31#return; 6538#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6536#fibonacciFINAL assume true; 6518#fibonacciEXIT >#29#return; 6363#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6527#fibonacciENTRY ~n := #in~n; 6544#L15 assume !(~n < 1); 6530#L17 assume !(1 == ~n); 6370#L20 call #t~ret0 := fibonacci(~n - 1);< 6352#fibonacciENTRY ~n := #in~n; 6434#L15 assume !(~n < 1); 6424#L17 assume !(1 == ~n); 6404#L20 call #t~ret0 := fibonacci(~n - 1);< 6407#fibonacciENTRY ~n := #in~n; 6421#L15 assume !(~n < 1); 6419#L17 assume !(1 == ~n); 6405#L20 [2018-11-18 09:09:16,457 INFO L796 eck$LassoCheckResult]: Loop: 6405#L20 call #t~ret0 := fibonacci(~n - 1);< 6407#fibonacciENTRY ~n := #in~n; 6421#L15 assume !(~n < 1); 6419#L17 assume !(1 == ~n); 6405#L20 [2018-11-18 09:09:16,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash 368806333, now seen corresponding path program 2 times [2018-11-18 09:09:16,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:16,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:16,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:09:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 09:09:16,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:09:16,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:09:16,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:09:16,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:09:16,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:09:16,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 09:09:16,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:09:16,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-18 09:09:16,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:09:16,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1757801, now seen corresponding path program 3 times [2018-11-18 09:09:16,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:16,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:16,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:09:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:16,732 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:16,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:16,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:16,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:16,732 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:09:16,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:16,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:16,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:16,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-11-18 09:09:16,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:16,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:16,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:16,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:16,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:16,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:16,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:16,757 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:16,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:16,760 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:16,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:09:16,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:17,581 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:09:17,582 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:17,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:17,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:17,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:17,582 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:09:17,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:17,582 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:17,582 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:17,582 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-11-18 09:09:17,583 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:17,583 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:17,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:17,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:17,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:17,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:17,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:17,618 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:09:17,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:17,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:17,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:17,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:17,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:17,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:17,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:17,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:17,622 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:09:17,624 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:09:17,624 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:09:17,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:09:17,624 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:09:17,625 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:09:17,625 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-18 09:09:17,625 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:09:17,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:17,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:17,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:17,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:09:17,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 09:09:17,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 216 states and 274 transitions. Complement of second has 18 states. [2018-11-18 09:09:17,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:09:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 09:09:17,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 09:09:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:17,738 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:17,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:17,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:17,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:17,810 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:09:17,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 09:09:17,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 222 states and 280 transitions. Complement of second has 17 states. [2018-11-18 09:09:17,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:09:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 09:09:17,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 09:09:17,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:17,862 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:17,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:17,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:17,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:17,955 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:09:17,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 09:09:18,010 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 272 states and 344 transitions. Complement of second has 27 states. [2018-11-18 09:09:18,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:09:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 09:09:18,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 09:09:18,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:18,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-11-18 09:09:18,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:18,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-11-18 09:09:18,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:18,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-11-18 09:09:18,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 09:09:18,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-11-18 09:09:18,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-18 09:09:18,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-18 09:09:18,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-11-18 09:09:18,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:18,020 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-11-18 09:09:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-11-18 09:09:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-11-18 09:09:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 09:09:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-18 09:09:18,025 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 09:09:18,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 09:09:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-18 09:09:18,026 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-11-18 09:09:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:09:18,248 INFO L93 Difference]: Finished difference Result 342 states and 459 transitions. [2018-11-18 09:09:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 09:09:18,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 459 transitions. [2018-11-18 09:09:18,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 09:09:18,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 316 states and 427 transitions. [2018-11-18 09:09:18,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-11-18 09:09:18,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-18 09:09:18,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 427 transitions. [2018-11-18 09:09:18,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:18,253 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 427 transitions. [2018-11-18 09:09:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 427 transitions. [2018-11-18 09:09:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-11-18 09:09:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 09:09:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-18 09:09:18,259 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 09:09:18,259 INFO L608 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 09:09:18,259 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:09:18,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2018-11-18 09:09:18,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 09:09:18,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:09:18,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:09:18,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 09:09:18,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:09:18,262 INFO L794 eck$LassoCheckResult]: Stem: 8580#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 8565#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 8585#fibonacciENTRY ~n := #in~n; 8685#L15 assume !(~n < 1); 8683#L17 assume !(1 == ~n); 8680#L20 call #t~ret0 := fibonacci(~n - 1);< 8681#fibonacciENTRY ~n := #in~n; 8696#L15 assume !(~n < 1); 8694#L17 assume !(1 == ~n); 8690#L20 call #t~ret0 := fibonacci(~n - 1);< 8693#fibonacciENTRY ~n := #in~n; 8722#L15 assume !(~n < 1); 8720#L17 assume !(1 == ~n); 8687#L20 call #t~ret0 := fibonacci(~n - 1);< 8691#fibonacciENTRY ~n := #in~n; 8711#L15 assume !(~n < 1); 8709#L17 assume !(1 == ~n); 8620#L20 call #t~ret0 := fibonacci(~n - 1);< 8705#fibonacciENTRY ~n := #in~n; 8750#L15 assume !(~n < 1); 8748#L17 assume !(1 == ~n); 8621#L20 call #t~ret0 := fibonacci(~n - 1);< 8705#fibonacciENTRY ~n := #in~n; 8750#L15 assume !(~n < 1); 8748#L17 assume !(1 == ~n); 8621#L20 call #t~ret0 := fibonacci(~n - 1);< 8705#fibonacciENTRY ~n := #in~n; 8750#L15 assume !(~n < 1); 8748#L17 assume !(1 == ~n); 8621#L20 call #t~ret0 := fibonacci(~n - 1);< 8705#fibonacciENTRY ~n := #in~n; 8752#L15 assume !(~n < 1); 8845#L17 assume 1 == ~n;#res := 1; 8844#fibonacciFINAL assume true; 8843#fibonacciEXIT >#29#return; 8619#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8622#fibonacciENTRY ~n := #in~n; 8785#L15 assume ~n < 1;#res := 0; 8784#fibonacciFINAL assume true; 8783#fibonacciEXIT >#31#return; 8781#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8780#fibonacciFINAL assume true; 8742#fibonacciEXIT >#29#return; 8734#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8736#fibonacciENTRY ~n := #in~n; 8771#L15 assume !(~n < 1); 8768#L17 assume 1 == ~n;#res := 1; 8628#fibonacciFINAL assume true; 8733#fibonacciEXIT >#31#return; 8729#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8727#fibonacciFINAL assume true; 8726#fibonacciEXIT >#29#return; 8627#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8703#fibonacciENTRY ~n := #in~n; 8636#L15 assume !(~n < 1); 8624#L17 assume !(1 == ~n); 8574#L20 call #t~ret0 := fibonacci(~n - 1);< 8568#fibonacciENTRY ~n := #in~n; 8583#L15 assume !(~n < 1); 8584#L17 assume !(1 == ~n); 8638#L20 call #t~ret0 := fibonacci(~n - 1);< 8641#fibonacciENTRY ~n := #in~n; 8653#L15 assume !(~n < 1); 8652#L17 assume !(1 == ~n); 8639#L20 [2018-11-18 09:09:18,262 INFO L796 eck$LassoCheckResult]: Loop: 8639#L20 call #t~ret0 := fibonacci(~n - 1);< 8641#fibonacciENTRY ~n := #in~n; 8653#L15 assume !(~n < 1); 8652#L17 assume !(1 == ~n); 8639#L20 [2018-11-18 09:09:18,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash -398853597, now seen corresponding path program 3 times [2018-11-18 09:09:18,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:18,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:18,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:09:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 153 proven. 80 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 09:09:18,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:09:18,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:09:18,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:09:18,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 09:09:18,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:09:18,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-18 09:09:18,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:09:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 24 [2018-11-18 09:09:18,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:09:18,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1757801, now seen corresponding path program 4 times [2018-11-18 09:09:18,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:09:18,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:09:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:18,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:09:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:09:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:09:18,471 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:18,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:18,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:18,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:18,471 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:09:18,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:18,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:18,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:18,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-11-18 09:09:18,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:18,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:18,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:18,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:18,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:18,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:18,499 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:18,499 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:18,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:18,502 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:18,503 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:09:18,504 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:18,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:09:18,519 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c9c5a5-df43-41f0-b4b7-b5a867bcd1b3/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:18,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:09:18,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:09:19,738 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:09:19,740 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:09:19,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:09:19,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:09:19,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:09:19,740 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:09:19,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:09:19,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:09:19,740 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:09:19,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-11-18 09:09:19,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:09:19,741 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:09:19,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:19,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:19,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:19,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:09:19,770 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:09:19,770 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:09:19,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:19,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:19,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:19,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:19,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:19,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:19,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:19,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:19,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:09:19,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:09:19,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:09:19,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:09:19,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:09:19,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:09:19,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:09:19,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:09:19,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:09:19,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:09:19,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:09:19,777 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:09:19,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:09:19,777 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:09:19,777 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:09:19,777 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-11-18 09:09:19,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:09:19,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:19,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:19,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:19,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:09:19,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 09:09:19,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 298 states and 400 transitions. Complement of second has 18 states. [2018-11-18 09:09:19,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:09:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 09:09:19,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 09:09:19,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:19,898 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:19,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:19,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:19,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:19,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:09:19,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 09:09:20,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 304 states and 406 transitions. Complement of second has 17 states. [2018-11-18 09:09:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:09:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 09:09:20,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 09:09:20,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:20,034 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:09:20,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:09:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:20,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:09:20,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:09:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:09:20,115 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:09:20,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 09:09:20,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 362 states and 482 transitions. Complement of second has 27 states. [2018-11-18 09:09:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:09:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:09:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 09:09:20,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 09:09:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-11-18 09:09:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-18 09:09:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:09:20,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 482 transitions. [2018-11-18 09:09:20,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 09:09:20,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 287 states and 389 transitions. [2018-11-18 09:09:20,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-18 09:09:20,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-18 09:09:20,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 389 transitions. [2018-11-18 09:09:20,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:09:20,162 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 389 transitions. [2018-11-18 09:09:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 389 transitions. [2018-11-18 09:09:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-11-18 09:09:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 09:09:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-18 09:09:20,169 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 09:09:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 09:09:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-11-18 09:09:20,170 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand 24 states. [2018-11-18 09:09:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:09:20,589 INFO L93 Difference]: Finished difference Result 434 states and 596 transitions. [2018-11-18 09:09:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 09:09:20,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 596 transitions. [2018-11-18 09:09:20,593 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:09:20,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 0 states and 0 transitions. [2018-11-18 09:09:20,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:09:20,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:09:20,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:09:20,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:09:20,594 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:09:20,594 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:09:20,594 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:09:20,594 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:09:20,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:09:20,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:09:20,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:09:20,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:09:20 BoogieIcfgContainer [2018-11-18 09:09:20,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:09:20,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:09:20,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:09:20,600 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:09:20,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:11" (3/4) ... [2018-11-18 09:09:20,603 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:09:20,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:09:20,604 INFO L168 Benchmark]: Toolchain (without parser) took 8947.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 192.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:09:20,605 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:09:20,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:09:20,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:09:20,606 INFO L168 Benchmark]: Boogie Preprocessor took 9.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:09:20,606 INFO L168 Benchmark]: RCFGBuilder took 149.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -204.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:09:20,607 INFO L168 Benchmark]: BuchiAutomizer took 8624.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.9 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:09:20,607 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:09:20,610 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 16.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 149.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -204.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8624.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.9 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 8 iterations. TraceHistogramMax:13. Analysis of lassos took 5.0s. Construction of modules took 0.9s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 330 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 370 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 258 SDtfs, 642 SDslu, 400 SDs, 0 SdLazy, 1421 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...