./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/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 dd317ac0ecdb37853dacea373914a521115465e0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:35:08,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:35:08,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:35:08,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:35:08,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:35:08,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:35:08,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:35:08,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:35:08,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:35:08,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:35:08,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:35:08,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:35:08,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:35:08,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:35:08,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:35:08,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:35:08,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:35:08,387 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:35:08,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:35:08,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:35:08,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:35:08,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:35:08,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:35:08,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:35:08,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:35:08,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:35:08,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:35:08,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:35:08,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:35:08,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:35:08,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:35:08,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:35:08,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:35:08,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:35:08,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:35:08,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:35:08,396 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:35:08,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:35:08,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:35:08,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:35:08,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:35:08,407 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:35:08,407 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:35:08,407 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:35:08,407 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:35:08,407 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:35:08,407 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:35:08,407 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:35:08,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:35:08,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:35:08,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:35:08,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:35:08,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:35:08,409 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:35:08,409 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:35:08,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:35:08,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:35:08,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:35:08,410 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:35:08,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:35:08,410 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:35:08,410 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:35:08,411 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:35:08,411 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_3bb88f49-1016-4923-b805-0bd90ccf9659/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 -> dd317ac0ecdb37853dacea373914a521115465e0 [2018-11-18 08:35:08,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:35:08,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:35:08,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:35:08,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:35:08,447 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:35:08,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-18 08:35:08,492 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/data/8ea0d1e74/962dade10e5d4b8fb8a4180155ca429e/FLAG33bdf70a3 [2018-11-18 08:35:08,834 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:35:08,834 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-18 08:35:08,839 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/data/8ea0d1e74/962dade10e5d4b8fb8a4180155ca429e/FLAG33bdf70a3 [2018-11-18 08:35:09,249 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/data/8ea0d1e74/962dade10e5d4b8fb8a4180155ca429e [2018-11-18 08:35:09,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:35:09,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:35:09,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:09,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:35:09,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:35:09,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b708a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09, skipping insertion in model container [2018-11-18 08:35:09,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:35:09,276 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:35:09,374 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:09,376 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:35:09,386 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:09,396 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:35:09,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09 WrapperNode [2018-11-18 08:35:09,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:09,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:35:09,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:35:09,396 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:35:09,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:35:09,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:35:09,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:35:09,415 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:35:09,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... [2018-11-18 08:35:09,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:35:09,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:35:09,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:35:09,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:35:09,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:35:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:35:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-18 08:35:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-18 08:35:09,582 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:35:09,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:09 BoogieIcfgContainer [2018-11-18 08:35:09,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:35:09,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:35:09,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:35:09,585 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:35:09,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:09,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:35:09" (1/3) ... [2018-11-18 08:35:09,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bcb57df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:35:09, skipping insertion in model container [2018-11-18 08:35:09,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:09,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:09" (2/3) ... [2018-11-18 08:35:09,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bcb57df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:35:09, skipping insertion in model container [2018-11-18 08:35:09,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:09,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:09" (3/3) ... [2018-11-18 08:35:09,587 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_true-unreach-call_true-termination.c [2018-11-18 08:35:09,622 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:35:09,622 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:35:09,622 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:35:09,622 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:35:09,622 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:35:09,622 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:35:09,623 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:35:09,623 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:35:09,623 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:35:09,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:35:09,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:35:09,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:09,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:09,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 08:35:09,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:09,661 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:35:09,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:35:09,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:35:09,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:09,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:09,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 08:35:09,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:09,670 INFO L794 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 := 10; 20#L25true call main_#t~ret2 := fibo(main_~x~0);< 12#fiboENTRYtrue [2018-11-18 08:35:09,671 INFO L796 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(1 == ~n); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-11-18 08:35:09,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-11-18 08:35:09,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:09,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:09,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:09,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:09,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:09,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-11-18 08:35:09,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:09,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:09,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:09,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:09,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:09,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-11-18 08:35:09,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:09,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:09,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:09,855 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:09,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:09,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:09,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:09,856 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:09,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:09,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:09,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:09,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-18 08:35:09,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:09,857 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:09,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:09,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:09,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:09,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:09,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:09,986 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:09,987 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:10,004 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:10,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:10,010 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:10,026 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:10,028 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:10,028 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:10,044 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:10,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:10,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:10,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:10,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:10,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:10,082 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:10,107 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:10,124 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:10,125 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:10,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:10,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:10,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:10,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:10,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:10,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:10,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-18 08:35:10,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:10,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:10,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,173 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:10,176 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:10,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:10,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:10,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:10,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:10,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:10,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:10,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:10,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:10,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:10,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:10,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:10,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:10,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:10,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:10,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:10,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:10,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:10,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:10,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:10,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:10,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:10,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:10,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:10,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:10,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:10,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:10,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:10,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:10,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:10,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:10,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:10,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:10,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:10,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:10,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:10,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:10,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:10,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:10,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:10,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:10,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:10,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:10,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:10,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:10,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:10,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:10,203 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:10,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:10,204 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:10,205 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:10,205 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-18 08:35:10,206 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:10,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:10,288 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 08:35:10,289 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-18 08:35:10,377 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-18 08:35:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:35:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 08:35:10,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 08:35:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:10,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 08:35:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:10,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 08:35:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:10,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-18 08:35:10,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:35:10,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-11-18 08:35:10,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 08:35:10,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 08:35:10,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-18 08:35:10,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:10,393 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 08:35:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-18 08:35:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-18 08:35:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 08:35:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-18 08:35:10,412 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 08:35:10,412 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 08:35:10,412 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:35:10,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-18 08:35:10,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:35:10,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:10,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:10,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:10,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:10,414 INFO L794 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 := 10; 126#L25 call main_#t~ret2 := fibo(main_~x~0);< 131#fiboENTRY ~n := #in~n; 132#L6 assume !(~n < 1); 130#L8 assume !(1 == ~n); 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-18 08:35:10,414 INFO L796 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 !(1 == ~n); 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-18 08:35:10,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-11-18 08:35:10,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:10,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:10,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:10,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:35:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:10,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:35:10,492 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:10,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-11-18 08:35:10,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:35:10,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:10,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:35:10,543 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:35:10,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:35:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:35:10,547 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 08:35:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:10,603 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-18 08:35:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:35:10,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-18 08:35:10,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:35:10,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-18 08:35:10,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 08:35:10,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 08:35:10,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-18 08:35:10,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:10,607 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 08:35:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-18 08:35:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 08:35:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 08:35:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-18 08:35:10,610 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 08:35:10,610 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 08:35:10,610 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:35:10,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-18 08:35:10,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:35:10,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:10,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:10,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:10,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:10,612 INFO L794 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 := 10; 191#L25 call main_#t~ret2 := fibo(main_~x~0);< 196#fiboENTRY ~n := #in~n; 197#L6 assume !(~n < 1); 195#L8 assume !(1 == ~n); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume 1 == ~n;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-11-18 08:35:10,612 INFO L796 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 !(1 == ~n); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume 1 == ~n;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-11-18 08:35:10,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-11-18 08:35:10,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:10,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:10,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:10,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 08:35:10,692 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:10,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-11-18 08:35:10,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:10,787 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:10,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:10,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:10,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:10,787 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:10,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:10,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:10,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-18 08:35:10,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:10,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:10,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:10,829 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:10,829 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:10,833 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:10,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:10,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:11,338 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:11,340 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:11,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:11,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:11,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:11,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:11,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:11,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:11,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:11,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-18 08:35:11,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:11,340 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:11,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,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-18 08:35:11,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:11,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:11,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:11,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:11,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:11,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:11,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:11,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:11,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:11,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:11,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:11,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:11,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:11,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:11,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:11,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:11,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:11,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:11,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:11,394 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:11,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:11,397 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:11,398 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:11,398 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:11,398 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:11,398 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:35:11,399 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:11,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:11,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:11,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:11,490 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:35:11,490 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-18 08:35:11,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-11-18 08:35:11,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:35:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 08:35:11,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 08:35:11,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:11,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-18 08:35:11,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:11,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-18 08:35:11,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:11,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-18 08:35:11,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 08:35:11,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-18 08:35:11,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-18 08:35:11,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 08:35:11,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-18 08:35:11,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:11,598 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-18 08:35:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-18 08:35:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-18 08:35:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 08:35:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-18 08:35:11,606 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-18 08:35:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:35:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:35:11,607 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-18 08:35:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:11,663 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-18 08:35:11,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:35:11,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-18 08:35:11,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 08:35:11,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-18 08:35:11,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-18 08:35:11,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 08:35:11,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-18 08:35:11,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:11,670 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-18 08:35:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-18 08:35:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-18 08:35:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 08:35:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-18 08:35:11,678 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-18 08:35:11,679 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-18 08:35:11,679 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:35:11,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-18 08:35:11,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 08:35:11,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:11,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:11,681 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:11,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:11,682 INFO L794 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 := 10; 711#L25 call main_#t~ret2 := fibo(main_~x~0);< 752#fiboENTRY ~n := #in~n; 755#L6 assume !(~n < 1); 726#L8 assume !(1 == ~n); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(1 == ~n); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(1 == ~n); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume 1 == ~n;#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~ret1;havoc #t~ret0; 797#fiboFINAL assume true; 790#fiboEXIT >#33#return; 723#L11-1 [2018-11-18 08:35:11,682 INFO L796 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 !(1 == ~n); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume 1 == ~n;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-11-18 08:35:11,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-11-18 08:35:11,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:11,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:11,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:11,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:11,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 08:35:11,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:11,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/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-18 08:35:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:11,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 08:35:11,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:11,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-18 08:35:11,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:11,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-11-18 08:35:11,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:11,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:11,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:11,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:11,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:11,847 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:11,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:11,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:11,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:11,847 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:11,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:11,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:11,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:11,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-18 08:35:11,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:11,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:11,879 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:11,879 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/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-18 08:35:11,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:11,881 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:11,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:11,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:12,390 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:12,392 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:12,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:12,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:12,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:12,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:12,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:12,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:12,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:12,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-18 08:35:12,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:12,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:12,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:12,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:12,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:12,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-18 08:35:12,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:12,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:12,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:12,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:12,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:12,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:12,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:12,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:12,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:12,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:12,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:12,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:12,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:12,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:12,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:12,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:12,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:12,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:12,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:12,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:12,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:12,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:12,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:12,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:12,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:12,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:12,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:12,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:12,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:12,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:12,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:12,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:12,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:12,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:12,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:12,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:12,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:12,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:12,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:12,428 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:12,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:12,429 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:12,429 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:12,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:35:12,429 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:12,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:12,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:35:12,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 08:35:12,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-11-18 08:35:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:35:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 08:35:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 08:35:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:12,605 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:12,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:12,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:35:12,679 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 08:35:12,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-11-18 08:35:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:35:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-18 08:35:12,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 08:35:12,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:12,774 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:12,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:12,854 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:35:12,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 08:35:12,994 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-11-18 08:35:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:35:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-18 08:35:12,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 08:35:12,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:12,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-18 08:35:12,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:12,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-18 08:35:12,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:12,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-18 08:35:13,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 08:35:13,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-18 08:35:13,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-18 08:35:13,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-18 08:35:13,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-18 08:35:13,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:13,024 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-18 08:35:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-18 08:35:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-18 08:35:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-18 08:35:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-18 08:35:13,048 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-18 08:35:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:35:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:35:13,049 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-18 08:35:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:13,198 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-11-18 08:35:13,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:35:13,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-11-18 08:35:13,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 08:35:13,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-11-18 08:35:13,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-18 08:35:13,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-18 08:35:13,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-11-18 08:35:13,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:13,215 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-11-18 08:35:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-11-18 08:35:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-11-18 08:35:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 08:35:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-11-18 08:35:13,233 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-18 08:35:13,233 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-18 08:35:13,233 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:35:13,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-11-18 08:35:13,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 08:35:13,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:13,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:13,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:13,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:13,237 INFO L794 eck$LassoCheckResult]: Stem: 3582#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3580#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 := 10; 3581#L25 call main_#t~ret2 := fibo(main_~x~0);< 3622#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3633#L8 assume !(1 == ~n); 3629#L11 call #t~ret0 := fibo(~n - 1);< 3631#fiboENTRY ~n := #in~n; 3632#L6 assume !(~n < 1); 3628#L8 assume !(1 == ~n); 3584#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3627#L6 assume !(~n < 1); 3630#L8 assume !(1 == ~n); 3585#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3626#L6 assume !(~n < 1); 3583#L8 assume 1 == ~n;#res := 1; 3586#fiboFINAL assume true; 3676#fiboEXIT >#33#return; 3652#L11-1 call #t~ret1 := fibo(~n - 2);< 3661#fiboENTRY ~n := #in~n; 3720#L6 assume !(~n < 1); 3712#L8 assume !(1 == ~n); 3714#L11 call #t~ret0 := fibo(~n - 1);< 3913#fiboENTRY ~n := #in~n; 3918#L6 assume !(~n < 1); 3915#L8 assume !(1 == ~n); 3916#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-18 08:35:13,237 INFO L796 eck$LassoCheckResult]: Loop: 3925#fiboENTRY ~n := #in~n; 3932#L6 assume !(~n < 1); 3931#L8 assume !(1 == ~n); 3922#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-18 08:35:13,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-11-18 08:35:13,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:13,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:13,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:13,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:13,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 08:35:13,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:13,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/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-18 08:35:13,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 08:35:13,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:13,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-18 08:35:13,418 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:13,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-11-18 08:35:13,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:13,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:13,438 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:13,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:13,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:13,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:13,439 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:13,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:13,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:13,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:13,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-18 08:35:13,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:13,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:13,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,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-18 08:35:13,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:13,464 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/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-18 08:35:13,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:13,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:13,470 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:13,470 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:13,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:13,485 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:13,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:13,502 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:13,518 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:13,519 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:13,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:13,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:13,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:13,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:13,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:13,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:13,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:13,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-18 08:35:13,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:13,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:13,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:13,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:13,551 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:13,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:13,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:13,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:13,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:13,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:13,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:13,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:13,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:13,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:13,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:13,555 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:13,556 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:13,556 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:13,556 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:13,556 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-18 08:35:13,556 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:13,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:13,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 08:35:13,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 08:35:13,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-18 08:35:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:35:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 08:35:13,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 08:35:13,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:13,655 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:13,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:13,724 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 08:35:13,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 08:35:13,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-18 08:35:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:35:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 08:35:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 08:35:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:13,761 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:13,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:13,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:13,817 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 08:35:13,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 08:35:13,869 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 495 states and 657 transitions. Complement of second has 14 states. [2018-11-18 08:35:13,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:35:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 08:35:13,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 08:35:13,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:13,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-18 08:35:13,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:13,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-18 08:35:13,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:13,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-11-18 08:35:13,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 08:35:13,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-11-18 08:35:13,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-18 08:35:13,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-18 08:35:13,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-11-18 08:35:13,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:13,879 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-11-18 08:35:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-11-18 08:35:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-11-18 08:35:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-18 08:35:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-11-18 08:35:13,889 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-11-18 08:35:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 08:35:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-18 08:35:13,889 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-11-18 08:35:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:14,029 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-11-18 08:35:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 08:35:14,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-11-18 08:35:14,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:14,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-11-18 08:35:14,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-18 08:35:14,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-18 08:35:14,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-11-18 08:35:14,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:14,034 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-11-18 08:35:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-11-18 08:35:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-11-18 08:35:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 08:35:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-18 08:35:14,039 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 08:35:14,039 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 08:35:14,039 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:35:14,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-11-18 08:35:14,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:14,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:14,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:14,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:14,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:14,041 INFO L794 eck$LassoCheckResult]: Stem: 6358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6356#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 := 10; 6357#L25 call main_#t~ret2 := fibo(main_~x~0);< 6395#fiboENTRY ~n := #in~n; 6465#L6 assume !(~n < 1); 6464#L8 assume !(1 == ~n); 6460#L11 call #t~ret0 := fibo(~n - 1);< 6463#fiboENTRY ~n := #in~n; 6462#L6 assume !(~n < 1); 6461#L8 assume !(1 == ~n); 6455#L11 call #t~ret0 := fibo(~n - 1);< 6459#fiboENTRY ~n := #in~n; 6457#L6 assume !(~n < 1); 6458#L8 assume !(1 == ~n); 6383#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(1 == ~n); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(1 == ~n); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6449#L6 assume !(~n < 1); 6450#L8 assume 1 == ~n;#res := 1; 6550#fiboFINAL assume true; 6549#fiboEXIT >#33#return; 6351#L11-1 call #t~ret1 := fibo(~n - 2);< 6385#fiboENTRY ~n := #in~n; 6553#L6 assume ~n < 1;#res := 0; 6552#fiboFINAL assume true; 6350#fiboEXIT >#35#return; 6352#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6538#fiboFINAL assume true; 6523#fiboEXIT >#33#return; 6374#L11-1 call #t~ret1 := fibo(~n - 2);< 6522#fiboENTRY ~n := #in~n; 6541#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6360#L11 call #t~ret0 := fibo(~n - 1);< 6389#fiboENTRY ~n := #in~n; 6445#L6 assume !(~n < 1); 6435#L8 assume !(1 == ~n); 6417#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(1 == ~n); 6416#L11 [2018-11-18 08:35:14,041 INFO L796 eck$LassoCheckResult]: Loop: 6416#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(1 == ~n); 6416#L11 [2018-11-18 08:35:14,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1127026968, now seen corresponding path program 2 times [2018-11-18 08:35:14,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:14,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 08:35:14,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:14,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:14,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:35:14,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:35:14,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:35:14,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 08:35:14,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:14,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-18 08:35:14,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:14,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 3 times [2018-11-18 08:35:14,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:14,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:14,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:14,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:14,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:14,268 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:14,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:14,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:14,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:14,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:14,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:14,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:14,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:14,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-18 08:35:14,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:14,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:14,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:14,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:14,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:14,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:14,299 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:14,300 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:14,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:14,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:14,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:14,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:14,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:14,342 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:14,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:14,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:19,878 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:19,880 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:19,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:19,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:19,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:19,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:19,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:19,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:19,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:19,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-18 08:35:19,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:19,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:19,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:19,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-18 08:35:19,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:19,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:19,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:19,920 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:19,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:19,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:19,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:19,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:19,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:19,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:19,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:19,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:19,924 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:19,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:19,925 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:19,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:19,926 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:19,926 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:19,926 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:35:19,926 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:19,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:19,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:19,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:20,007 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:20,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 08:35:20,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 216 states and 274 transitions. Complement of second has 18 states. [2018-11-18 08:35:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:35:20,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 08:35:20,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:20,043 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:20,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:20,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:20,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:20,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:20,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 08:35:20,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 222 states and 280 transitions. Complement of second has 17 states. [2018-11-18 08:35:20,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:35:20,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 08:35:20,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:20,236 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:20,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:20,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:20,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:20,332 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:20,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 08:35:20,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 272 states and 344 transitions. Complement of second has 27 states. [2018-11-18 08:35:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:35:20,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 08:35:20,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:20,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-11-18 08:35:20,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:20,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-11-18 08:35:20,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:20,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-11-18 08:35:20,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:20,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-11-18 08:35:20,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-18 08:35:20,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-18 08:35:20,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-11-18 08:35:20,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:20,376 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-11-18 08:35:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-11-18 08:35:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-11-18 08:35:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 08:35:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-18 08:35:20,380 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 08:35:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 08:35:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:35:20,381 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-11-18 08:35:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:20,602 INFO L93 Difference]: Finished difference Result 342 states and 459 transitions. [2018-11-18 08:35:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 08:35:20,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 459 transitions. [2018-11-18 08:35:20,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:20,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 316 states and 427 transitions. [2018-11-18 08:35:20,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-11-18 08:35:20,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-18 08:35:20,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 427 transitions. [2018-11-18 08:35:20,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:20,609 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 427 transitions. [2018-11-18 08:35:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 427 transitions. [2018-11-18 08:35:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-11-18 08:35:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 08:35:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-18 08:35:20,616 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 08:35:20,616 INFO L608 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 08:35:20,616 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:35:20,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2018-11-18 08:35:20,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:20,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:20,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:20,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 08:35:20,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:20,620 INFO L794 eck$LassoCheckResult]: Stem: 8578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8566#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 := 10; 8567#L25 call main_#t~ret2 := fibo(main_~x~0);< 8615#fiboENTRY ~n := #in~n; 8682#L6 assume !(~n < 1); 8680#L8 assume !(1 == ~n); 8677#L11 call #t~ret0 := fibo(~n - 1);< 8678#fiboENTRY ~n := #in~n; 8694#L6 assume !(~n < 1); 8692#L8 assume !(1 == ~n); 8688#L11 call #t~ret0 := fibo(~n - 1);< 8691#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8717#L8 assume !(1 == ~n); 8684#L11 call #t~ret0 := fibo(~n - 1);< 8689#fiboENTRY ~n := #in~n; 8708#L6 assume !(~n < 1); 8706#L8 assume !(1 == ~n); 8609#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(1 == ~n); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(1 == ~n); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(1 == ~n); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8749#L6 assume !(~n < 1); 8830#L8 assume 1 == ~n;#res := 1; 8825#fiboFINAL assume true; 8824#fiboEXIT >#33#return; 8607#L11-1 call #t~ret1 := fibo(~n - 2);< 8610#fiboENTRY ~n := #in~n; 8781#L6 assume ~n < 1;#res := 0; 8780#fiboFINAL assume true; 8779#fiboEXIT >#35#return; 8777#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8776#fiboFINAL assume true; 8773#fiboEXIT >#33#return; 8729#L11-1 call #t~ret1 := fibo(~n - 2);< 8732#fiboENTRY ~n := #in~n; 8760#L6 assume !(~n < 1); 8754#L8 assume 1 == ~n;#res := 1; 8753#fiboFINAL assume true; 8728#fiboEXIT >#35#return; 8726#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8724#fiboFINAL assume true; 8723#fiboEXIT >#33#return; 8697#L11-1 call #t~ret1 := fibo(~n - 2);< 8700#fiboENTRY ~n := #in~n; 8757#L6 assume !(~n < 1); 8755#L8 assume !(1 == ~n); 8570#L11 call #t~ret0 := fibo(~n - 1);< 8612#fiboENTRY ~n := #in~n; 8834#L6 assume !(~n < 1); 8581#L8 assume !(1 == ~n); 8582#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(1 == ~n); 8636#L11 [2018-11-18 08:35:20,620 INFO L796 eck$LassoCheckResult]: Loop: 8636#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(1 == ~n); 8636#L11 [2018-11-18 08:35:20,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1780673760, now seen corresponding path program 3 times [2018-11-18 08:35:20,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:20,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:20,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:20,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:20,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-18 08:35:20,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:20,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:20,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:35:20,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 08:35:20,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:35:20,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-18 08:35:20,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:20,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-18 08:35:20,737 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:20,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 4 times [2018-11-18 08:35:20,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:20,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:20,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:20,768 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:20,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:20,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:20,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:20,768 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:20,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:20,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:20,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:20,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-18 08:35:20,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:20,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:20,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:20,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:20,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:20,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:20,806 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:20,806 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:20,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:20,812 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:20,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:20,815 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:20,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:20,832 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:20,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:20,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:21,638 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:21,640 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:21,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:21,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:21,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:21,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:21,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:21,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:21,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:21,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-18 08:35:21,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:21,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:21,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:21,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:21,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:21,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:21,668 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:21,668 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:21,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:21,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:21,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:21,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:21,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:21,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:21,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:21,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:21,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:21,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:21,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:21,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:21,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:21,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:21,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:21,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:21,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:21,671 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:21,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:21,673 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:21,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:21,673 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:21,673 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:21,673 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:35:21,673 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:21,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:21,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:21,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:21,765 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:21,765 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 08:35:21,793 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 298 states and 400 transitions. Complement of second has 18 states. [2018-11-18 08:35:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:35:21,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 08:35:21,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:21,794 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:21,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:21,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:21,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:21,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:21,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 08:35:21,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 304 states and 406 transitions. Complement of second has 17 states. [2018-11-18 08:35:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:35:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 08:35:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:21,922 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:21,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:21,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:22,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:22,021 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:22,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 08:35:22,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 362 states and 482 transitions. Complement of second has 27 states. [2018-11-18 08:35:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:35:22,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 08:35:22,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:22,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-11-18 08:35:22,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:22,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-18 08:35:22,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:22,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 482 transitions. [2018-11-18 08:35:22,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:22,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 287 states and 389 transitions. [2018-11-18 08:35:22,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-18 08:35:22,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-18 08:35:22,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 389 transitions. [2018-11-18 08:35:22,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:22,065 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 389 transitions. [2018-11-18 08:35:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 389 transitions. [2018-11-18 08:35:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-11-18 08:35:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 08:35:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-18 08:35:22,072 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 08:35:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:35:22,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:35:22,073 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand 11 states. [2018-11-18 08:35:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:22,190 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2018-11-18 08:35:22,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:35:22,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 574 transitions. [2018-11-18 08:35:22,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:22,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 378 states and 548 transitions. [2018-11-18 08:35:22,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-18 08:35:22,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-11-18 08:35:22,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 548 transitions. [2018-11-18 08:35:22,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:22,199 INFO L705 BuchiCegarLoop]: Abstraction has 378 states and 548 transitions. [2018-11-18 08:35:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 548 transitions. [2018-11-18 08:35:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 321. [2018-11-18 08:35:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 08:35:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-18 08:35:22,208 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:35:22,208 INFO L608 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:35:22,208 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:35:22,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 463 transitions. [2018-11-18 08:35:22,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:22,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:22,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:22,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 11, 10, 9, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2018-11-18 08:35:22,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:22,211 INFO L794 eck$LassoCheckResult]: Stem: 11440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11438#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 := 10; 11439#L25 call main_#t~ret2 := fibo(main_~x~0);< 11473#fiboENTRY ~n := #in~n; 11554#L6 assume !(~n < 1); 11552#L8 assume !(1 == ~n); 11549#L11 call #t~ret0 := fibo(~n - 1);< 11550#fiboENTRY ~n := #in~n; 11565#L6 assume !(~n < 1); 11563#L8 assume !(1 == ~n); 11560#L11 call #t~ret0 := fibo(~n - 1);< 11561#fiboENTRY ~n := #in~n; 11571#L6 assume !(~n < 1); 11570#L8 assume !(1 == ~n); 11556#L11 call #t~ret0 := fibo(~n - 1);< 11569#fiboENTRY ~n := #in~n; 11584#L6 assume !(~n < 1); 11582#L8 assume !(1 == ~n); 11493#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(1 == ~n); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(1 == ~n); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(1 == ~n); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11580#L6 assume !(~n < 1); 11686#L8 assume 1 == ~n;#res := 1; 11685#fiboFINAL assume true; 11683#fiboEXIT >#33#return; 11681#L11-1 call #t~ret1 := fibo(~n - 2);< 11682#fiboENTRY ~n := #in~n; 11688#L6 assume ~n < 1;#res := 0; 11687#fiboFINAL assume true; 11680#fiboEXIT >#35#return; 11677#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11676#fiboFINAL assume true; 11674#fiboEXIT >#33#return; 11662#L11-1 call #t~ret1 := fibo(~n - 2);< 11664#fiboENTRY ~n := #in~n; 11691#L6 assume !(~n < 1); 11673#L8 assume 1 == ~n;#res := 1; 11478#fiboFINAL assume true; 11661#fiboEXIT >#35#return; 11658#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11657#fiboFINAL assume true; 11635#fiboEXIT >#33#return; 11636#L11-1 call #t~ret1 := fibo(~n - 2);< 11641#fiboENTRY ~n := #in~n; 11675#L6 assume !(~n < 1); 11672#L8 assume !(1 == ~n); 11442#L11 call #t~ret0 := fibo(~n - 1);< 11702#fiboENTRY ~n := #in~n; 11472#L6 assume !(~n < 1); 11441#L8 assume 1 == ~n;#res := 1; 11444#fiboFINAL assume true; 11752#fiboEXIT >#33#return; 11649#L11-1 call #t~ret1 := fibo(~n - 2);< 11651#fiboENTRY ~n := #in~n; 11653#L6 assume ~n < 1;#res := 0; 11652#fiboFINAL assume true; 11648#fiboEXIT >#35#return; 11646#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11643#fiboFINAL assume true; 11639#fiboEXIT >#35#return; 11568#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11573#fiboFINAL assume true; 11566#fiboEXIT >#33#return; 11477#L11-1 call #t~ret1 := fibo(~n - 2);< 11488#fiboENTRY ~n := #in~n; 11486#L6 assume !(~n < 1); 11474#L8 assume !(1 == ~n); 11447#L11 call #t~ret0 := fibo(~n - 1);< 11703#fiboENTRY ~n := #in~n; 11751#L6 assume !(~n < 1); 11750#L8 assume !(1 == ~n); 11709#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(1 == ~n); 11708#L11 [2018-11-18 08:35:22,211 INFO L796 eck$LassoCheckResult]: Loop: 11708#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(1 == ~n); 11708#L11 [2018-11-18 08:35:22,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1797143672, now seen corresponding path program 4 times [2018-11-18 08:35:22,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:22,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 183 proven. 76 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-11-18 08:35:22,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:22,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:22,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 08:35:22,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 08:35:22,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:35:22,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 148 proven. 222 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 08:35:22,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:22,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 21 [2018-11-18 08:35:22,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:35:22,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 5 times [2018-11-18 08:35:22,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:22,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:22,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:22,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:22,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:22,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:22,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:22,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:22,457 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:22,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:22,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:22,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:22,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-18 08:35:22,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:22,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:22,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:22,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:22,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:22,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:22,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:22,491 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:22,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:22,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:22,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:22,499 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:22,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:22,524 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:22,526 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:35:22,526 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:22,546 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:22,547 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:22,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:22,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:23,280 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:23,282 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:23,282 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:23,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:23,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:23,282 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:23,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:23,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:23,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:23,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-18 08:35:23,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:23,282 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:23,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:23,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:23,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:23,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:23,314 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:23,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:23,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:23,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:23,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:23,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:23,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:23,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:23,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:23,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:23,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:23,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:23,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:23,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:23,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:23,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:23,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:23,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:23,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:23,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-18 08:35:23,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:23,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:23,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:23,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:23,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:23,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:23,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:23,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:23,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:23,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:23,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:23,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:23,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:23,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:23,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:23,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:23,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:23,326 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:23,326 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:23,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:23,327 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:23,327 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:23,327 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:35:23,327 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:23,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:23,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:23,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:23,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:23,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-18 08:35:23,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 336 states and 479 transitions. Complement of second has 18 states. [2018-11-18 08:35:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:35:23,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-18 08:35:23,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:23,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:23,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:23,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:23,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:23,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:23,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-18 08:35:23,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 342 states and 485 transitions. Complement of second has 17 states. [2018-11-18 08:35:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:35:23,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-18 08:35:23,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:23,642 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:23,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:23,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:23,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:23,740 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:23,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-18 08:35:23,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 399 states and 563 transitions. Complement of second has 27 states. [2018-11-18 08:35:23,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:35:23,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-18 08:35:23,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:23,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 90 letters. Loop has 4 letters. [2018-11-18 08:35:23,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:23,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 8 letters. [2018-11-18 08:35:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:23,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 563 transitions. [2018-11-18 08:35:23,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:23,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 321 states and 463 transitions. [2018-11-18 08:35:23,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-18 08:35:23,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-18 08:35:23,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 463 transitions. [2018-11-18 08:35:23,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:23,804 INFO L705 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:35:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 463 transitions. [2018-11-18 08:35:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-11-18 08:35:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 08:35:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-18 08:35:23,811 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:35:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 08:35:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-18 08:35:23,811 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 21 states. [2018-11-18 08:35:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:24,091 INFO L93 Difference]: Finished difference Result 508 states and 782 transitions. [2018-11-18 08:35:24,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 08:35:24,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 782 transitions. [2018-11-18 08:35:24,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:24,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 504 states and 778 transitions. [2018-11-18 08:35:24,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-18 08:35:24,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-11-18 08:35:24,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 778 transitions. [2018-11-18 08:35:24,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:24,104 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 778 transitions. [2018-11-18 08:35:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 778 transitions. [2018-11-18 08:35:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 417. [2018-11-18 08:35:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 08:35:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-18 08:35:24,115 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:35:24,115 INFO L608 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:35:24,115 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 08:35:24,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 653 transitions. [2018-11-18 08:35:24,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:24,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:24,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:24,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2018-11-18 08:35:24,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:24,119 INFO L794 eck$LassoCheckResult]: Stem: 14876#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14867#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 := 10; 14868#L25 call main_#t~ret2 := fibo(main_~x~0);< 14908#fiboENTRY ~n := #in~n; 14992#L6 assume !(~n < 1); 14990#L8 assume !(1 == ~n); 14984#L11 call #t~ret0 := fibo(~n - 1);< 14987#fiboENTRY ~n := #in~n; 14988#L6 assume !(~n < 1); 14985#L8 assume !(1 == ~n); 14922#L11 call #t~ret0 := fibo(~n - 1);< 14982#fiboENTRY ~n := #in~n; 14980#L6 assume !(~n < 1); 14978#L8 assume !(1 == ~n); 14957#L11 call #t~ret0 := fibo(~n - 1);< 14974#fiboENTRY ~n := #in~n; 14973#L6 assume !(~n < 1); 14972#L8 assume !(1 == ~n); 14937#L11 call #t~ret0 := fibo(~n - 1);< 14947#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14952#L8 assume !(1 == ~n); 14938#L11 call #t~ret0 := fibo(~n - 1);< 14947#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14952#L8 assume !(1 == ~n); 14938#L11 call #t~ret0 := fibo(~n - 1);< 14947#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14952#L8 assume !(1 == ~n); 14938#L11 call #t~ret0 := fibo(~n - 1);< 14947#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14952#L8 assume !(1 == ~n); 14938#L11 call #t~ret0 := fibo(~n - 1);< 14947#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14952#L8 assume !(1 == ~n); 14938#L11 call #t~ret0 := fibo(~n - 1);< 14947#fiboENTRY ~n := #in~n; 14955#L6 assume !(~n < 1); 15195#L8 assume 1 == ~n;#res := 1; 15194#fiboFINAL assume true; 15191#fiboEXIT >#33#return; 15187#L11-1 call #t~ret1 := fibo(~n - 2);< 15188#fiboENTRY ~n := #in~n; 15193#L6 assume ~n < 1;#res := 0; 15190#fiboFINAL assume true; 15186#fiboEXIT >#35#return; 15143#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15142#fiboFINAL assume true; 15141#fiboEXIT >#33#return; 15051#L11-1 call #t~ret1 := fibo(~n - 2);< 15055#fiboENTRY ~n := #in~n; 15207#L6 assume !(~n < 1); 15068#L8 assume 1 == ~n;#res := 1; 15066#fiboFINAL assume true; 15050#fiboEXIT >#35#return; 15048#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15046#fiboFINAL assume true; 15022#fiboEXIT >#33#return; 15023#L11-1 call #t~ret1 := fibo(~n - 2);< 15075#fiboENTRY ~n := #in~n; 15074#L6 assume !(~n < 1); 15071#L8 assume !(1 == ~n); 15072#L11 call #t~ret0 := fibo(~n - 1);< 15149#fiboENTRY ~n := #in~n; 15196#L6 assume !(~n < 1); 15184#L8 assume 1 == ~n;#res := 1; 15181#fiboFINAL assume true; 15148#fiboEXIT >#33#return; 15038#L11-1 call #t~ret1 := fibo(~n - 2);< 15043#fiboENTRY ~n := #in~n; 15064#L6 assume ~n < 1;#res := 0; 15047#fiboFINAL assume true; 15035#fiboEXIT >#35#return; 15041#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15139#fiboFINAL assume true; 15136#fiboEXIT >#35#return; 15134#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14950#fiboFINAL assume true; 14945#fiboEXIT >#33#return; 14933#L11-1 call #t~ret1 := fibo(~n - 2);< 14939#fiboENTRY ~n := #in~n; 14932#L6 assume !(~n < 1); 14934#L8 assume !(1 == ~n); 14914#L11 call #t~ret0 := fibo(~n - 1);< 15146#fiboENTRY ~n := #in~n; 15163#L6 assume !(~n < 1); 15162#L8 assume !(1 == ~n); 15159#L11 call #t~ret0 := fibo(~n - 1);< 15161#fiboENTRY ~n := #in~n; 15168#L6 assume !(~n < 1); 15166#L8 assume 1 == ~n;#res := 1; 15164#fiboFINAL assume true; 15158#fiboEXIT >#33#return; 15152#L11-1 call #t~ret1 := fibo(~n - 2);< 14905#fiboENTRY ~n := #in~n; 15175#L6 assume ~n < 1;#res := 0; 15117#fiboFINAL assume true; 15151#fiboEXIT >#35#return; 15150#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15147#fiboFINAL assume true; 15145#fiboEXIT >#33#return; 15053#L11-1 call #t~ret1 := fibo(~n - 2);< 15056#fiboENTRY ~n := #in~n; 15177#L6 assume !(~n < 1); 15079#L8 assume 1 == ~n;#res := 1; 14912#fiboFINAL assume true; 15052#fiboEXIT >#35#return; 15048#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15046#fiboFINAL assume true; 15022#fiboEXIT >#35#return; 15005#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15003#fiboFINAL assume true; 14998#fiboEXIT >#33#return; 14942#L11-1 call #t~ret1 := fibo(~n - 2);< 14923#fiboENTRY ~n := #in~n; 15125#L6 assume !(~n < 1); 15069#L8 assume !(1 == ~n); 15070#L11 call #t~ret0 := fibo(~n - 1);< 15197#fiboENTRY ~n := #in~n; 15198#L6 assume !(~n < 1); 15243#L8 assume !(1 == ~n); 15237#L11 call #t~ret0 := fibo(~n - 1);< 14907#fiboENTRY ~n := #in~n; 15253#L6 assume !(~n < 1); 15251#L8 assume !(1 == ~n); 15234#L11 [2018-11-18 08:35:24,119 INFO L796 eck$LassoCheckResult]: Loop: 15234#L11 call #t~ret0 := fibo(~n - 1);< 14907#fiboENTRY ~n := #in~n; 15253#L6 assume !(~n < 1); 15251#L8 assume !(1 == ~n); 15234#L11 [2018-11-18 08:35:24,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1400596499, now seen corresponding path program 5 times [2018-11-18 08:35:24,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:24,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:24,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 6 times [2018-11-18 08:35:24,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:24,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:24,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:24,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:24,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:24,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 662415298, now seen corresponding path program 6 times [2018-11-18 08:35:24,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:24,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:24,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-11-18 08:35:24,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:24,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:24,317 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 08:35:24,340 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-18 08:35:24,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:35:24,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-18 08:35:24,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:24,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-11-18 08:35:24,480 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:24,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:24,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:24,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:24,480 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:35:24,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:24,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:24,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:24,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-18 08:35:24,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:24,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:24,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:24,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:24,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:24,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:24,508 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:24,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:35:24,509 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bb88f49-1016-4923-b805-0bd90ccf9659/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:24,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:35:24,528 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:29,694 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:29,695 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:29,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:29,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:29,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:29,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:29,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:29,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:29,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:29,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-18 08:35:29,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:29,696 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:29,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:29,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:29,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:29,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:29,725 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:29,725 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:29,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:29,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:29,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:29,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:29,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:29,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:29,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:29,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:29,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:29,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:35:29,729 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:29,729 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:29,729 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:35:29,729 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:29,729 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:35:29,737 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:35:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:29,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:29,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:29,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-18 08:35:29,849 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:29,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-18 08:35:29,878 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 432 states and 669 transitions. Complement of second has 18 states. [2018-11-18 08:35:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:35:29,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-18 08:35:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:29,879 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:29,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:29,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:30,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:30,055 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:30,055 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-18 08:35:30,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 438 states and 675 transitions. Complement of second has 17 states. [2018-11-18 08:35:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:35:30,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-18 08:35:30,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:30,117 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:35:30,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:30,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:30,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:30,230 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 08:35:30,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-18 08:35:30,269 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 513 states and 783 transitions. Complement of second has 27 states. [2018-11-18 08:35:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:35:30,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-18 08:35:30,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:30,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 132 letters. Loop has 4 letters. [2018-11-18 08:35:30,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:30,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 8 letters. [2018-11-18 08:35:30,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:30,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 783 transitions. [2018-11-18 08:35:30,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:35:30,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 417 states and 653 transitions. [2018-11-18 08:35:30,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-18 08:35:30,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-11-18 08:35:30,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 653 transitions. [2018-11-18 08:35:30,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:30,281 INFO L705 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:35:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 653 transitions. [2018-11-18 08:35:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-18 08:35:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 08:35:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-18 08:35:30,288 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:35:30,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 08:35:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-18 08:35:30,289 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand 25 states. [2018-11-18 08:35:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:30,636 INFO L93 Difference]: Finished difference Result 595 states and 922 transitions. [2018-11-18 08:35:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 08:35:30,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 922 transitions. [2018-11-18 08:35:30,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:35:30,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 0 states and 0 transitions. [2018-11-18 08:35:30,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:35:30,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:35:30,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:35:30,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:30,640 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:30,640 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:30,640 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:30,640 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 08:35:30,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:35:30,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:35:30,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:35:30,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:35:30 BoogieIcfgContainer [2018-11-18 08:35:30,646 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:35:30,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:30,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:30,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:30,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:09" (3/4) ... [2018-11-18 08:35:30,652 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:35:30,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:30,652 INFO L168 Benchmark]: Toolchain (without parser) took 21400.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.8 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -87.3 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:30,654 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:30,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:30,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:30,655 INFO L168 Benchmark]: Boogie Preprocessor took 9.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:30,655 INFO L168 Benchmark]: RCFGBuilder took 157.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:30,655 INFO L168 Benchmark]: BuchiAutomizer took 21063.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.1 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:30,656 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:30,658 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21063.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.1 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.0s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 16.2s. Construction of modules took 1.1s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 474 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 417 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 355 SDtfs, 976 SDslu, 536 SDs, 0 SdLazy, 1912 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...