./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:03:09,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:03:09,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:03:09,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:03:09,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:03:09,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:03:09,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:03:09,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:03:09,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:03:09,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:03:09,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:03:09,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:03:09,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:03:09,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:03:09,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:03:09,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:03:09,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:03:09,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:03:09,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:03:09,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:03:09,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:03:09,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:03:09,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:03:09,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:03:09,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:03:09,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:03:09,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:03:09,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:03:09,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:03:09,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:03:09,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:03:09,476 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:03:09,476 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:03:09,476 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:03:09,477 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:03:09,478 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:03:09,478 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:03:09,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:03:09,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:03:09,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:03:09,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:03:09,505 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:03:09,505 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:03:09,505 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:03:09,506 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:03:09,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:03:09,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:03:09,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:03:09,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:03:09,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:03:09,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:03:09,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:03:09,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:03:09,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:03:09,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:03:09,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:03:09,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:03:09,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:03:09,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:03:09,510 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:03:09,510 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:03:09,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:03:09,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:03:09,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:03:09,511 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:03:09,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:03:09,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:03:09,513 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:03:09,514 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:03:09,514 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-11-29 00:03:09,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:03:09,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:03:09,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:03:09,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:03:09,571 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:03:09,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-29 00:03:09,637 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14cdc6aa/c5492311aef94e7881f2b7e5dd7aff26/FLAG25171e1aa [2018-11-29 00:03:10,128 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:03:10,129 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-29 00:03:10,137 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14cdc6aa/c5492311aef94e7881f2b7e5dd7aff26/FLAG25171e1aa [2018-11-29 00:03:10,455 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14cdc6aa/c5492311aef94e7881f2b7e5dd7aff26 [2018-11-29 00:03:10,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:03:10,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:03:10,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:10,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:03:10,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:03:10,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532af33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10, skipping insertion in model container [2018-11-29 00:03:10,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:03:10,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:03:10,730 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:10,737 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:03:10,757 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:10,774 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:03:10,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10 WrapperNode [2018-11-29 00:03:10,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:10,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:10,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:03:10,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:03:10,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:10,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:03:10,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:03:10,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:03:10,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:03:10,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:03:10,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:03:10,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:03:10,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:10,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:03:10,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:03:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-29 00:03:10,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-29 00:03:11,319 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:03:11,319 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:03:11,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:11 BoogieIcfgContainer [2018-11-29 00:03:11,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:03:11,321 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:03:11,321 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:03:11,337 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:03:11,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:11,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:03:10" (1/3) ... [2018-11-29 00:03:11,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aad1981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:11, skipping insertion in model container [2018-11-29 00:03:11,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:11,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (2/3) ... [2018-11-29 00:03:11,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aad1981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:11, skipping insertion in model container [2018-11-29 00:03:11,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:11,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:11" (3/3) ... [2018-11-29 00:03:11,364 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-11-29 00:03:11,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:03:11,582 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:03:11,583 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:03:11,583 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:03:11,583 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:03:11,584 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:03:11,584 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:03:11,584 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:03:11,584 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:03:11,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:03:11,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:11,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:11,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:11,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:11,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:11,673 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:03:11,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:03:11,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:11,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:11,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:11,681 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:11,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:11,694 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-11-29 00:03:11,695 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2018-11-29 00:03:11,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-11-29 00:03:11,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-11-29 00:03:11,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:11,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-11-29 00:03:11,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:11,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:11,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:11,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:12,092 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:12,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:12,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:12,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:12,094 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:12,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:12,094 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:12,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:12,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:12,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:12,121 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-29 00:03:12,141 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-29 00:03:12,165 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-29 00:03:12,170 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-29 00:03:12,177 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-29 00:03:12,337 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:12,338 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:12,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:12,353 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,376 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:12,376 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:03:12,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:12,415 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:12,429 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:12,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:12,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:12,480 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:12,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:12,505 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:12,506 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:12,530 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:12,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:12,636 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:12,638 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:12,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:12,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:12,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:12,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:12,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:12,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:12,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:12,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:12,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:12,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-29 00:03:12,658 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-29 00:03:12,663 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-29 00:03:12,668 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-29 00:03:12,674 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-29 00:03:12,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:12,861 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:12,863 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-29 00:03:12,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,875 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-29 00:03:12,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,881 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-29 00:03:12,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,887 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-29 00:03:12,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,891 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-29 00:03:12,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,902 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:12,908 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:12,908 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:12,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:12,910 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:12,911 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:12,911 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:03:12,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:13,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:13,484 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-29 00:03:13,501 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-29 00:03:13,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-29 00:03:13,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-11-29 00:03:13,708 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-29 00:03:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:03:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-29 00:03:13,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:03:13,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:03:13,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:03:13,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-29 00:03:13,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:13,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-11-29 00:03:13,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:03:13,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:03:13,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-29 00:03:13,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,738 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:03:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-29 00:03:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-29 00:03:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-29 00:03:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-29 00:03:13,772 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:03:13,772 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:03:13,772 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:03:13,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-29 00:03:13,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:13,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:13,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:13,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:13,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:13,777 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2018-11-29 00:03:13,777 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2018-11-29 00:03:13,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-11-29 00:03:13,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,947 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-29 00:03:13,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:13,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:13,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:13,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-11-29 00:03:13,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,108 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2018-11-29 00:03:14,261 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-29 00:03:14,465 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-29 00:03:14,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:14,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:14,468 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:14,474 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-29 00:03:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:14,617 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-29 00:03:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:14,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-29 00:03:14,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:14,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-29 00:03:14,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:03:14,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:03:14,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-29 00:03:14,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:14,626 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-29 00:03:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:03:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:03:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-29 00:03:14,632 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:14,632 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:14,632 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:03:14,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-29 00:03:14,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:14,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:14,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:14,638 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,638 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2018-11-29 00:03:14,638 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2018-11-29 00:03:14,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-11-29 00:03:14,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,716 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-29 00:03:14,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,747 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-29 00:03:14,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:14,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-29 00:03:14,769 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:14,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-11-29 00:03:14,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,012 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,014 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:15,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:15,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,017 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-29 00:03:15,062 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-29 00:03:15,065 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-29 00:03:15,068 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-29 00:03:15,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:15,146 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,149 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:15,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,850 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:15,852 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:15,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:15,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,855 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-29 00:03:15,866 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-29 00:03:15,900 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-29 00:03:15,908 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-29 00:03:16,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:16,022 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:16,023 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-29 00:03:16,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:16,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:16,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:16,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:16,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:16,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:16,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:16,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:16,030 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-29 00:03:16,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:16,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:16,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:16,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:16,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:16,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:16,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:16,046 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:16,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:16,052 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:16,053 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:16,053 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:16,053 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:16,053 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:16,054 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:16,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:16,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:16,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:16,266 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-29 00:03:16,267 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-29 00:03:16,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-29 00:03:16,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-11-29 00:03:16,607 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-29 00:03:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:03:16,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-29 00:03:16,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:16,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-29 00:03:16,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:16,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-29 00:03:16,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:16,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-29 00:03:16,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:16,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-29 00:03:16,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-29 00:03:16,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:03:16,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-29 00:03:16,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:16,629 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-29 00:03:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-29 00:03:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-29 00:03:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:03:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-29 00:03:16,647 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-29 00:03:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:03:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:03:16,648 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-29 00:03:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:16,790 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-29 00:03:16,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:03:16,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-29 00:03:16,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:16,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-29 00:03:16,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:03:16,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:03:16,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-29 00:03:16,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:16,805 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-29 00:03:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-29 00:03:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-29 00:03:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:03:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-29 00:03:16,819 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:03:16,819 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:03:16,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:03:16,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-29 00:03:16,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:16,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:16,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:16,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:16,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:16,824 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:03:16,824 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:03:16,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-11-29 00:03:16,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:16,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:16,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:16,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:16,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:16,953 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-29 00:03:16,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:16,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:16,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,003 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-29 00:03:17,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:17,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:03:17,033 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:17,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-11-29 00:03:17,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:17,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:17,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:17,216 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:17,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:17,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:17,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:17,216 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:17,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:17,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:17,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:03:17,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:17,217 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:17,218 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-29 00:03:17,239 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-29 00:03:17,243 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-29 00:03:17,245 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-29 00:03:17,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:17,315 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:17,319 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:17,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:18,041 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:18,043 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:18,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:18,044 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:18,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:18,044 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:18,044 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:18,044 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:18,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:18,045 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:03:18,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:18,045 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:18,046 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-29 00:03:18,054 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-29 00:03:18,058 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-29 00:03:18,061 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-29 00:03:18,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:18,133 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:18,134 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-29 00:03:18,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:18,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:18,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:18,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:18,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:18,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:18,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:18,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:18,141 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-29 00:03:18,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:18,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:18,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:18,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:18,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:18,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:18,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:18,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:18,146 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-29 00:03:18,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:18,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:18,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:18,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:18,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:18,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:18,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:18,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:18,155 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-29 00:03:18,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:18,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:18,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:18,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:18,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:18,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:18,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:18,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:18,182 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:18,184 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:18,185 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:18,185 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:18,185 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:18,186 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:18,186 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:18,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,436 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-29 00:03:18,437 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-29 00:03:18,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:18,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-11-29 00:03:18,636 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-29 00:03:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:03:18,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:18,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:18,637 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:18,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,849 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-29 00:03:18,849 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-29 00:03:18,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:19,020 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-11-29 00:03:19,023 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-29 00:03:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-29 00:03:19,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:19,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:19,027 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:19,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,388 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:03:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:19,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,519 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-29 00:03:19,519 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-29 00:03:19,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:20,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-11-29 00:03:20,149 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-29 00:03:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-29 00:03:20,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-29 00:03:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-29 00:03:20,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:20,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-29 00:03:20,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:03:20,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-29 00:03:20,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-29 00:03:20,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-29 00:03:20,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-29 00:03:20,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:20,201 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-29 00:03:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-29 00:03:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-29 00:03:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-29 00:03:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-29 00:03:20,288 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-29 00:03:20,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:03:20,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:03:20,289 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-29 00:03:20,600 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:21,121 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-11-29 00:03:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:03:21,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-11-29 00:03:21,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:03:21,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-11-29 00:03:21,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-29 00:03:21,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-29 00:03:21,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-11-29 00:03:21,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:21,149 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-11-29 00:03:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-11-29 00:03:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-11-29 00:03:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-29 00:03:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-11-29 00:03:21,189 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:03:21,190 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:03:21,190 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:03:21,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-11-29 00:03:21,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:21,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:21,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:21,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:21,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:21,200 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-29 00:03:21,200 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-29 00:03:21,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-11-29 00:03:21,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:21,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:21,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,310 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-29 00:03:21,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:21,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,502 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-29 00:03:21,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:21,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-29 00:03:21,538 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:21,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:21,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-11-29 00:03:21,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:21,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:21,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:21,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:21,639 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:21,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:21,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:21,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:21,640 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:21,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:21,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:21,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:21,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:21,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:21,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03: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-29 00:03:21,644 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-29 00:03:21,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:21,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:21,654 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-29 00:03:21,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:21,685 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:21,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:21,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:21,693 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:21,693 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:21,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:21,716 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:21,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:21,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:21,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:21,796 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:21,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:21,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:21,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:21,796 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:21,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:21,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:21,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:21,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:21,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:21,797 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:21,799 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-29 00:03:21,810 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-29 00:03:21,812 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-29 00:03:21,813 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-29 00:03:21,814 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-29 00:03:21,890 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:21,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:21,891 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-29 00:03:21,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:21,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:21,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:21,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:21,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:21,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:21,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:21,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:21,902 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:21,902 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:21,903 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:21,903 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:21,903 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:21,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:03:21,903 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:21,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,059 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-29 00:03:22,060 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-29 00:03:22,060 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:03:22,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-29 00:03:22,168 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-29 00:03:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:03:22,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:22,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,169 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:22,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,351 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-29 00:03:22,352 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-29 00:03:22,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:03:22,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-29 00:03:22,466 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-29 00:03:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:03:22,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:22,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,467 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:22,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:22,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:22,631 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-29 00:03:22,632 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-29 00:03:22,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:03:22,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-11-29 00:03:22,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-29 00:03:22,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:22,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-29 00:03:22,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-29 00:03:22,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-11-29 00:03:22,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:22,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-11-29 00:03:22,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-29 00:03:22,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-29 00:03:22,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-11-29 00:03:22,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:22,881 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-11-29 00:03:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-11-29 00:03:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-11-29 00:03:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-29 00:03:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-11-29 00:03:22,908 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-11-29 00:03:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-29 00:03:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-29 00:03:22,909 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-11-29 00:03:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:23,661 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-11-29 00:03:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-29 00:03:23,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-11-29 00:03:23,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:23,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-11-29 00:03:23,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-29 00:03:23,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-29 00:03:23,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-11-29 00:03:23,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:23,676 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-11-29 00:03:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-11-29 00:03:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-11-29 00:03:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:03:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:03:23,694 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:03:23,695 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:03:23,695 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:23,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-11-29 00:03:23,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:23,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:23,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:23,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:23,703 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:23,704 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-29 00:03:23,704 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-29 00:03:23,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-11-29 00:03:23,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:23,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:23,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:23,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:23,888 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-29 00:03:23,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:23,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:03:23,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:23,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:23,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:23,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:24,129 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-29 00:03:24,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:24,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-29 00:03:24,160 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:24,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-11-29 00:03:24,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:24,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:24,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:24,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:24,225 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:24,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:24,226 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:24,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:24,226 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:24,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:24,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:24,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:24,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:03:24,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:24,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:24,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:24,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:24,398 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:03:24,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:24,422 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-29 00:03:24,856 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-29 00:03:25,020 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:25,021 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:03:25,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:25,029 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:25,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:25,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-29 00:03:25,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:25,055 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:03:25,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:25,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:32,988 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:32,992 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:32,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:32,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:32,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:32,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:32,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:32,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:32,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:32,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:03:32,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:32,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:32,993 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-29 00:03:33,001 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-29 00:03:33,004 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-29 00:03:33,008 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-29 00:03:33,052 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:33,053 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:33,053 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-29 00:03:33,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:33,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:33,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:33,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:33,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:33,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:33,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:33,064 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:33,066 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:33,066 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:33,068 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:33,068 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:33,068 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:33,068 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:33,068 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:33,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:33,285 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-29 00:03:33,285 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-29 00:03:33,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:03:33,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-11-29 00:03:33,351 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-29 00:03:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:33,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:03:33,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:33,352 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:33,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:33,811 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-29 00:03:33,811 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:03:33,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-11-29 00:03:33,905 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-29 00:03:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:33,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:03:33,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:33,906 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:33,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:33,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:34,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:34,105 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-29 00:03:34,106 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-29 00:03:34,106 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:03:34,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-11-29 00:03:34,347 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-29 00:03:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:03:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-11-29 00:03:34,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-11-29 00:03:34,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:34,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-11-29 00:03:34,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:34,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-11-29 00:03:34,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-29 00:03:34,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-29 00:03:34,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-11-29 00:03:34,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:34,356 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-11-29 00:03:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-11-29 00:03:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-29 00:03:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:03:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:03:34,365 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:03:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:03:34,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:03:34,367 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-11-29 00:03:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:34,865 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2018-11-29 00:03:34,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:03:34,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 473 transitions. [2018-11-29 00:03:34,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:34,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 315 states and 437 transitions. [2018-11-29 00:03:34,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-29 00:03:34,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-29 00:03:34,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 437 transitions. [2018-11-29 00:03:34,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:34,879 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 437 transitions. [2018-11-29 00:03:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 437 transitions. [2018-11-29 00:03:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 270. [2018-11-29 00:03:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-29 00:03:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2018-11-29 00:03:34,894 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2018-11-29 00:03:34,894 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2018-11-29 00:03:34,894 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:03:34,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 364 transitions. [2018-11-29 00:03:34,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:34,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:34,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:34,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 9, 8, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-29 00:03:34,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:34,901 INFO L794 eck$LassoCheckResult]: Stem: 8504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 8505#L25 call main_#t~ret2 := fibo(main_~x~0);< 8542#fiboENTRY ~n := #in~n; 8601#L6 assume !(~n < 1); 8599#L8 assume !(1 == ~n); 8596#L11 call #t~ret0 := fibo(~n - 1);< 8597#fiboENTRY ~n := #in~n; 8612#L6 assume !(~n < 1); 8611#L8 assume !(1 == ~n); 8606#L11 call #t~ret0 := fibo(~n - 1);< 8610#fiboENTRY ~n := #in~n; 8614#L6 assume !(~n < 1); 8608#L8 assume !(1 == ~n); 8603#L11 call #t~ret0 := fibo(~n - 1);< 8607#fiboENTRY ~n := #in~n; 8635#L6 assume !(~n < 1); 8634#L8 assume !(1 == ~n); 8529#L11 call #t~ret0 := fibo(~n - 1);< 8627#fiboENTRY ~n := #in~n; 8646#L6 assume !(~n < 1); 8645#L8 assume !(1 == ~n); 8530#L11 call #t~ret0 := fibo(~n - 1);< 8627#fiboENTRY ~n := #in~n; 8646#L6 assume !(~n < 1); 8645#L8 assume !(1 == ~n); 8530#L11 call #t~ret0 := fibo(~n - 1);< 8627#fiboENTRY ~n := #in~n; 8647#L6 assume !(~n < 1); 8696#L8 assume 1 == ~n;#res := 1; 8680#fiboFINAL assume true; 8677#fiboEXIT >#32#return; 8528#L11-1 call #t~ret1 := fibo(~n - 2);< 8531#fiboENTRY ~n := #in~n; 8673#L6 assume ~n < 1;#res := 0; 8672#fiboFINAL assume true; 8671#fiboEXIT >#34#return; 8669#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8668#fiboFINAL assume true; 8658#fiboEXIT >#32#return; 8654#L11-1 call #t~ret1 := fibo(~n - 2);< 8655#fiboENTRY ~n := #in~n; 8664#L6 assume !(~n < 1); 8662#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8653#fiboEXIT >#34#return; 8617#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8648#fiboFINAL assume true; 8622#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8624#fiboENTRY ~n := #in~n; 8555#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8539#L11 call #t~ret0 := fibo(~n - 1);< 8535#fiboENTRY ~n := #in~n; 8762#L6 assume !(~n < 1); 8763#L8 assume !(1 == ~n); 8557#L11 call #t~ret0 := fibo(~n - 1);< 8561#fiboENTRY ~n := #in~n; 8582#L6 assume !(~n < 1); 8580#L8 assume !(1 == ~n); 8558#L11 [2018-11-29 00:03:34,901 INFO L796 eck$LassoCheckResult]: Loop: 8558#L11 call #t~ret0 := fibo(~n - 1);< 8561#fiboENTRY ~n := #in~n; 8582#L6 assume !(~n < 1); 8580#L8 assume !(1 == ~n); 8558#L11 [2018-11-29 00:03:34,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash 272834295, now seen corresponding path program 3 times [2018-11-29 00:03:34,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:34,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:34,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:34,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:34,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-29 00:03:35,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:35,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:03:35,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:03:35,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-29 00:03:35,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:35,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-29 00:03:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 19 [2018-11-29 00:03:35,203 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:35,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-11-29 00:03:35,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:35,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:35,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:35,265 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:35,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:35,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:35,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:35,266 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:35,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:35,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:35,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:35,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:03:35,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:35,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:35,268 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-29 00:03:35,271 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-29 00:03:35,279 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-29 00:03:35,281 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-29 00:03:35,336 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:35,336 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:03:35,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:35,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:35,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:35,350 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-29 00:03:35,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:35,370 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:03:35,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:35,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:36,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:36,496 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:36,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:36,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:36,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:36,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:36,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:36,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:36,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:36,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:03:36,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:36,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:36,498 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-29 00:03:36,509 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-29 00:03:36,519 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-29 00:03:36,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-29 00:03:36,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:36,575 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:36,576 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-29 00:03:36,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:36,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:36,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:36,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:36,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:36,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:36,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:36,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:36,580 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-29 00:03:36,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:36,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:36,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:36,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:36,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:36,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:36,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:36,584 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:36,586 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:36,587 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:36,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:36,587 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:36,587 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:36,587 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:36,588 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:36,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:36,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:36,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:36,770 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-29 00:03:36,770 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-29 00:03:36,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-29 00:03:36,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 285 states and 380 transitions. Complement of second has 18 states. [2018-11-29 00:03:36,853 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-29 00:03:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:36,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:03:36,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:36,855 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:36,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:36,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,150 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-29 00:03:37,151 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-29 00:03:37,151 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-29 00:03:37,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 291 states and 386 transitions. Complement of second has 17 states. [2018-11-29 00:03:37,253 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-29 00:03:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:37,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:03:37,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:37,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:37,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:37,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:37,510 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-29 00:03:37,511 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-29 00:03:37,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-29 00:03:37,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 349 states and 462 transitions. Complement of second has 27 states. [2018-11-29 00:03:37,592 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-29 00:03:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:37,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:03:37,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:03:37,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 8 letters. [2018-11-29 00:03:37,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:37,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 462 transitions. [2018-11-29 00:03:37,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:37,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 274 states and 369 transitions. [2018-11-29 00:03:37,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-29 00:03:37,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-29 00:03:37,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 369 transitions. [2018-11-29 00:03:37,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:37,611 INFO L705 BuchiCegarLoop]: Abstraction has 274 states and 369 transitions. [2018-11-29 00:03:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 369 transitions. [2018-11-29 00:03:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-11-29 00:03:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-29 00:03:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2018-11-29 00:03:37,623 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2018-11-29 00:03:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-29 00:03:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-11-29 00:03:37,624 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 19 states. [2018-11-29 00:03:37,874 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:38,380 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2018-11-29 00:03:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:03:38,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 336 transitions. [2018-11-29 00:03:38,386 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:38,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 0 states and 0 transitions. [2018-11-29 00:03:38,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:38,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:38,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:38,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:38,387 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:38,387 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:38,387 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:38,387 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:03:38,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:38,388 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:38,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:38,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:38 BoogieIcfgContainer [2018-11-29 00:03:38,400 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:38,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:38,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:38,400 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:38,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:11" (3/4) ... [2018-11-29 00:03:38,405 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:38,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:38,406 INFO L168 Benchmark]: Toolchain (without parser) took 27946.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -291.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,407 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:38,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.49 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,409 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,409 INFO L168 Benchmark]: RCFGBuilder took 481.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:38,413 INFO L168 Benchmark]: BuchiAutomizer took 27078.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:38,414 INFO L168 Benchmark]: Witness Printer took 5.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:38,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.49 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 481.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27078.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.8s and 8 iterations. TraceHistogramMax:12. Analysis of lassos took 16.5s. Construction of modules took 3.0s. Büchi inclusion checks took 6.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 342 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 239 SDtfs, 640 SDslu, 300 SDs, 0 SdLazy, 1132 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...