./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_true-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_10_true-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 dd317ac0ecdb37853dacea373914a521115465e0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:30,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:02:30,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:02:30,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:02:30,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:02:30,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:02:30,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:02:30,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:02:30,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:02:30,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:02:30,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:02:30,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:02:30,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:02:30,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:02:30,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:02:30,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:02:30,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:02:30,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:02:30,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:02:30,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:02:30,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:02:30,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:02:30,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:02:30,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:02:30,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:02:30,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:02:30,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:02:30,386 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:02:30,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:02:30,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:02:30,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:02:30,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:02:30,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:02:30,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:02:30,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:02:30,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:02:30,391 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:02:30,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:02:30,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:02:30,410 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:02:30,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:02:30,411 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:02:30,411 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:02:30,411 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:02:30,411 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:02:30,412 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:02:30,412 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:02:30,412 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:02:30,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:02:30,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:02:30,412 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:02:30,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:02:30,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:02:30,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:02:30,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:02:30,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:02:30,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:02:30,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:02:30,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:02:30,414 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:02:30,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:02:30,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:02:30,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:02:30,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:02:30,415 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:02:30,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:02:30,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:02:30,415 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:02:30,416 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:02:30,416 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 -> dd317ac0ecdb37853dacea373914a521115465e0 [2018-11-29 00:02:30,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:02:30,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:02:30,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:02:30,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:02:30,499 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:02:30,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-29 00:02:30,568 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083c0921f/e4cd7cbf6aad413395f840d0a7553083/FLAG63e8aee9a [2018-11-29 00:02:31,018 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:02:31,019 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-29 00:02:31,027 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083c0921f/e4cd7cbf6aad413395f840d0a7553083/FLAG63e8aee9a [2018-11-29 00:02:31,363 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083c0921f/e4cd7cbf6aad413395f840d0a7553083 [2018-11-29 00:02:31,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:02:31,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:02:31,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:31,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:02:31,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:02:31,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d6ae4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31, skipping insertion in model container [2018-11-29 00:02:31,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:02:31,406 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:02:31,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:31,650 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:02:31,671 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:31,690 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:02:31,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31 WrapperNode [2018-11-29 00:02:31,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:31,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:31,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:02:31,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:02:31,703 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:02:31" (1/1) ... [2018-11-29 00:02:31,708 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:02:31" (1/1) ... [2018-11-29 00:02:31,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:31,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:02:31,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:02:31,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:02:31,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (1/1) ... [2018-11-29 00:02:31,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:02:31,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:02:31,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:02:31,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:02:31,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (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:02:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:02:31,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:02:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-29 00:02:31,931 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-29 00:02:32,137 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:02:32,138 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:02:32,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:32 BoogieIcfgContainer [2018-11-29 00:02:32,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:02:32,139 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:02:32,139 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:02:32,144 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:02:32,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:32,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:02:31" (1/3) ... [2018-11-29 00:02:32,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a5bb676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:32, skipping insertion in model container [2018-11-29 00:02:32,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:32,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:31" (2/3) ... [2018-11-29 00:02:32,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a5bb676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:32, skipping insertion in model container [2018-11-29 00:02:32,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:32,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:32" (3/3) ... [2018-11-29 00:02:32,151 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_true-unreach-call_true-termination.c [2018-11-29 00:02:32,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:02:32,254 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:02:32,255 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:02:32,258 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:02:32,258 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:02:32,258 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:02:32,258 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:02:32,258 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:02:32,259 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:02:32,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:02:32,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:32,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:32,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:32,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:32,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:32,327 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:02:32,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:02:32,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:32,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:32,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:32,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:32,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:32,342 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-11-29 00:02:32,343 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:02:32,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-11-29 00:02:32,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:32,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:32,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:32,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:32,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-11-29 00:02:32,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:32,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:32,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:32,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-11-29 00:02:32,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:32,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:32,675 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:32,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:32,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:32,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:32,677 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:32,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:32,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:32,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:32,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:02:32,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:32,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:32,704 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:02:32,732 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:02:32,767 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:02:32,775 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:02:32,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:33,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:33,028 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:02:33,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:33,041 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:02:33,060 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:33,061 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:02:33,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:33,096 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:02:33,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:33,104 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:02:33,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:33,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:33,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:33,140 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:02:33,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:33,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:33,164 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:33,164 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:02:33,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:33,185 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:02:33,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:33,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:33,256 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:33,258 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:33,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:33,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:33,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:33,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:33,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:33,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:33,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:33,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:02:33,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:33,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:33,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:33,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:02:33,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:33,282 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:02:33,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:33,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:33,447 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:33,449 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:02:33,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:33,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:33,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:33,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:33,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:33,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:33,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:33,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:33,464 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:02:33,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:33,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:33,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:33,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:33,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:33,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:33,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:33,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:33,475 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:02:33,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:33,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:33,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:33,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:33,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:33,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:33,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:33,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:33,482 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:02:33,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:33,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:33,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:33,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:33,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:33,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:33,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:33,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:33,486 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:02:33,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:33,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:33,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:33,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:33,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:33,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:33,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:33,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:33,501 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:33,501 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:33,503 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:33,504 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:33,504 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:33,504 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:02:33,506 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:33,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:33,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:33,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:34,030 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:02:34,045 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:02:34,047 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-29 00:02:34,340 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:02:34,341 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:02:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:02:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-29 00:02:34,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:02:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:02:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:02:34,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:34,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-29 00:02:34,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:34,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-11-29 00:02:34,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:02:34,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:02:34,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-29 00:02:34,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:34,369 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:02:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-29 00:02:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-29 00:02:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-29 00:02:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-29 00:02:34,399 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:02:34,399 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:02:34,400 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:02:34,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-29 00:02:34,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:34,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:34,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:34,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:34,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:34,403 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 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:02:34,403 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:02:34,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-11-29 00:02:34,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:34,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:34,584 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:02:34,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:34,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:02:34,589 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:34,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-11-29 00:02:34,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:34,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:34,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:34,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:34,889 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-29 00:02:35,032 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:02:35,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:35,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:02:35,033 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:02:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:02:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:02:35,039 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-29 00:02:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:35,228 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-29 00:02:35,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:02:35,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-29 00:02:35,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:35,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-29 00:02:35,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:02:35,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:02:35,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-29 00:02:35,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:35,236 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:02:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-29 00:02:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:02:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:02:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-29 00:02:35,241 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:02:35,241 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:02:35,242 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:02:35,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-29 00:02:35,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:35,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:35,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:35,244 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:35,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:35,245 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 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:02:35,245 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:02:35,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-11-29 00:02:35,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:35,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:35,346 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:02:35,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:35,347 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:02:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:35,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:35,375 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:02:35,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:35,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-29 00:02:35,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:35,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:35,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-11-29 00:02:35,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:35,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:35,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:35,569 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:35,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:35,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:35,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:35,571 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:35,571 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:35,571 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:35,571 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:35,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:02:35,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:35,572 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:35,573 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:02:35,632 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:02:35,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:02:35,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:02:35,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:35,734 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:02:35,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:35,738 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:02:35,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:35,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:36,468 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:36,471 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:36,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:36,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:36,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:36,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:36,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:36,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:36,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:36,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:02:36,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:36,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:36,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:36,480 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:02:36,524 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:02:36,526 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:02:36,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:36,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:36,633 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:02:36,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:36,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:36,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:36,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:36,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:36,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:36,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:36,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:36,639 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:02:36,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:36,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:36,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:36,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:36,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:36,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:36,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:36,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:36,662 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:36,662 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:36,662 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:36,664 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:36,665 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:36,665 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:36,665 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:36,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:36,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:36,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:36,878 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:02:36,879 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:02:36,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-29 00:02:37,182 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:02:37,184 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:02:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:02:37,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-29 00:02:37,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:37,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-29 00:02:37,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:37,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-29 00:02:37,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:37,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-29 00:02:37,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:02:37,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-29 00:02:37,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-29 00:02:37,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:02:37,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-29 00:02:37,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:37,206 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-29 00:02:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-29 00:02:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-29 00:02:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:02:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-29 00:02:37,225 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-29 00:02:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:02:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:02:37,225 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-29 00:02:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:37,362 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-29 00:02:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:02:37,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-29 00:02:37,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:02:37,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-29 00:02:37,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:02:37,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:02:37,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-29 00:02:37,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:37,375 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-29 00:02:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-29 00:02:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-29 00:02:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:02:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-29 00:02:37,390 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:02:37,390 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:02:37,390 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:02:37,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-29 00:02:37,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:02:37,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:37,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:37,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:37,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:37,395 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 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~ret1;havoc #t~ret0; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:02:37,395 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:02:37,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-11-29 00:02:37,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:37,521 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:02:37,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:37,521 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:02:37,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:37,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:37,558 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:02:37,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:02:37,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:37,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-11-29 00:02:37,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:37,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:37,756 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:37,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:37,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:37,757 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:37,757 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:37,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:37,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:37,758 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:37,758 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:02:37,758 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:37,758 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:37,759 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:02:37,784 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:02:37,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:37,790 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:02:37,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:37,838 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:02:37,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:37,842 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:02:37,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:37,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:38,561 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:38,564 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:38,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:38,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:38,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:38,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:38,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:38,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:38,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:38,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:02:38,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:38,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:38,567 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:02:38,570 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:02:38,575 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:02:38,579 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:02:38,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:38,657 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:38,659 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:02:38,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:38,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:38,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:38,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:38,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:38,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:38,663 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:02:38,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:38,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:38,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:38,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:38,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:38,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:38,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:38,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:38,667 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:02:38,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:38,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:38,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:38,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:38,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:38,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:38,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:38,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:38,672 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:02:38,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:38,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:38,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:38,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:38,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:38,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:38,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:38,680 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:38,683 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:38,684 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:38,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:38,684 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:38,685 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:38,685 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:38,686 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:38,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:38,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:38,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:38,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:02:38,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:02:39,229 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:02:39,230 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:02:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:02:39,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:02:39,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:39,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:39,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:39,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:39,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:39,534 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:02:39,535 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:02:39,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:02:39,873 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:02:39,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-29 00:02:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:02:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:39,882 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:39,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:39,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,240 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:02:40,240 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:02:40,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:02:40,855 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:02:40,859 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:02:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-29 00:02:40,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:02:40,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-29 00:02:40,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-29 00:02:40,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-29 00:02:40,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:02:40,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-29 00:02:40,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-29 00:02:40,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-29 00:02:40,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-29 00:02:40,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:40,931 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-29 00:02:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-29 00:02:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-29 00:02:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-29 00:02:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-29 00:02:41,022 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-29 00:02:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:02:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:02:41,023 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-29 00:02:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:41,703 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-11-29 00:02:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:02:41,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-11-29 00:02:41,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:02:41,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-11-29 00:02:41,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-29 00:02:41,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-29 00:02:41,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-11-29 00:02:41,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:41,731 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-11-29 00:02:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-11-29 00:02:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-11-29 00:02:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-29 00:02:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-11-29 00:02:41,778 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:02:41,778 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:02:41,778 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:02:41,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-11-29 00:02:41,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:02:41,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:41,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:41,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:41,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:41,790 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 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:02:41,790 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:02:41,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-11-29 00:02:41,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,947 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:02:41,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:41,948 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:02:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,094 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:02:42,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:42,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-29 00:02:42,116 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:42,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:42,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-11-29 00:02:42,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:42,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:42,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:42,166 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:42,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:42,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:42,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:42,167 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:42,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:42,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:42,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:02:42,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:42,168 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:42,169 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:02:42,172 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:02:42,178 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:02:42,180 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:02:42,182 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:02:42,216 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:42,216 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:02:42,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:42,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:42,225 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:02:42,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,246 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:02:42,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:42,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:42,292 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:42,298 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:42,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:42,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:42,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:42,298 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:42,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:42,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:42,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:02:42,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:42,299 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:42,300 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:02:42,340 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:02:42,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,346 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:02:42,348 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:02:42,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:42,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:42,423 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:02:42,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:42,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:42,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:42,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:42,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:42,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:42,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:42,435 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:42,437 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:42,441 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:42,441 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:42,441 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:42,441 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:42,442 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:02:42,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:42,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:42,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:42,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,603 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:02:42,603 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:02:42,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:02:42,729 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:02:42,732 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:02:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:02:42,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:02:42,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:42,734 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:42,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:42,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:42,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,910 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:02:42,911 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:02:42,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:02:43,059 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:02:43,060 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:02:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:02:43,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:02:43,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:43,062 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:43,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:43,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:43,286 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:02:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:43,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:43,335 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:02:43,335 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:02:43,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:02:43,631 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:02:43,632 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:02:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-29 00:02:43,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:02:43,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:43,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-29 00:02:43,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:43,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-29 00:02:43,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:43,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-11-29 00:02:43,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:02:43,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-11-29 00:02:43,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-29 00:02:43,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-29 00:02:43,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-11-29 00:02:43,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:43,655 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-11-29 00:02:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-11-29 00:02:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-11-29 00:02:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-29 00:02:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-11-29 00:02:43,679 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-11-29 00:02:43,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-29 00:02:43,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-29 00:02:43,680 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-11-29 00:02:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:44,567 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-11-29 00:02:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-29 00:02:44,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-11-29 00:02:44,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:44,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-11-29 00:02:44,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-29 00:02:44,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-29 00:02:44,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-11-29 00:02:44,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:44,583 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-11-29 00:02:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-11-29 00:02:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-11-29 00:02:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:02:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:02:44,596 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:02:44,596 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:02:44,596 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:02:44,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-11-29 00:02:44,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:44,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:44,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:44,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:44,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:44,606 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 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~ret1;havoc #t~ret0; 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:02:44,606 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:02:44,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:44,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-11-29 00:02:44,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:44,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:44,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,867 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:02:44,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:44,868 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:02:44,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:02:44,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:02:44,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:44,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:45,068 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:02:45,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-29 00:02:45,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:45,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-11-29 00:02:45,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:45,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:45,172 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:45,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:45,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:45,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:45,173 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:45,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:45,174 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:45,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:45,174 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:02:45,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:45,174 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:45,175 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:02:45,198 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:02:45,238 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:02:45,240 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:02:45,282 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:45,282 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:02:45,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:45,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:45,289 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:45,289 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:02:45,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:45,311 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:02:45,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:45,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:53,218 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:53,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:53,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:53,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:53,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:53,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:53,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:53,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:53,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:53,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:02:53,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:53,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:53,224 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:02:53,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:02:53,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:02:53,250 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:02:53,301 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:53,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:53,302 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:02:53,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:53,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:53,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:53,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:53,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:53,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:53,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:53,314 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:53,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:53,317 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:53,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:53,318 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:53,318 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:53,318 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:53,321 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:53,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:53,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:53,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:53,549 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:02:53,550 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:02:53,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:02:53,650 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:02:53,664 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:02:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:02:53,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:02:53,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:53,668 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:53,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:54,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:54,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:54,222 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:02:54,222 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:02:54,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:02:54,344 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:02:54,345 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:02:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:02:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:02:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:54,347 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:54,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:54,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:54,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:54,530 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:02:54,530 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:02:54,530 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:02:54,748 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:02:54,749 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:02:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:54,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:02:54,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:54,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-11-29 00:02:54,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:54,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-11-29 00:02:54,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:54,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-11-29 00:02:54,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:54,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-11-29 00:02:54,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-29 00:02:54,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-29 00:02:54,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-11-29 00:02:54,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:54,762 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-11-29 00:02:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-11-29 00:02:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-29 00:02:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:02:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:02:54,773 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:02:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:02:54,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:02:54,775 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-11-29 00:02:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:55,402 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-11-29 00:02:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:02:55,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-11-29 00:02:55,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:55,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-11-29 00:02:55,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-29 00:02:55,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-29 00:02:55,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-11-29 00:02:55,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:55,414 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-11-29 00:02:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-11-29 00:02:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-11-29 00:02:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-29 00:02:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-29 00:02:55,429 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-29 00:02:55,429 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-29 00:02:55,429 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:02:55,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-11-29 00:02:55,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:55,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:55,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:55,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-29 00:02:55,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:55,437 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-11-29 00:02:55,437 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-11-29 00:02:55,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2018-11-29 00:02:55,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:55,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:55,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:55,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-29 00:02:55,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:55,628 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:02:55,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:02:55,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-29 00:02:55,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:55,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-29 00:02:55,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:55,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-29 00:02:55,688 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:55,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-11-29 00:02:55,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:55,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:55,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:55,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:55,749 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:55,749 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:55,749 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:55,749 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:55,750 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:55,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:55,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:55,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:55,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:02:55,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:55,751 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:55,752 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:02:55,755 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:02:55,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:55,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:55,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:55,828 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:02:55,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:55,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:55,839 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:55,839 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:02:55,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:55,861 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:02:55,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:55,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:56,985 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:56,988 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:56,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:56,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:56,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:56,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:56,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:56,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:56,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:56,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:02:56,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:56,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:56,990 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:02:56,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:02:57,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:02:57,003 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:02:57,061 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:57,061 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:57,062 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:02:57,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:57,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:57,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:57,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:57,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:57,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:57,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:57,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:57,065 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:02:57,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:57,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:57,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:57,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:57,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:57,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:57,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:57,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:57,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:57,071 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:57,072 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:57,072 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:57,072 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:57,072 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:57,073 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:57,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:57,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:57,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:57,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:02:57,286 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:02:57,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-29 00:02:57,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-11-29 00:02:57,364 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:02:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:02:57,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:02:57,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:57,365 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:57,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:57,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:57,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:57,627 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:02:57,628 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:02:57,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-29 00:02:57,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-11-29 00:02:57,744 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:02:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:02:57,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:02:57,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:57,748 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:57,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:57,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:58,040 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:02:58,041 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:02:58,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-29 00:02:58,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-11-29 00:02:58,129 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:02:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:58,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:02:58,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:58,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-11-29 00:02:58,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:58,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:02:58,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:58,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-11-29 00:02:58,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:58,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-11-29 00:02:58,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-29 00:02:58,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-29 00:02:58,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-11-29 00:02:58,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:58,149 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-11-29 00:02:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-11-29 00:02:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-11-29 00:02:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-29 00:02:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-29 00:02:58,163 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-29 00:02:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-29 00:02:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-29 00:02:58,163 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2018-11-29 00:02:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:58,438 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2018-11-29 00:02:58,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-29 00:02:58,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2018-11-29 00:02:58,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:58,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2018-11-29 00:02:58,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2018-11-29 00:02:58,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-11-29 00:02:58,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2018-11-29 00:02:58,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:58,456 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2018-11-29 00:02:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2018-11-29 00:02:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2018-11-29 00:02:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-29 00:02:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-11-29 00:02:58,475 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:02:58,475 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:02:58,475 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:02:58,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2018-11-29 00:02:58,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:58,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:58,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:58,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2018-11-29 00:02:58,485 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:58,485 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-11-29 00:02:58,485 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-11-29 00:02:58,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2018-11-29 00:02:58,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:58,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:58,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-29 00:02:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:58,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:58,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-29 00:02:58,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-29 00:02:58,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:58,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-29 00:02:58,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:58,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2018-11-29 00:02:58,976 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:58,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2018-11-29 00:02:58,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:58,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:58,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:58,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:59,047 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:59,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:59,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:59,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:59,048 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:59,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:59,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:59,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:59,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:02:59,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:59,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:59,051 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:02:59,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:02:59,056 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:02:59,067 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:02:59,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:59,156 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:59,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:59,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:59,168 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:59,168 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:59,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:59,192 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:59,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:59,212 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:59,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:59,235 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:59,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:59,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:00,241 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:00,244 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:00,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:00,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:00,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:00,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:00,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:00,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:00,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:00,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:03:00,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:00,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:00,247 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:00,251 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:00,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:00,254 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:00,461 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:03:00,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:00,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:00,463 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:00,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:00,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:00,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:00,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:00,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:00,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:00,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:00,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:00,473 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:00,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:00,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:00,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:00,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:00,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:00,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:00,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:00,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:00,475 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:00,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:00,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:00,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:00,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:00,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:00,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:00,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:00,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:00,484 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:00,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:00,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:00,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:00,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:00,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:00,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:00,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:00,494 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:00,499 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:00,499 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:00,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:00,500 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:00,500 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:00,500 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:00,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:00,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,801 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:00,802 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:00,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-29 00:03:00,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2018-11-29 00:03:00,883 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:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:00,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-29 00:03:00,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:00,885 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:01,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:01,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:01,484 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:01,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-29 00:03:01,572 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2018-11-29 00:03:01,573 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:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-29 00:03:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,574 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:01,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:01,766 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:01,767 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:01,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-29 00:03:01,931 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2018-11-29 00:03:01,932 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:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:01,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-29 00:03:01,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2018-11-29 00:03:01,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2018-11-29 00:03:01,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2018-11-29 00:03:01,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:01,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2018-11-29 00:03:01,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-29 00:03:01,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2018-11-29 00:03:01,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2018-11-29 00:03:01,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:01,946 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:03:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2018-11-29 00:03:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-11-29 00:03:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-29 00:03:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-11-29 00:03:01,957 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:03:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-29 00:03:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-11-29 00:03:01,957 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2018-11-29 00:03:02,351 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:03,376 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2018-11-29 00:03:03,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-29 00:03:03,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2018-11-29 00:03:03,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:03,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2018-11-29 00:03:03,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-29 00:03:03,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2018-11-29 00:03:03,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2018-11-29 00:03:03,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:03,397 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2018-11-29 00:03:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2018-11-29 00:03:03,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2018-11-29 00:03:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-29 00:03:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-11-29 00:03:03,418 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-29 00:03:03,418 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-29 00:03:03,418 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:03:03,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2018-11-29 00:03:03,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:03,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:03,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:03,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 21, 16, 15, 15, 8, 8, 7, 7, 5, 3, 1, 1] [2018-11-29 00:03:03,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:03,429 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14934#fiboENTRY ~n := #in~n; 15105#L6 assume !(~n < 1); 15101#L8 assume !(1 == ~n); 15086#L11 call #t~ret0 := fibo(~n - 1);< 15091#fiboENTRY ~n := #in~n; 15089#L6 assume !(~n < 1); 15088#L8 assume !(1 == ~n); 15074#L11 call #t~ret0 := fibo(~n - 1);< 15084#fiboENTRY ~n := #in~n; 15082#L6 assume !(~n < 1); 15078#L8 assume !(1 == ~n); 15069#L11 call #t~ret0 := fibo(~n - 1);< 15073#fiboENTRY ~n := #in~n; 15071#L6 assume !(~n < 1); 15070#L8 assume !(1 == ~n); 14977#L11 call #t~ret0 := fibo(~n - 1);< 15002#fiboENTRY ~n := #in~n; 14997#L6 assume !(~n < 1); 14994#L8 assume !(1 == ~n); 14955#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14983#L6 assume !(~n < 1); 15241#L8 assume 1 == ~n;#res := 1; 15240#fiboFINAL assume true; 15237#fiboEXIT >#32#return; 15233#L11-1 call #t~ret1 := fibo(~n - 2);< 15234#fiboENTRY ~n := #in~n; 15239#L6 assume ~n < 1;#res := 0; 15236#fiboFINAL assume true; 15232#fiboEXIT >#34#return; 15230#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15228#fiboFINAL assume true; 15226#fiboEXIT >#32#return; 15059#L11-1 call #t~ret1 := fibo(~n - 2);< 15061#fiboENTRY ~n := #in~n; 15200#L6 assume !(~n < 1); 15068#L8 assume 1 == ~n;#res := 1; 14947#fiboFINAL assume true; 15058#fiboEXIT >#34#return; 15043#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15042#fiboFINAL assume true; 15027#fiboEXIT >#32#return; 15006#L11-1 call #t~ret1 := fibo(~n - 2);< 15008#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15067#L8 assume !(1 == ~n); 15036#L11 call #t~ret0 := fibo(~n - 1);< 15220#fiboENTRY ~n := #in~n; 15219#L6 assume !(~n < 1); 15054#L8 assume 1 == ~n;#res := 1; 15050#fiboFINAL assume true; 15034#fiboEXIT >#32#return; 14903#L11-1 call #t~ret1 := fibo(~n - 2);< 14900#fiboENTRY ~n := #in~n; 14905#L6 assume ~n < 1;#res := 0; 15033#fiboFINAL assume true; 15013#fiboEXIT >#34#return; 15012#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15010#fiboFINAL assume true; 15005#fiboEXIT >#34#return; 14998#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14974#fiboFINAL assume true; 14966#fiboEXIT >#32#return; 14946#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14945#L8 assume !(1 == ~n); 14948#L11 call #t~ret0 := fibo(~n - 1);< 15216#fiboENTRY ~n := #in~n; 15215#L6 assume !(~n < 1); 15212#L8 assume !(1 == ~n); 15194#L11 call #t~ret0 := fibo(~n - 1);< 15198#fiboENTRY ~n := #in~n; 15165#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15197#fiboFINAL assume true; 15193#fiboEXIT >#32#return; 15186#L11-1 call #t~ret1 := fibo(~n - 2);< 15192#fiboENTRY ~n := #in~n; 15196#L6 assume ~n < 1;#res := 0; 15150#fiboFINAL assume true; 15184#fiboEXIT >#34#return; 15189#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15225#fiboFINAL assume true; 15224#fiboEXIT >#32#return; 15057#L11-1 call #t~ret1 := fibo(~n - 2);< 15060#fiboENTRY ~n := #in~n; 15175#L6 assume !(~n < 1); 15063#L8 assume 1 == ~n;#res := 1; 15052#fiboFINAL assume true; 15056#fiboEXIT >#34#return; 15043#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15042#fiboFINAL assume true; 15027#fiboEXIT >#34#return; 14968#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15177#fiboFINAL assume true; 15028#fiboEXIT >#32#return; 14961#L11-1 call #t~ret1 := fibo(~n - 2);< 14978#fiboENTRY ~n := #in~n; 15151#L6 assume !(~n < 1); 14995#L8 assume !(1 == ~n); 14996#L11 call #t~ret0 := fibo(~n - 1);< 15039#fiboENTRY ~n := #in~n; 15221#L6 assume !(~n < 1); 15288#L8 assume !(1 == ~n); 14893#L11 call #t~ret0 := fibo(~n - 1);< 15249#fiboENTRY ~n := #in~n; 15261#L6 assume !(~n < 1); 15256#L8 assume !(1 == ~n); 14890#L11 [2018-11-29 00:03:03,430 INFO L796 eck$LassoCheckResult]: Loop: 14890#L11 call #t~ret0 := fibo(~n - 1);< 15249#fiboENTRY ~n := #in~n; 15261#L6 assume !(~n < 1); 15256#L8 assume !(1 == ~n); 14890#L11 [2018-11-29 00:03:03,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash -235209217, now seen corresponding path program 5 times [2018-11-29 00:03:03,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:03,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:03,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:03,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:03,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 346 proven. 454 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-11-29 00:03:03,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:03,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:04,019 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-29 00:03:04,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-29 00:03:04,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:04,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 346 proven. 478 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-29 00:03:04,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:04,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2018-11-29 00:03:04,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:04,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2018-11-29 00:03:04,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:04,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:04,355 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:04,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:04,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:04,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:04,356 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:04,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:04,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:04,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:04,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-29 00:03:04,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:04,357 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:04,359 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:04,373 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:04,375 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:04,377 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:04,440 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:04,440 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:04,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:04,445 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:04,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:04,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,906 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:11,908 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:11,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:11,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:11,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:11,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:11,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:11,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:11,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-29 00:03:11,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:11,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:11,910 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:11,919 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:11,921 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:11,928 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:11,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:11,974 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:11,975 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:11,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:11,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:11,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:11,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:11,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:11,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:11,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:11,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:11,980 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:11,980 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:11,981 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:11,981 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:11,981 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:11,981 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:11,981 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:12,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,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:12,286 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:12,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-29 00:03:12,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2018-11-29 00:03:12,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:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-29 00:03:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:12,354 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:12,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:13,074 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,075 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:13,075 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-29 00:03:13,160 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2018-11-29 00:03:13,162 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:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:13,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-29 00:03:13,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,163 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:13,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:13,570 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:03:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,120 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:14,120 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:14,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-29 00:03:14,410 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-29 00:03:14,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2018-11-29 00:03:14,464 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:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:14,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-29 00:03:14,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:14,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 135 letters. Loop has 4 letters. [2018-11-29 00:03:14,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:14,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 8 letters. [2018-11-29 00:03:14,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:14,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2018-11-29 00:03:14,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:14,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2018-11-29 00:03:14,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2018-11-29 00:03:14,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2018-11-29 00:03:14,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2018-11-29 00:03:14,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:14,488 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2018-11-29 00:03:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2018-11-29 00:03:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2018-11-29 00:03:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-29 00:03:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-11-29 00:03:14,507 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-29 00:03:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-29 00:03:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-11-29 00:03:14,508 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 24 states. [2018-11-29 00:03:14,894 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:16,313 INFO L93 Difference]: Finished difference Result 575 states and 804 transitions. [2018-11-29 00:03:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-29 00:03:16,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 575 states and 804 transitions. [2018-11-29 00:03:16,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:16,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 575 states to 0 states and 0 transitions. [2018-11-29 00:03:16,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:16,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:16,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:16,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:16,320 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:16,320 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:16,320 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:16,320 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:03:16,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:16,321 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:16,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:16,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:16 BoogieIcfgContainer [2018-11-29 00:03:16,331 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:16,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:16,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:16,332 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:16,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:32" (3/4) ... [2018-11-29 00:03:16,339 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:16,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:16,340 INFO L168 Benchmark]: Toolchain (without parser) took 44972.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.7 MB). Free memory was 951.4 MB in the beginning and 889.5 MB in the end (delta: 61.9 MB). Peak memory consumption was 422.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:16,341 INFO L168 Benchmark]: CDTParser took 0.21 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:16,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:16,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.61 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:16,342 INFO L168 Benchmark]: Boogie Preprocessor took 26.27 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:16,343 INFO L168 Benchmark]: RCFGBuilder took 381.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:16,343 INFO L168 Benchmark]: BuchiAutomizer took 44192.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 214.4 MB). Free memory was 1.1 GB in the beginning and 889.5 MB in the end (delta: 240.9 MB). Peak memory consumption was 455.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:16,345 INFO L168 Benchmark]: Witness Printer took 7.11 ms. Allocated memory is still 1.4 GB. Free memory is still 889.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:16,350 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.21 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 321.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.61 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 26.27 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 381.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44192.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 214.4 MB). Free memory was 1.1 GB in the beginning and 889.5 MB in the end (delta: 240.9 MB). Peak memory consumption was 455.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.11 ms. Allocated memory is still 1.4 GB. Free memory is still 889.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.1s and 10 iterations. TraceHistogramMax:24. Analysis of lassos took 26.1s. Construction of modules took 4.7s. Büchi inclusion checks took 12.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 338 SDtfs, 934 SDslu, 469 SDs, 0 SdLazy, 1848 SolverSat, 717 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 19.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...