./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/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 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:53:12,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:53:12,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:53:12,884 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:53:12,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:53:12,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:53:12,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:53:12,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:53:12,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:53:12,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:53:12,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:53:12,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:53:12,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:53:12,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:53:12,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:53:12,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:53:12,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:53:12,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:53:12,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:53:12,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:53:12,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:53:12,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:53:12,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:53:12,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:53:12,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:53:12,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:53:12,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:53:12,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:53:12,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:53:12,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:53:12,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:53:12,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:53:12,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:53:12,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:53:12,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:53:12,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:53:12,904 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:53:12,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:53:12,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:53:12,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:53:12,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:53:12,916 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:53:12,916 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:53:12,916 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:53:12,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:53:12,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:53:12,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:53:12,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:53:12,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:53:12,919 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:53:12,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:53:12,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:53:12,919 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:53:12,920 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:53:12,920 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_2a0b82ce-e914-4eb3-9542-6b538c938d7b/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 -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2018-11-10 10:53:12,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:53:12,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:53:12,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:53:12,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:53:12,956 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:53:12,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2018-11-10 10:53:12,995 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/data/957815dac/d4a55ec865e84ce197e68aa04cb00f94/FLAG57af0dd8a [2018-11-10 10:53:13,403 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:53:13,404 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/sv-benchmarks/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2018-11-10 10:53:13,408 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/data/957815dac/d4a55ec865e84ce197e68aa04cb00f94/FLAG57af0dd8a [2018-11-10 10:53:13,419 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/data/957815dac/d4a55ec865e84ce197e68aa04cb00f94 [2018-11-10 10:53:13,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:53:13,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:53:13,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:53:13,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:53:13,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:53:13,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236dc686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13, skipping insertion in model container [2018-11-10 10:53:13,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:53:13,455 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:53:13,552 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:53:13,554 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:53:13,562 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:53:13,570 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:53:13,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13 WrapperNode [2018-11-10 10:53:13,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:53:13,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:53:13,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:53:13,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:53:13,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:53:13,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:53:13,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:53:13,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:53:13,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... [2018-11-10 10:53:13,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:53:13,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:53:13,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:53:13,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:53:13,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:53:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:53:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-10 10:53:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-10 10:53:13,750 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:53:13,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:53:13 BoogieIcfgContainer [2018-11-10 10:53:13,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:53:13,751 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:53:13,751 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:53:13,754 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:53:13,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:53:13,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:53:13" (1/3) ... [2018-11-10 10:53:13,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12aa37e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:53:13, skipping insertion in model container [2018-11-10 10:53:13,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:53:13,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:13" (2/3) ... [2018-11-10 10:53:13,756 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12aa37e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:53:13, skipping insertion in model container [2018-11-10 10:53:13,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:53:13,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:53:13" (3/3) ... [2018-11-10 10:53:13,758 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_5_false-unreach-call_true-termination.c [2018-11-10 10:53:13,803 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:53:13,803 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:53:13,804 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:53:13,804 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:53:13,804 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:53:13,804 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:53:13,804 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:53:13,804 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:53:13,804 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:53:13,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 10:53:13,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:53:13,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:53:13,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:53:13,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 10:53:13,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:53:13,841 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:53:13,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 10:53:13,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:53:13,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:53:13,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:53:13,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 10:53:13,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:53:13,850 INFO L793 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 20#L25true call main_#t~ret2 := fibo(main_~x~0);< 12#fiboENTRYtrue [2018-11-10 10:53:13,851 INFO L795 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(~n == 1); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-11-10 10:53:13,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-11-10 10:53:13,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:13,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-11-10 10:53:13,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:13,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:13,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:13,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:13,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-11-10 10:53:13,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:13,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:13,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:14,005 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:14,005 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:14,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:14,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:14,006 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:53:14,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:14,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:14,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 10:53:14,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:14,007 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:14,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,111 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:14,112 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:14,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:14,121 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:53:14,122 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:14,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:14,143 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:53:14,144 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:14,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:14,163 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:53:14,163 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:14,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:14,182 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:53:14,182 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:14,198 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:53:14,226 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:14,249 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:53:14,250 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:14,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:14,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:14,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:14,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:53:14,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:14,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:14,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 10:53:14,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:14,251 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:14,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,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-11-10 10:53:14,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,305 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:14,309 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:53:14,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:14,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:14,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:14,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:14,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:14,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:14,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:14,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:14,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:14,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:14,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:14,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:14,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:14,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:14,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:14,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:14,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:14,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:14,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:14,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:14,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:14,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:14,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:14,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:14,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:14,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:14,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:14,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:14,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:14,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:14,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:14,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:14,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:14,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:14,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:14,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:14,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:14,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:14,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:14,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:14,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:14,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:14,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:14,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:14,334 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:53:14,337 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:53:14,337 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:53:14,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:53:14,338 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:53:14,338 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:53:14,339 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 10:53:14,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:53:14,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:14,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:14,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:14,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 10:53:14,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 10:53:14,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2018-11-10 10:53:14,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:53:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 10:53:14,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-10 10:53:14,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:14,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 10:53:14,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:14,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 10:53:14,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:14,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-10 10:53:14,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:53:14,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-11-10 10:53:14,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 10:53:14,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 10:53:14,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-10 10:53:14,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:14,527 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-10 10:53:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-10 10:53:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-10 10:53:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 10:53:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-10 10:53:14,546 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 10:53:14,546 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 10:53:14,546 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:53:14,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-10 10:53:14,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:53:14,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:53:14,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:53:14,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:14,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:14,548 INFO L793 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 126#L25 call main_#t~ret2 := fibo(main_~x~0);< 131#fiboENTRY ~n := #in~n; 132#L6 assume !(~n < 1); 130#L8 assume !(~n == 1); 123#L11 call #t~ret0 := fibo(~n - 1);< 133#fiboENTRY ~n := #in~n; 134#L6 assume ~n < 1;#res := 0; 129#fiboFINAL assume true; 122#fiboEXIT >#33#return; 124#L11-1 [2018-11-10 10:53:14,548 INFO L795 eck$LassoCheckResult]: Loop: 124#L11-1 call #t~ret1 := fibo(~n - 2);< 138#fiboENTRY ~n := #in~n; 141#L6 assume !(~n < 1); 140#L8 assume !(~n == 1); 136#L11 call #t~ret0 := fibo(~n - 1);< 138#fiboENTRY ~n := #in~n; 141#L6 assume ~n < 1;#res := 0; 137#fiboFINAL assume true; 139#fiboEXIT >#33#return; 124#L11-1 [2018-11-10 10:53:14,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:14,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-11-10 10:53:14,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:14,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:14,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:14,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:14,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:53:14,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:53:14,602 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:53:14,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:14,603 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-11-10 10:53:14,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:14,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:14,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:14,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:53:14,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:53:14,631 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:53:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:53:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:53:14,633 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 10:53:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:14,699 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-10 10:53:14,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:53:14,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-10 10:53:14,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:53:14,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-10 10:53:14,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 10:53:14,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 10:53:14,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-10 10:53:14,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:14,703 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 10:53:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-10 10:53:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 10:53:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 10:53:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-10 10:53:14,707 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 10:53:14,707 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 10:53:14,707 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:53:14,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-10 10:53:14,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 10:53:14,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:53:14,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:53:14,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:14,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:14,709 INFO L793 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 191#L25 call main_#t~ret2 := fibo(main_~x~0);< 196#fiboENTRY ~n := #in~n; 197#L6 assume !(~n < 1); 195#L8 assume !(~n == 1); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume ~n == 1;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 10:53:14,709 INFO L795 eck$LassoCheckResult]: Loop: 189#L11-1 call #t~ret1 := fibo(~n - 2);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume !(~n == 1); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume ~n == 1;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 10:53:14,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-11-10 10:53:14,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:14,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:14,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:14,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:14,746 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:14,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:14,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:14,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:14,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 10:53:14,792 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:53:14,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-11-10 10:53:14,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:14,910 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:14,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:14,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:14,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:14,910 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:53:14,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:14,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:14,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 10:53:14,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:14,911 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:14,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:14,958 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:14,958 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:14,960 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:14,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:53:14,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:15,883 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:53:15,884 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:15,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:15,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:15,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:15,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:53:15,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:15,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:15,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:15,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 10:53:15,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:15,885 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:15,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:15,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:15,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:15,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:15,938 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:15,938 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:53:15,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:15,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:15,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:15,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:15,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:15,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:15,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:15,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:15,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:15,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:15,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:15,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:15,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:15,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:15,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:15,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:15,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:15,949 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:53:15,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:53:15,951 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:53:15,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:53:15,952 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:53:15,952 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:53:15,952 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 10:53:15,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:53:15,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:15,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:16,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:16,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 10:53:16,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 10:53:16,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-11-10 10:53:16,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:53:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 10:53:16,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 10:53:16,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:16,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-10 10:53:16,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:16,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-10 10:53:16,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:16,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-10 10:53:16,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 10:53:16,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-10 10:53:16,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 10:53:16,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 10:53:16,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-10 10:53:16,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:16,150 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-10 10:53:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-10 10:53:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-10 10:53:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 10:53:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-10 10:53:16,161 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-10 10:53:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:53:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:53:16,161 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-10 10:53:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:16,212 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-10 10:53:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:53:16,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-10 10:53:16,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 10:53:16,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-10 10:53:16,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 10:53:16,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 10:53:16,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-10 10:53:16,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:16,218 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-10 10:53:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-10 10:53:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-10 10:53:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 10:53:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-10 10:53:16,224 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 10:53:16,224 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 10:53:16,224 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:53:16,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-10 10:53:16,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 10:53:16,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:53:16,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:53:16,227 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:16,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:16,227 INFO L793 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 711#L25 call main_#t~ret2 := fibo(main_~x~0);< 752#fiboENTRY ~n := #in~n; 755#L6 assume !(~n < 1); 726#L8 assume !(~n == 1); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume ~n == 1;#res := 1; 773#fiboFINAL assume true; 772#fiboEXIT >#33#return; 729#L11-1 call #t~ret1 := fibo(~n - 2);< 771#fiboENTRY ~n := #in~n; 801#L6 assume ~n < 1;#res := 0; 800#fiboFINAL assume true; 799#fiboEXIT >#35#return; 798#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 797#fiboFINAL assume true; 790#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 10:53:16,227 INFO L795 eck$LassoCheckResult]: Loop: 723#L11-1 call #t~ret1 := fibo(~n - 2);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume !(~n == 1); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume ~n == 1;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 10:53:16,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-11-10 10:53:16,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:16,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:16,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:53:16,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:16,283 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:16,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:16,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:53:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 10:53:16,331 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:53:16,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-11-10 10:53:16,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:16,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:16,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:16,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:16,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:16,391 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:16,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:16,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:16,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:16,391 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:53:16,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:16,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:16,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:16,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 10:53:16,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:16,391 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:16,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:16,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:16,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:16,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:16,418 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:16,419 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:16,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:16,420 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:16,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:53:16,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:17,340 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:53:17,341 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:17,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:17,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:17,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:17,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:53:17,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:17,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:17,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:17,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 10:53:17,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:17,342 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:17,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:17,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-11-10 10:53:17,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:17,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:17,369 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:17,369 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:53:17,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:17,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:17,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:17,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:17,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:17,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:17,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:17,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:17,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:17,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:17,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:17,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:17,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:17,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:17,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:17,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:17,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:17,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:17,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:17,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:17,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:17,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:17,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:17,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:17,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:17,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:17,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:53:17,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-11-10 10:53:17,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:17,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:17,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:17,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:17,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:17,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:17,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:17,381 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:53:17,382 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:53:17,382 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:53:17,383 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:53:17,383 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:53:17,383 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:53:17,383 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 10:53:17,383 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:53:17,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:17,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:17,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:17,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 10:53:17,472 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 10:53:17,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-11-10 10:53:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:53:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 10:53:17,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 10:53:17,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:17,580 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:53:17,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:17,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:17,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:17,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 10:53:17,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 10:53:17,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-11-10 10:53:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:53:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 10:53:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 10:53:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:17,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:53:17,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:17,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:17,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:17,832 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 10:53:17,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 10:53:17,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-11-10 10:53:17,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:53:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-10 10:53:17,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 10:53:17,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:17,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-10 10:53:17,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:17,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-10 10:53:17,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:17,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-10 10:53:17,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 10:53:17,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-10 10:53:17,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-10 10:53:17,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-10 10:53:17,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-10 10:53:17,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:17,975 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-10 10:53:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-10 10:53:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-10 10:53:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-10 10:53:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-10 10:53:18,002 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-10 10:53:18,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:53:18,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:53:18,002 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-10 10:53:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:18,166 INFO L93 Difference]: Finished difference Result 498 states and 788 transitions. [2018-11-10 10:53:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:53:18,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 788 transitions. [2018-11-10 10:53:18,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 10:53:18,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 785 transitions. [2018-11-10 10:53:18,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-10 10:53:18,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-10 10:53:18,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 785 transitions. [2018-11-10 10:53:18,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:18,181 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 785 transitions. [2018-11-10 10:53:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 785 transitions. [2018-11-10 10:53:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 366. [2018-11-10 10:53:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-10 10:53:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 518 transitions. [2018-11-10 10:53:18,200 INFO L728 BuchiCegarLoop]: Abstraction has 366 states and 518 transitions. [2018-11-10 10:53:18,200 INFO L608 BuchiCegarLoop]: Abstraction has 366 states and 518 transitions. [2018-11-10 10:53:18,200 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:53:18,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 518 transitions. [2018-11-10 10:53:18,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 10:53:18,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:53:18,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:53:18,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:18,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:53:18,206 INFO L793 eck$LassoCheckResult]: Stem: 3580#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 3579#L25 call main_#t~ret2 := fibo(main_~x~0);< 3620#fiboENTRY ~n := #in~n; 3636#L6 assume !(~n < 1); 3635#L8 assume !(~n == 1); 3631#L11 call #t~ret0 := fibo(~n - 1);< 3633#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3630#L8 assume !(~n == 1); 3582#L11 call #t~ret0 := fibo(~n - 1);< 3627#fiboENTRY ~n := #in~n; 3629#L6 assume !(~n < 1); 3632#L8 assume !(~n == 1); 3583#L11 call #t~ret0 := fibo(~n - 1);< 3627#fiboENTRY ~n := #in~n; 3628#L6 assume !(~n < 1); 3581#L8 assume ~n == 1;#res := 1; 3584#fiboFINAL assume true; 3670#fiboEXIT >#33#return; 3653#L11-1 call #t~ret1 := fibo(~n - 2);< 3660#fiboENTRY ~n := #in~n; 3730#L6 assume !(~n < 1); 3695#L8 assume !(~n == 1); 3697#L11 call #t~ret0 := fibo(~n - 1);< 3863#fiboENTRY ~n := #in~n; 3869#L6 assume !(~n < 1); 3866#L8 assume !(~n == 1); 3867#L11 call #t~ret0 := fibo(~n - 1);< 3880#fiboENTRY [2018-11-10 10:53:18,206 INFO L795 eck$LassoCheckResult]: Loop: 3880#fiboENTRY ~n := #in~n; 3894#L6 assume !(~n < 1); 3893#L8 assume !(~n == 1); 3876#L11 call #t~ret0 := fibo(~n - 1);< 3880#fiboENTRY [2018-11-10 10:53:18,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:18,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-11-10 10:53:18,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:18,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:18,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:18,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:53:18,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:18,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:18,266 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:53:18,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:18,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-10 10:53:18,419 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:53:18,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:18,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-11-10 10:53:18,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:18,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:18,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:18,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:18,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:53:18,440 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:18,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:18,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:18,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:18,441 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:53:18,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:18,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:18,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:18,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 10:53:18,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:18,441 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:18,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,470 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:18,470 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:18,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:18,473 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:18,476 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:53:18,476 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:18,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:53:18,493 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a0b82ce-e914-4eb3-9542-6b538c938d7b/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:18,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:53:18,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:53:18,528 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:53:18,529 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:53:18,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:53:18,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:53:18,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:53:18,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:53:18,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:53:18,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:53:18,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:53:18,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 10:53:18,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:53:18,530 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:53:18,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:53:18,569 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:53:18,569 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:53:18,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:53:18,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:53:18,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:53:18,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:53:18,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:53:18,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:53:18,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:53:18,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:53:18,572 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:53:18,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:53:18,573 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:53:18,574 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:53:18,574 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:53:18,574 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:53:18,574 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 10:53:18,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:53:18,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:18,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 10:53:18,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 366 states and 518 transitions. cyclomatic complexity: 159 Second operand 5 states. [2018-11-10 10:53:18,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 366 states and 518 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 376 states and 528 transitions. Complement of second has 13 states. [2018-11-10 10:53:18,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 10:53:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 10:53:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 10:53:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:18,690 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:53:18,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:18,754 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 10:53:18,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 366 states and 518 transitions. cyclomatic complexity: 159 Second operand 5 states. [2018-11-10 10:53:18,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 366 states and 518 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 376 states and 528 transitions. Complement of second has 13 states. [2018-11-10 10:53:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 10:53:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 10:53:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 10:53:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:18,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:53:18,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:18,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:18,850 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 10:53:18,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 366 states and 518 transitions. cyclomatic complexity: 159 Second operand 5 states. [2018-11-10 10:53:18,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 366 states and 518 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 493 states and 655 transitions. Complement of second has 14 states. [2018-11-10 10:53:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:53:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 10:53:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 10:53:18,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 10:53:18,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:18,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 10:53:18,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:18,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-10 10:53:18,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:53:18,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 655 transitions. [2018-11-10 10:53:18,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 10:53:18,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 406 states and 566 transitions. [2018-11-10 10:53:18,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-10 10:53:18,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2018-11-10 10:53:18,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 406 states and 566 transitions. [2018-11-10 10:53:18,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:53:18,916 INFO L705 BuchiCegarLoop]: Abstraction has 406 states and 566 transitions. [2018-11-10 10:53:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states and 566 transitions. [2018-11-10 10:53:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 390. [2018-11-10 10:53:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-10 10:53:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 542 transitions. [2018-11-10 10:53:18,924 INFO L728 BuchiCegarLoop]: Abstraction has 390 states and 542 transitions. [2018-11-10 10:53:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 10:53:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:53:18,925 INFO L87 Difference]: Start difference. First operand 390 states and 542 transitions. Second operand 20 states. [2018-11-10 10:53:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:19,133 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2018-11-10 10:53:19,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:53:19,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 209 transitions. [2018-11-10 10:53:19,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:53:19,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 0 states and 0 transitions. [2018-11-10 10:53:19,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:53:19,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:53:19,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:53:19,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:53:19,136 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:53:19,136 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:53:19,136 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:53:19,136 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:53:19,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:53:19,136 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:53:19,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:53:19,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:53:19 BoogieIcfgContainer [2018-11-10 10:53:19,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:53:19,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:53:19,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:53:19,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:53:19,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:53:13" (3/4) ... [2018-11-10 10:53:19,144 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:53:19,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:53:19,145 INFO L168 Benchmark]: Toolchain (without parser) took 5723.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 958.2 MB in the beginning and 972.9 MB in the end (delta: -14.7 MB). Peak memory consumption was 160.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:53:19,146 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:53:19,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.27 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:53:19,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:53:19,147 INFO L168 Benchmark]: Boogie Preprocessor took 9.22 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:53:19,147 INFO L168 Benchmark]: RCFGBuilder took 152.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:53:19,148 INFO L168 Benchmark]: BuchiAutomizer took 5390.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 972.9 MB in the end (delta: 153.3 MB). Peak memory consumption was 193.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:53:19,148 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:53:19,151 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.27 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.22 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 152.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5390.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 972.9 MB in the end (delta: 153.3 MB). Peak memory consumption was 193.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 3.3s. Construction of modules took 0.4s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 366 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 161 SDtfs, 363 SDslu, 221 SDs, 0 SdLazy, 743 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...