./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-635dfa2 [2018-12-02 07:06:25,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:06:25,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:06:25,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:06:25,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:06:25,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:06:25,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:06:25,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:06:25,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:06:25,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:06:25,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:06:25,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:06:25,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:06:25,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:06:25,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:06:25,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:06:25,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:06:25,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:06:25,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:06:25,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:06:25,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:06:25,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:06:25,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:06:25,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:06:25,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:06:25,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:06:25,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:06:25,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:06:25,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:06:25,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:06:25,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:06:25,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:06:25,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:06:25,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:06:25,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:06:25,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:06:25,701 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 07:06:25,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:06:25,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:06:25,710 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:06:25,710 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 07:06:25,710 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 07:06:25,711 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 07:06:25,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 07:06:25,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:06:25,712 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 07:06:25,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:06:25,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:06:25,713 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 07:06:25,713 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 07:06:25,713 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:25,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:06:25,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:06:25,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:06:25,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:06:25,740 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:06:25,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 07:06:25,778 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/data/1092595f4/435ac2d2a9664339962b65664df8428c/FLAG06bc2434d [2018-12-02 07:06:26,060 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:06:26,061 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 07:06:26,065 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/data/1092595f4/435ac2d2a9664339962b65664df8428c/FLAG06bc2434d [2018-12-02 07:06:26,073 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/bin-2019/uautomizer/data/1092595f4/435ac2d2a9664339962b65664df8428c [2018-12-02 07:06:26,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:06:26,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:06:26,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:06:26,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:06:26,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:06:26,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f79c046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26, skipping insertion in model container [2018-12-02 07:06:26,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:06:26,095 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:06:26,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:06:26,193 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:06:26,202 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:06:26,210 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:06:26,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26 WrapperNode [2018-12-02 07:06:26,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:06:26,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:06:26,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:06:26,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:06:26,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:06:26,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:06:26,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:06:26,229 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:06:26,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... [2018-12-02 07:06:26,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:06:26,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:06:26,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:06:26,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:06:26,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-02 07:06:26,300 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-02 07:06:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:06:26,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:06:26,369 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:06:26,369 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 07:06:26,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:06:26 BoogieIcfgContainer [2018-12-02 07:06:26,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:06:26,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 07:06:26,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 07:06:26,372 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 07:06:26,372 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:06:26,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 07:06:26" (1/3) ... [2018-12-02 07:06:26,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3365b5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:06:26, skipping insertion in model container [2018-12-02 07:06:26,373 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:06:26,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:06:26" (2/3) ... [2018-12-02 07:06:26,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3365b5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:06:26, skipping insertion in model container [2018-12-02 07:06:26,373 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:06:26,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:06:26" (3/3) ... [2018-12-02 07:06:26,374 INFO L375 chiAutomizerObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 07:06:26,406 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:06:26,407 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 07:06:26,407 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 07:06:26,407 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 07:06:26,407 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:06:26,407 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:06:26,407 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 07:06:26,407 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:06:26,407 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 07:06:26,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-02 07:06:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:06:26,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:26,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:26,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:06:26,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:06:26,435 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 07:06:26,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-02 07:06:26,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:06:26,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:26,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:26,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:06:26,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:06:26,441 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue 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);< 16#fibonacciENTRYtrue [2018-12-02 07:06:26,441 INFO L796 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2018-12-02 07:06:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2018-12-02 07:06:26,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:26,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:26,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:26,503 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2018-12-02 07:06:26,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:26,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:26,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:26,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:26,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:26,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2018-12-02 07:06:26,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:26,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:26,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:26,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:26,566 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:26,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:26,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:26,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:26,567 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 07:06:26,567 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:26,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:26,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:26,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-12-02 07:06:26,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:26,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:26,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,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-12-02 07:06:26,637 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:26,637 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:26,641 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:26,648 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:26,648 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:26,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:26,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:26,670 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:26,684 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:26,686 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:26,687 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:26,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:26,704 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:26,704 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:26,719 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:26,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 07:06:26,736 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:26,757 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 07:06:26,758 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:26,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:26,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:26,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:26,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:06:26,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:26,758 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:26,758 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:26,758 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-12-02 07:06:26,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:26,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:26,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:26,798 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:26,802 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:06:26,804 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-12-02 07:06:26,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:26,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:26,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:26,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:26,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:26,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:26,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:26,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:26,810 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-12-02 07:06:26,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:26,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:26,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:26,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:26,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:26,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:26,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:26,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:26,813 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-12-02 07:06:26,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:26,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:26,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:26,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:26,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:26,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:26,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:26,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:26,815 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-12-02 07:06:26,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:26,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:26,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:26,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:26,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:26,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:26,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:26,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:26,816 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-12-02 07:06:26,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:26,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:26,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:26,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:26,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:26,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:26,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:26,821 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:06:26,824 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:06:26,824 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:06:26,825 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:06:26,825 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:06:26,826 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:06:26,826 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-12-02 07:06:26,826 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 07:06:26,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:26,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:26,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:26,893 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-12-02 07:06:26,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2018-12-02 07:06:26,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-12-02 07:06:26,963 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-12-02 07:06:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:06:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-02 07:06:26,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 07:06:26,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:26,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 07:06:26,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:26,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-02 07:06:26,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:26,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-12-02 07:06:26,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:06:26,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2018-12-02 07:06:26,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 07:06:26,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 07:06:26,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-12-02 07:06:26,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:26,979 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 07:06:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-12-02 07:06:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-02 07:06:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 07:06:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-02 07:06:26,997 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-02 07:06:26,998 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-02 07:06:26,998 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 07:06:26,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-12-02 07:06:26,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:06:26,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:26,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:26,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:27,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:27,000 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 120#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 128#fibonacciENTRY ~n := #in~n; 125#L15 assume !(~n < 1); 126#L17 assume !(1 == ~n); 118#L20 call #t~ret0 := fibonacci(~n - 1);< 119#fibonacciENTRY ~n := #in~n; 122#L15 assume ~n < 1;#res := 0; 123#fibonacciFINAL assume true; 121#fibonacciEXIT >#28#return; 116#L20-1 [2018-12-02 07:06:27,000 INFO L796 eck$LassoCheckResult]: Loop: 116#L20-1 call #t~ret1 := fibonacci(~n - 2);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume !(~n < 1); 131#L17 assume !(1 == ~n); 115#L20 call #t~ret0 := fibonacci(~n - 1);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume ~n < 1;#res := 0; 130#fibonacciFINAL assume true; 132#fibonacciEXIT >#28#return; 116#L20-1 [2018-12-02 07:06:27,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2018-12-02 07:06:27,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:27,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:27,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 07:06:27,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:06:27,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:06:27,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:06:27,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:27,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2018-12-02 07:06:27,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 07:06:27,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:06:27,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:06:27,077 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 07:06:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:06:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:06:27,080 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-02 07:06:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:06:27,123 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-02 07:06:27,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:06:27,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-12-02 07:06:27,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:06:27,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-12-02 07:06:27,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 07:06:27,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 07:06:27,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-12-02 07:06:27,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:27,128 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-02 07:06:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-12-02 07:06:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 07:06:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 07:06:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-02 07:06:27,131 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-02 07:06:27,131 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-02 07:06:27,131 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 07:06:27,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-02 07:06:27,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:06:27,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:27,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:27,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:27,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:27,133 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 184#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 191#fibonacciENTRY ~n := #in~n; 188#L15 assume !(~n < 1); 189#L17 assume !(1 == ~n); 183#L20 call #t~ret0 := fibonacci(~n - 1);< 185#fibonacciENTRY ~n := #in~n; 186#L15 assume !(~n < 1); 187#L17 assume 1 == ~n;#res := 1; 192#fibonacciFINAL assume true; 199#fibonacciEXIT >#28#return; 180#L20-1 [2018-12-02 07:06:27,133 INFO L796 eck$LassoCheckResult]: Loop: 180#L20-1 call #t~ret1 := fibonacci(~n - 2);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume !(1 == ~n); 179#L20 call #t~ret0 := fibonacci(~n - 1);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume 1 == ~n;#res := 1; 196#fibonacciFINAL assume true; 197#fibonacciEXIT >#28#return; 180#L20-1 [2018-12-02 07:06:27,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2018-12-02 07:06:27,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:27,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:27,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:06:27,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:27,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:27,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:27,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:06:27,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 07:06:27,194 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:06:27,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 1 times [2018-12-02 07:06:27,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:27,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:27,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:27,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:27,259 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:27,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:27,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:27,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:27,259 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 07:06:27,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:27,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:27,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:27,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-12-02 07:06:27,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:27,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:27,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,290 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:27,291 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:27,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:27,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:27,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:27,295 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:27,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:27,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:27,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 07:06:27,327 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:27,940 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 07:06:27,941 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:27,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:27,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:27,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:27,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:06:27,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:27,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:27,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:27,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-12-02 07:06:27,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:27,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:27,993 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:27,993 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:06:27,994 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-12-02 07:06:27,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:27,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:27,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:27,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:27,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:27,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:27,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:27,999 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:06:28,001 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:06:28,001 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:06:28,002 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:06:28,002 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:06:28,002 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:06:28,002 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-02 07:06:28,002 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 07:06:28,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:28,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:28,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:28,075 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-12-02 07:06:28,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-12-02 07:06:28,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-12-02 07:06:28,176 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-12-02 07:06:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:06:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-02 07:06:28,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-02 07:06:28,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:28,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-12-02 07:06:28,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:28,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-12-02 07:06:28,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:28,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-12-02 07:06:28,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 07:06:28,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-12-02 07:06:28,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-12-02 07:06:28,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-02 07:06:28,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-12-02 07:06:28,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:28,188 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-12-02 07:06:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-12-02 07:06:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-12-02 07:06:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 07:06:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-12-02 07:06:28,199 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-12-02 07:06:28,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:06:28,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:06:28,199 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-12-02 07:06:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:06:28,264 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-12-02 07:06:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:06:28,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-12-02 07:06:28,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 07:06:28,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-12-02 07:06:28,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-02 07:06:28,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-02 07:06:28,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-12-02 07:06:28,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:28,269 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-12-02 07:06:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-12-02 07:06:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-02 07:06:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 07:06:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-02 07:06:28,275 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-02 07:06:28,275 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-02 07:06:28,275 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 07:06:28,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-12-02 07:06:28,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 07:06:28,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:28,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:28,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:28,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:28,277 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 696#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 711#fibonacciENTRY ~n := #in~n; 709#L15 assume !(~n < 1); 710#L17 assume !(1 == ~n); 695#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 715#L15 assume !(~n < 1); 754#L17 assume 1 == ~n;#res := 1; 753#fibonacciFINAL assume true; 752#fibonacciEXIT >#28#return; 728#L20-1 call #t~ret1 := fibonacci(~n - 2);< 751#fibonacciENTRY ~n := #in~n; 781#L15 assume ~n < 1;#res := 0; 780#fibonacciFINAL assume true; 777#fibonacciEXIT >#30#return; 776#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 774#fibonacciFINAL assume true; 772#fibonacciEXIT >#28#return; 692#L20-1 [2018-12-02 07:06:28,277 INFO L796 eck$LassoCheckResult]: Loop: 692#L20-1 call #t~ret1 := fibonacci(~n - 2);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume !(1 == ~n); 691#L20 call #t~ret0 := fibonacci(~n - 1);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume 1 == ~n;#res := 1; 717#fibonacciFINAL assume true; 770#fibonacciEXIT >#28#return; 692#L20-1 [2018-12-02 07:06:28,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2018-12-02 07:06:28,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:28,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:28,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 07:06:28,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:06:28,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:28,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:28,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 07:06:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:06:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 07:06:28,383 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:06:28,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 2 times [2018-12-02 07:06:28,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:28,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:28,462 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:28,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:28,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:28,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:28,462 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 07:06:28,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:28,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:28,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:28,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-12-02 07:06:28,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:28,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:28,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:28,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:28,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:28,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:28,487 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:28,487 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:28,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:28,489 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:28,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 07:06:28,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:28,797 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 07:06:28,799 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:28,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:28,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:28,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:28,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:06:28,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:28,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:28,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:28,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-12-02 07:06:28,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:28,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:28,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-12-02 07:06:28,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-12-02 07:06:28,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-12-02 07:06:28,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:28,835 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:28,835 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:06:28,835 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-12-02 07:06:28,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:28,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:28,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:28,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:28,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:28,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:28,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:28,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:28,838 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-12-02 07:06:28,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:28,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:28,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:28,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:28,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:28,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:28,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:28,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:28,839 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-12-02 07:06:28,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:28,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:28,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:28,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:28,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:28,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:28,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:28,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:28,841 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-12-02 07:06:28,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:28,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:28,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:28,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:28,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:28,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:28,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:28,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:06:28,845 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:06:28,845 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:06:28,846 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:06:28,846 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:06:28,846 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:06:28,846 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-02 07:06:28,846 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 07:06:28,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:28,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:28,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:28,928 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-12-02 07:06:28,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-02 07:06:29,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-12-02 07:06:29,004 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-12-02 07:06:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:06:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-02 07:06:29,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-02 07:06:29,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,005 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:29,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:29,075 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-12-02 07:06:29,075 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-02 07:06:29,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-12-02 07:06:29,151 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-12-02 07:06:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:06:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-02 07:06:29,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-02 07:06:29,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,152 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:29,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:29,224 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-12-02 07:06:29,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-02 07:06:29,340 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-12-02 07:06:29,341 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-12-02 07:06:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:06:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-12-02 07:06:29,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-02 07:06:29,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-12-02 07:06:29,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-12-02 07:06:29,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-12-02 07:06:29,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-02 07:06:29,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-12-02 07:06:29,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-12-02 07:06:29,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-12-02 07:06:29,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-12-02 07:06:29,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:29,357 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-12-02 07:06:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-12-02 07:06:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-12-02 07:06:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-02 07:06:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-12-02 07:06:29,375 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-12-02 07:06:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 07:06:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:06:29,375 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-12-02 07:06:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:06:29,489 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-12-02 07:06:29,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:06:29,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-12-02 07:06:29,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-02 07:06:29,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-12-02 07:06:29,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-12-02 07:06:29,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-12-02 07:06:29,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-12-02 07:06:29,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:29,499 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-12-02 07:06:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-12-02 07:06:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-12-02 07:06:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-02 07:06:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-12-02 07:06:29,512 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-02 07:06:29,512 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-02 07:06:29,512 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 07:06:29,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-12-02 07:06:29,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-02 07:06:29,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:29,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:29,514 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:29,514 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:06:29,514 INFO L794 eck$LassoCheckResult]: Stem: 3550#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 3551#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 3552#fibonacciENTRY ~n := #in~n; 3592#L15 assume !(~n < 1); 3591#L17 assume !(1 == ~n); 3587#L20 call #t~ret0 := fibonacci(~n - 1);< 3589#fibonacciENTRY ~n := #in~n; 3590#L15 assume !(~n < 1); 3586#L17 assume !(1 == ~n); 3554#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3584#L15 assume !(~n < 1); 3588#L17 assume !(1 == ~n); 3555#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3585#L15 assume !(~n < 1); 3553#L17 assume 1 == ~n;#res := 1; 3556#fibonacciFINAL assume true; 3627#fibonacciEXIT >#28#return; 3609#L20-1 call #t~ret1 := fibonacci(~n - 2);< 3617#fibonacciENTRY ~n := #in~n; 3726#L15 assume !(~n < 1); 3657#L17 assume !(1 == ~n); 3659#L20 call #t~ret0 := fibonacci(~n - 1);< 3880#fibonacciENTRY ~n := #in~n; 3884#L15 assume !(~n < 1); 3882#L17 assume !(1 == ~n); 3579#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2018-12-02 07:06:29,514 INFO L796 eck$LassoCheckResult]: Loop: 3582#fibonacciENTRY ~n := #in~n; 3577#L15 assume !(~n < 1); 3581#L17 assume !(1 == ~n); 3578#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2018-12-02 07:06:29,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1149422575, now seen corresponding path program 1 times [2018-12-02 07:06:29,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:29,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:29,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:29,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:06:29,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 07:06:29,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:06:29,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 07:06:29,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:06:29,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-02 07:06:29,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:06:29,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2018-12-02 07:06:29,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:29,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:29,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:06:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:29,645 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:29,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:29,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:29,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:29,645 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 07:06:29,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:29,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:29,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:29,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-12-02 07:06:29,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:29,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:29,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:29,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:29,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-12-02 07:06:29,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-12-02 07:06:29,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:29,667 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:29,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:29,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:29,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:29,671 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:29,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:29,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:29,687 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:29,687 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:29,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:29,703 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:29,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 07:06:29,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:29,735 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 07:06:29,736 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:29,736 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:29,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:29,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:29,736 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:06:29,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:29,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:29,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:29,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-12-02 07:06:29,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:29,737 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:29,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-12-02 07:06:29,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-12-02 07:06:29,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:29,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:29,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:29,760 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:06:29,760 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-12-02 07:06:29,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:29,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:29,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:29,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:29,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:29,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:29,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:29,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:06:29,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:06:29,764 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:06:29,764 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:06:29,764 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:06:29,764 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:06:29,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-12-02 07:06:29,764 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 07:06:29,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:29,821 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-12-02 07:06:29,821 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-02 07:06:29,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-02 07:06:29,856 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-12-02 07:06:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:06:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-02 07:06:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-02 07:06:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,857 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:29,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:29,916 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-12-02 07:06:29,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-02 07:06:29,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-02 07:06:29,948 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-12-02 07:06:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:06:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-02 07:06:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-02 07:06:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:29,948 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:29,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:29,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:30,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:30,019 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-12-02 07:06:30,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-02 07:06:30,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-12-02 07:06:30,082 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-12-02 07:06:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:06:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-02 07:06:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-02 07:06:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-02 07:06:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-12-02 07:06:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:30,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-12-02 07:06:30,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-02 07:06:30,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-12-02 07:06:30,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-12-02 07:06:30,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-12-02 07:06:30,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-12-02 07:06:30,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:30,090 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-12-02 07:06:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-12-02 07:06:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-12-02 07:06:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-02 07:06:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-12-02 07:06:30,101 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-12-02 07:06:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 07:06:30,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:06:30,101 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-12-02 07:06:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:06:30,274 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-12-02 07:06:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 07:06:30,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-12-02 07:06:30,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 07:06:30,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-12-02 07:06:30,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-12-02 07:06:30,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-12-02 07:06:30,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-12-02 07:06:30,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:30,279 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-12-02 07:06:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-12-02 07:06:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-12-02 07:06:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-02 07:06:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-02 07:06:30,285 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-02 07:06:30,285 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-02 07:06:30,285 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 07:06:30,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-12-02 07:06:30,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 07:06:30,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:30,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:30,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 07:06:30,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:06:30,287 INFO L794 eck$LassoCheckResult]: Stem: 6312#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6313#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 6314#fibonacciENTRY ~n := #in~n; 6403#L15 assume !(~n < 1); 6402#L17 assume !(1 == ~n); 6398#L20 call #t~ret0 := fibonacci(~n - 1);< 6401#fibonacciENTRY ~n := #in~n; 6400#L15 assume !(~n < 1); 6399#L17 assume !(1 == ~n); 6393#L20 call #t~ret0 := fibonacci(~n - 1);< 6397#fibonacciENTRY ~n := #in~n; 6395#L15 assume !(~n < 1); 6396#L17 assume !(1 == ~n); 6334#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6387#L15 assume !(~n < 1); 6388#L17 assume 1 == ~n;#res := 1; 6493#fibonacciFINAL assume true; 6492#fibonacciEXIT >#28#return; 6308#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6315#fibonacciENTRY ~n := #in~n; 6307#L15 assume ~n < 1;#res := 0; 6309#fibonacciFINAL assume true; 6495#fibonacciEXIT >#30#return; 6297#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6482#fibonacciFINAL assume true; 6468#fibonacciEXIT >#28#return; 6296#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6466#fibonacciENTRY ~n := #in~n; 6485#L15 assume !(~n < 1); 6336#L17 assume !(1 == ~n); 6320#L20 call #t~ret0 := fibonacci(~n - 1);< 6303#fibonacciENTRY ~n := #in~n; 6382#L15 assume !(~n < 1); 6373#L17 assume !(1 == ~n); 6352#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2018-12-02 07:06:30,287 INFO L796 eck$LassoCheckResult]: Loop: 6354#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2018-12-02 07:06:30,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1438652912, now seen corresponding path program 2 times [2018-12-02 07:06:30,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:30,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:30,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:06:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 07:06:30,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:06:30,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:30,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:06:30,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:06:30,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:06:30,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 07:06:30,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:06:30,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-12-02 07:06:30,457 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:06:30,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2018-12-02 07:06:30,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:30,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:30,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:06:30,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:30,498 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:30,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:30,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:30,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:30,498 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 07:06:30,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:30,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:30,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:30,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-12-02 07:06:30,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:30,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:30,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:30,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:30,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:30,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:30,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:30,524 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:30,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:30,526 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:30,546 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 07:06:30,546 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:31,340 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 07:06:31,343 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:31,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:31,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:31,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:31,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:06:31,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:31,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:31,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:31,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-12-02 07:06:31,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:31,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:31,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:31,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:31,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:31,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:31,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:31,377 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:06:31,377 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-12-02 07:06:31,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:31,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:31,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:31,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:31,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:31,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:31,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:31,379 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:06:31,380 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:06:31,381 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:06:31,381 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:06:31,381 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:06:31,381 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:06:31,381 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-02 07:06:31,381 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 07:06:31,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:31,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:31,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:31,463 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-12-02 07:06:31,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-02 07:06:31,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-12-02 07:06:31,506 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-12-02 07:06:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:06:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-02 07:06:31,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-02 07:06:31,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:31,507 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:31,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:31,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:31,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:31,577 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-12-02 07:06:31,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-02 07:06:31,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-12-02 07:06:31,621 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-12-02 07:06:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:06:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-02 07:06:31,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-02 07:06:31,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:31,621 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:31,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:31,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:31,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:31,691 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-12-02 07:06:31,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-02 07:06:31,722 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-12-02 07:06:31,722 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-12-02 07:06:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:06:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-02 07:06:31,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-02 07:06:31,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:31,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-12-02 07:06:31,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:31,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-12-02 07:06:31,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:31,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-12-02 07:06:31,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 07:06:31,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-12-02 07:06:31,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-12-02 07:06:31,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-12-02 07:06:31,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-12-02 07:06:31,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:31,729 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-12-02 07:06:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-12-02 07:06:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-12-02 07:06:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-02 07:06:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-02 07:06:31,734 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-02 07:06:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 07:06:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-12-02 07:06:31,735 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-12-02 07:06:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:06:31,952 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-12-02 07:06:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 07:06:31,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-12-02 07:06:31,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 07:06:31,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-12-02 07:06:31,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-12-02 07:06:31,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-12-02 07:06:31,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-12-02 07:06:31,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:31,960 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-12-02 07:06:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-12-02 07:06:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-12-02 07:06:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-02 07:06:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-02 07:06:31,967 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-02 07:06:31,967 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-02 07:06:31,967 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 07:06:31,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-12-02 07:06:31,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 07:06:31,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:06:31,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:06:31,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-02 07:06:31,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:06:31,971 INFO L794 eck$LassoCheckResult]: Stem: 8511#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 8512#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 8513#fibonacciENTRY ~n := #in~n; 8603#L15 assume !(~n < 1); 8601#L17 assume !(1 == ~n); 8598#L20 call #t~ret0 := fibonacci(~n - 1);< 8599#fibonacciENTRY ~n := #in~n; 8615#L15 assume !(~n < 1); 8613#L17 assume !(1 == ~n); 8609#L20 call #t~ret0 := fibonacci(~n - 1);< 8612#fibonacciENTRY ~n := #in~n; 8669#L15 assume !(~n < 1); 8666#L17 assume !(1 == ~n); 8605#L20 call #t~ret0 := fibonacci(~n - 1);< 8610#fibonacciENTRY ~n := #in~n; 8630#L15 assume !(~n < 1); 8627#L17 assume !(1 == ~n); 8503#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8722#L15 assume !(~n < 1); 8772#L17 assume 1 == ~n;#res := 1; 8771#fibonacciFINAL assume true; 8769#fibonacciEXIT >#28#return; 8531#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8532#fibonacciENTRY ~n := #in~n; 8764#L15 assume ~n < 1;#res := 0; 8762#fibonacciFINAL assume true; 8760#fibonacciEXIT >#30#return; 8759#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fibonacciFINAL assume true; 8752#fibonacciEXIT >#28#return; 8747#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8749#fibonacciENTRY ~n := #in~n; 8758#L15 assume !(~n < 1); 8754#L17 assume 1 == ~n;#res := 1; 8750#fibonacciFINAL assume true; 8746#fibonacciEXIT >#30#return; 8742#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8740#fibonacciFINAL assume true; 8735#fibonacciEXIT >#28#return; 8618#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8621#fibonacciENTRY ~n := #in~n; 8757#L15 assume !(~n < 1); 8753#L17 assume !(1 == ~n); 8507#L20 call #t~ret0 := fibonacci(~n - 1);< 8501#fibonacciENTRY ~n := #in~n; 8509#L15 assume !(~n < 1); 8510#L17 assume !(1 == ~n); 8551#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2018-12-02 07:06:31,971 INFO L796 eck$LassoCheckResult]: Loop: 8552#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2018-12-02 07:06:31,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash -570292781, now seen corresponding path program 3 times [2018-12-02 07:06:31,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:31,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:31,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:06:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 153 proven. 80 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 07:06:32,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:06:32,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:32,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:06:32,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 07:06:32,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:06:32,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-02 07:06:32,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:06:32,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 24 [2018-12-02 07:06:32,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:06:32,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2018-12-02 07:06:32,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:06:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:06:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:32,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:06:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:06:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:06:32,200 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:32,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:32,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:32,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:32,200 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 07:06:32,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:32,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:32,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:32,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-12-02 07:06:32,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:32,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:32,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:32,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:32,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:32,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:32,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:32,229 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:32,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:32,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:32,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 07:06:32,234 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_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:32,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 07:06:32,249 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44459368-1c1e-4c51-b040-b3203cf19eff/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-12-02 07:06:32,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 07:06:32,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 07:06:33,466 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 07:06:33,468 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:06:33,468 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:06:33,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:06:33,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:06:33,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:06:33,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:06:33,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:06:33,469 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:06:33,469 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-12-02 07:06:33,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:06:33,469 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:06:33,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:33,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:33,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:33,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:06:33,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:06:33,501 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:06:33,501 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-12-02 07:06:33,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:33,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:33,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:33,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:33,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:33,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:33,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:33,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:06:33,503 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-12-02 07:06:33,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:06:33,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:06:33,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:06:33,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:06:33,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:06:33,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:06:33,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:06:33,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:06:33,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:06:33,506 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:06:33,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:06:33,506 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 07:06:33,506 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:06:33,506 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-02 07:06:33,506 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 07:06:33,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:33,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:33,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:33,594 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-12-02 07:06:33,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-02 07:06:33,621 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-12-02 07:06:33,621 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-12-02 07:06:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:06:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-02 07:06:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-02 07:06:33,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:33,622 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:33,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:33,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:33,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:33,699 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-12-02 07:06:33,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-02 07:06:33,748 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-12-02 07:06:33,748 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-12-02 07:06:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:06:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-02 07:06:33,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-02 07:06:33,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:33,749 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:06:33,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:06:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:33,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:06:33,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:06:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:06:33,817 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-12-02 07:06:33,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-02 07:06:33,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-12-02 07:06:33,852 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-12-02 07:06:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:06:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-02 07:06:33,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-02 07:06:33,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:33,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-12-02 07:06:33,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:33,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-02 07:06:33,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:06:33,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-12-02 07:06:33,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 07:06:33,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-12-02 07:06:33,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-02 07:06:33,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-12-02 07:06:33,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-12-02 07:06:33,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:06:33,860 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-12-02 07:06:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-12-02 07:06:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-12-02 07:06:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-02 07:06:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-02 07:06:33,867 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-02 07:06:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 07:06:33,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-12-02 07:06:33,868 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 24 states. [2018-12-02 07:06:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:06:34,147 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2018-12-02 07:06:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 07:06:34,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 595 transitions. [2018-12-02 07:06:34,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:06:34,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 0 states and 0 transitions. [2018-12-02 07:06:34,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 07:06:34,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 07:06:34,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 07:06:34,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:06:34,152 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:06:34,152 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:06:34,152 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:06:34,152 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 07:06:34,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:06:34,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:06:34,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 07:06:34,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 07:06:34 BoogieIcfgContainer [2018-12-02 07:06:34,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 07:06:34,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:06:34,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:06:34,158 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:06:34,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:06:26" (3/4) ... [2018-12-02 07:06:34,162 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 07:06:34,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:06:34,162 INFO L168 Benchmark]: Toolchain (without parser) took 8086.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 954.4 MB in the beginning and 1.0 GB in the end (delta: -55.0 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:06:34,163 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:06:34,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:06:34,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:06:34,164 INFO L168 Benchmark]: Boogie Preprocessor took 39.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:06:34,165 INFO L168 Benchmark]: RCFGBuilder took 101.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 07:06:34,165 INFO L168 Benchmark]: BuchiAutomizer took 7787.98 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.1 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. [2018-12-02 07:06:34,165 INFO L168 Benchmark]: Witness Printer took 3.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:06:34,167 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 101.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7787.98 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.1 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 7.7s and 8 iterations. TraceHistogramMax:13. Analysis of lassos took 4.7s. Construction of modules took 0.7s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 330 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 238 SDtfs, 740 SDslu, 328 SDs, 0 SdLazy, 1266 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s 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: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...