./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:34:19,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:34:19,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:34:19,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:34:19,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:34:19,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:34:19,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:34:19,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:34:19,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:34:19,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:34:19,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:34:19,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:34:19,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:34:19,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:34:19,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:34:19,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:34:19,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:34:19,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:34:19,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:34:19,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:34:19,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:34:19,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:34:19,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:34:19,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:34:19,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:34:19,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:34:19,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:34:19,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:34:19,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:34:19,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:34:19,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:34:19,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:34:19,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:34:19,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:34:19,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:34:19,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:34:19,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:34:19,896 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:34:19,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:34:19,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:34:19,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:34:19,899 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:34:19,900 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:34:19,900 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:34:19,900 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:34:19,900 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:34:19,900 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:34:19,901 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:34:19,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:34:19,901 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:34:19,901 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:34:19,902 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:34:19,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:34:19,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:34:19,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:34:19,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:34:19,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:34:19,905 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:34:19,906 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:34:19,906 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:34:19,906 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:34:19,906 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:34:19,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:34:19,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:34:19,908 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:34:19,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:34:19,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:34:19,909 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:34:19,911 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:34:19,912 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2019-01-14 04:34:19,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:34:19,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:34:19,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:34:19,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:34:19,999 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:34:20,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2019-01-14 04:34:20,084 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79139f337/8dfdee98e32342c794bc868817a26fe0/FLAG0d19bc4b2 [2019-01-14 04:34:20,672 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:34:20,674 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2019-01-14 04:34:20,680 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79139f337/8dfdee98e32342c794bc868817a26fe0/FLAG0d19bc4b2 [2019-01-14 04:34:21,000 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79139f337/8dfdee98e32342c794bc868817a26fe0 [2019-01-14 04:34:21,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:34:21,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:34:21,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:21,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:34:21,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:34:21,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389c3b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21, skipping insertion in model container [2019-01-14 04:34:21,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:34:21,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:34:21,248 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:21,256 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:34:21,285 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:34:21,311 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:34:21,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21 WrapperNode [2019-01-14 04:34:21,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:34:21,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:21,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:34:21,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:34:21,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:34:21,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:34:21,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:34:21,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:34:21,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (1/1) ... [2019-01-14 04:34:21,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:34:21,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:34:21,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:34:21,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:34:21,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (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 [2019-01-14 04:34:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:34:21,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:34:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-14 04:34:21,606 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-14 04:34:21,950 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:34:21,951 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:34:21,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:21 BoogieIcfgContainer [2019-01-14 04:34:21,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:34:21,955 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:34:21,955 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:34:21,961 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:34:21,969 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:21,971 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:34:21" (1/3) ... [2019-01-14 04:34:21,973 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c10edd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:21, skipping insertion in model container [2019-01-14 04:34:21,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:21,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:34:21" (2/3) ... [2019-01-14 04:34:21,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c10edd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:34:21, skipping insertion in model container [2019-01-14 04:34:21,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:34:21,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:21" (3/3) ... [2019-01-14 04:34:21,982 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2019-01-14 04:34:22,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:34:22,094 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:34:22,095 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:34:22,096 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:34:22,096 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:34:22,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:34:22,096 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:34:22,097 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:34:22,098 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:34:22,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:22,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:22,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:22,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:22,207 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:22,207 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:22,207 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:34:22,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:34:22,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:22,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:22,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:22,211 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:34:22,211 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:22,221 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-14 04:34:22,222 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 [2019-01-14 04:34:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-14 04:34:22,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:22,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:22,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-14 04:34:22,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:22,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:22,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-14 04:34:22,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:22,636 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:22,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:22,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:22,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:22,640 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:22,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:22,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:22,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:22,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:22,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:22,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:22,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:22,966 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:22,968 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) [2019-01-14 04:34:22,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:22,987 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 [2019-01-14 04:34:23,012 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:23,013 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) [2019-01-14 04:34:23,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:23,063 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 [2019-01-14 04:34:23,081 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:23,082 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 [2019-01-14 04:34:23,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:23,120 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:23,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:23,125 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 [2019-01-14 04:34:23,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:23,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:23,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:23,156 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 [2019-01-14 04:34:23,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:23,186 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 [2019-01-14 04:34:23,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:23,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:23,322 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:23,324 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:23,325 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:23,325 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:23,325 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:23,325 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:23,326 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:23,326 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:23,326 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:23,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:34:23,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:23,327 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:23,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:23,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:23,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:23,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:23,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:23,562 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:23,568 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:23,570 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 [2019-01-14 04:34:23,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:23,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:23,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:23,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:23,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:23,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:23,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:23,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:23,586 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 [2019-01-14 04:34:23,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:23,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:23,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:23,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:23,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:23,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:23,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:23,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:23,595 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 [2019-01-14 04:34:23,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:23,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:23,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:23,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:23,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:23,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:23,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:23,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:23,603 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 [2019-01-14 04:34:23,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:23,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:23,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:23,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:23,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:23,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:23,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:23,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:23,612 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 [2019-01-14 04:34:23,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:23,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:23,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:23,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:23,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:23,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:23,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:23,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:23,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:23,632 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:23,635 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:23,635 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:23,635 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:23,636 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:23,639 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:23,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:23,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:24,238 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 [2019-01-14 04:34:24,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 04:34:24,477 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. [2019-01-14 04:34:24,480 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 [2019-01-14 04:34:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:34:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:34:24,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:34:24,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:24,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:34:24,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:24,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:34:24,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:24,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:34:24,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:24,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-14 04:34:24,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:34:24,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:34:24,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:34:24,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:24,521 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:34:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:34:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:34:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:34:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:34:24,559 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:24,560 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:34:24,560 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:34:24,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:34:24,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:24,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:24,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:24,564 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:24,564 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:24,565 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-14 04:34:24,565 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 [2019-01-14 04:34:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:24,565 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-14 04:34:24,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:24,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:24,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:24,756 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-14 04:34:24,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:24,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:24,918 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2019-01-14 04:34:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:34:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:34:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:34:25,270 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:34:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:34:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:34:25,279 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:34:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:25,514 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:34:25,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:34:25,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:34:25,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:25,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:34:25,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:34:25,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:34:25,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:34:25,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:25,532 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:34:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:34:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:34:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:34:25,545 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:25,546 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:34:25,546 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:34:25,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:34:25,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:34:25,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:25,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:25,557 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:25,557 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:25,557 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-14 04:34:25,558 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 [2019-01-14 04:34:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-14 04:34:25,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:25,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:25,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:25,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:25,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:25,658 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 [2019-01-14 04:34:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:25,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:25,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:25,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:34:25,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-14 04:34:25,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:25,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:25,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:25,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:25,931 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-14 04:34:26,010 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:26,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:26,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:26,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:26,011 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:26,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:26,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:26,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:26,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:26,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:26,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:26,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,164 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:26,165 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 [2019-01-14 04:34:26,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:26,169 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 [2019-01-14 04:34:26,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:26,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:26,914 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:26,917 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:26,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:26,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:26,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:26,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:26,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:26,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:26,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:26,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:34:26,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:26,919 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:26,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:26,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:27,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:27,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:27,105 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 [2019-01-14 04:34:27,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:27,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:27,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:27,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:27,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:27,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:27,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:27,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:27,112 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 [2019-01-14 04:34:27,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:27,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:27,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:27,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:27,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:27,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:27,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:27,123 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:27,134 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:27,135 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:27,136 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:27,136 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:27,137 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:27,137 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:27,137 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:27,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:27,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:27,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:27,380 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 [2019-01-14 04:34:27,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:34:27,710 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. [2019-01-14 04:34:27,719 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 [2019-01-14 04:34:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:27,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:34:27,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:27,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:34:27,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:27,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:34:27,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:27,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:34:27,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:27,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:34:27,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:34:27,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:27,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:34:27,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:27,745 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:34:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:34:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:34:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:34:27,766 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:34:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:34:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:34:27,767 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:34:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:27,924 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:34:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:34:27,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:34:27,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:27,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:34:27,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:34:27,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:34:27,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:34:27,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:27,938 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:34:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:34:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:34:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:34:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:34:27,955 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:27,955 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:34:27,955 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:34:27,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:34:27,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:34:27,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:27,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:27,963 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:27,963 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:27,964 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:34:27,965 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 [2019-01-14 04:34:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-14 04:34:27,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:27,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 04:34:28,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:28,100 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 [2019-01-14 04:34:28,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:28,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 04:34:28,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:28,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:34:28,172 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:28,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-14 04:34:28,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:28,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:28,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:28,441 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:28,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:28,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:28,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:28,442 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:28,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:28,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:28,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:28,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:28,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:28,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:28,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:28,547 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 [2019-01-14 04:34:28,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:28,555 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 [2019-01-14 04:34:28,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:28,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:29,290 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:29,293 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:29,293 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:29,293 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:29,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:29,293 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:29,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:29,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:29,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:29,294 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:34:29,294 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:29,294 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:29,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:29,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:29,381 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:29,382 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 [2019-01-14 04:34:29,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:29,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:29,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:29,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:29,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:29,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:29,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:29,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:29,385 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 [2019-01-14 04:34:29,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:29,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:29,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:29,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:29,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:29,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:29,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:29,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:29,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:29,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:29,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:29,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:29,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:29,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:29,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:29,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:29,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:29,393 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 [2019-01-14 04:34:29,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:29,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:29,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:29,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:29,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:29,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:29,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:29,400 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:29,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:29,404 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:29,404 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:29,405 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:29,405 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:29,405 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:29,406 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:29,647 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 [2019-01-14 04:34:29,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:29,918 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. [2019-01-14 04:34:29,919 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 [2019-01-14 04:34:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:34:29,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:29,920 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:29,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:30,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:30,092 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 [2019-01-14 04:34:30,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:30,282 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. [2019-01-14 04:34:30,283 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 [2019-01-14 04:34:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:34:30,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:30,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:30,284 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:30,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:30,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:30,730 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 [2019-01-14 04:34:30,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:34:31,450 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. [2019-01-14 04:34:31,459 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 [2019-01-14 04:34:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:34:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:34:31,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:34:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:34:31,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:31,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:34:31,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:31,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:34:31,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:31,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:34:31,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:34:31,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:34:31,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:34:31,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:31,535 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:34:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:34:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:34:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:34:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:34:31,587 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:34:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:34:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:34:31,588 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:34:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:32,225 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2019-01-14 04:34:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:34:32,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2019-01-14 04:34:32,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:34:32,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2019-01-14 04:34:32,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:34:32,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:34:32,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2019-01-14 04:34:32,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:32,265 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2019-01-14 04:34:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2019-01-14 04:34:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2019-01-14 04:34:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-14 04:34:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2019-01-14 04:34:32,349 INFO L729 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:34:32,350 INFO L609 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:34:32,350 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:34:32,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2019-01-14 04:34:32,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:32,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:32,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:32,359 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:32,360 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:32,361 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-14 04:34:32,361 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 [2019-01-14 04:34:32,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-14 04:34:32,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:32,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:32,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 04:34:32,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:32,495 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 [2019-01-14 04:34:32,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:32,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:34:32,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:32,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-14 04:34:32,736 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-14 04:34:32,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:32,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:32,828 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:32,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:32,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:32,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:32,829 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:32,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:32,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:32,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:32,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:32,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:32,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:32,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:32,880 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:32,881 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 [2019-01-14 04:34:32,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:32,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:32,889 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:32,889 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 [2019-01-14 04:34:32,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:32,913 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 [2019-01-14 04:34:32,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:32,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:32,990 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:32,994 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:32,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:32,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:32,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:32,996 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:32,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:32,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:32,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:32,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:34:32,999 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:32,999 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:33,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:33,120 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:33,121 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:33,122 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 [2019-01-14 04:34:33,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:33,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:33,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:33,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:33,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:33,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:33,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:33,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:33,129 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:33,130 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:33,130 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:33,130 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:33,130 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:33,131 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:34:33,131 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:33,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:33,290 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 [2019-01-14 04:34:33,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:34:33,514 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. [2019-01-14 04:34:33,515 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 [2019-01-14 04:34:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:33,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:33,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,519 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:33,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:33,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:33,739 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 [2019-01-14 04:34:33,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:34:33,825 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. [2019-01-14 04:34:33,827 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 [2019-01-14 04:34:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:34:33,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:33,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:33,829 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:34,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:34,115 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 [2019-01-14 04:34:34,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:34:34,428 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. [2019-01-14 04:34:34,429 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 [2019-01-14 04:34:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:34:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:34:34,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:34,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:34,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:34:34,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:34,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:34:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:34,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2019-01-14 04:34:34,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:34:34,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2019-01-14 04:34:34,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-01-14 04:34:34,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-14 04:34:34,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2019-01-14 04:34:34,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:34,456 INFO L706 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2019-01-14 04:34:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2019-01-14 04:34:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2019-01-14 04:34:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:34:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2019-01-14 04:34:34,485 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2019-01-14 04:34:34,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:34:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:34:34,489 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2019-01-14 04:34:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:35,364 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2019-01-14 04:34:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:34:35,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2019-01-14 04:34:35,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:35,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2019-01-14 04:34:35,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:34:35,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:34:35,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2019-01-14 04:34:35,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:35,377 INFO L706 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2019-01-14 04:34:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2019-01-14 04:34:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2019-01-14 04:34:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:34:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:34:35,390 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:34:35,390 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:34:35,391 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:34:35,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2019-01-14 04:34:35,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:35,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:35,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:35,398 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:35,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:35,401 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2019-01-14 04:34:35,402 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 [2019-01-14 04:34:35,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2019-01-14 04:34:35,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:35,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:35,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:35,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 04:34:35,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:35,603 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 [2019-01-14 04:34:35,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:34:35,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:34:35,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:35,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 04:34:36,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:36,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2019-01-14 04:34:36,119 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-01-14 04:34:36,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:36,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:36,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:36,197 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:36,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:36,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:36,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:36,197 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:36,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:36,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:36,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:36,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:34:36,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:36,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:36,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:36,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:36,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:36,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:36,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:36,309 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 [2019-01-14 04:34:36,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:36,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:36,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:36,320 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 [2019-01-14 04:34:36,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:36,345 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 [2019-01-14 04:34:36,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:36,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:45,083 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:45,087 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:45,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:45,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:45,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:45,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:45,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:45,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:45,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:45,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:34:45,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:45,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:45,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:45,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:45,166 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:45,167 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 [2019-01-14 04:34:45,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:45,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:45,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:45,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:45,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:45,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:45,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:45,179 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:45,183 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:45,183 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:45,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:45,184 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:45,184 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:45,184 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:45,184 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:45,385 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 [2019-01-14 04:34:45,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:34:45,467 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. [2019-01-14 04:34:45,470 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 [2019-01-14 04:34:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:45,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:34:45,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:45,471 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:45,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:46,082 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 [2019-01-14 04:34:46,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:34:46,238 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. [2019-01-14 04:34:46,239 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 [2019-01-14 04:34:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:46,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:34:46,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,240 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:46,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:46,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:46,420 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 [2019-01-14 04:34:46,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:34:46,679 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. [2019-01-14 04:34:46,680 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 [2019-01-14 04:34:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:46,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:34:46,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-14 04:34:46,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-14 04:34:46,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:46,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2019-01-14 04:34:46,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:46,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2019-01-14 04:34:46,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-14 04:34:46,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-01-14 04:34:46,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2019-01-14 04:34:46,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:46,698 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-01-14 04:34:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2019-01-14 04:34:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-01-14 04:34:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:34:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:34:46,711 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:34:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:34:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:34:46,712 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2019-01-14 04:34:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:47,271 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2019-01-14 04:34:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:34:47,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 473 transitions. [2019-01-14 04:34:47,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:47,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 315 states and 437 transitions. [2019-01-14 04:34:47,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2019-01-14 04:34:47,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:34:47,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 437 transitions. [2019-01-14 04:34:47,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:47,286 INFO L706 BuchiCegarLoop]: Abstraction has 315 states and 437 transitions. [2019-01-14 04:34:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 437 transitions. [2019-01-14 04:34:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 270. [2019-01-14 04:34:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-14 04:34:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-01-14 04:34:47,304 INFO L729 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-01-14 04:34:47,304 INFO L609 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-01-14 04:34:47,304 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:34:47,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 364 transitions. [2019-01-14 04:34:47,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:47,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:47,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:47,312 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 9, 8, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-01-14 04:34:47,312 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:47,313 INFO L794 eck$LassoCheckResult]: Stem: 8504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 8505#L25 call main_#t~ret2 := fibo(main_~x~0);< 8546#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); 8615#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8614#fiboENTRY ~n := #in~n; 8618#L6 assume !(~n < 1); 8612#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8639#L6 assume !(~n < 1); 8638#L8 assume !(1 == ~n); 8536#L11 call #t~ret0 := fibo(~n - 1);< 8631#fiboENTRY ~n := #in~n; 8650#L6 assume !(~n < 1); 8649#L8 assume !(1 == ~n); 8537#L11 call #t~ret0 := fibo(~n - 1);< 8631#fiboENTRY ~n := #in~n; 8650#L6 assume !(~n < 1); 8649#L8 assume !(1 == ~n); 8537#L11 call #t~ret0 := fibo(~n - 1);< 8631#fiboENTRY ~n := #in~n; 8651#L6 assume !(~n < 1); 8699#L8 assume 1 == ~n;#res := 1; 8684#fiboFINAL assume true; 8681#fiboEXIT >#32#return; 8535#L11-1 call #t~ret1 := fibo(~n - 2);< 8538#fiboENTRY ~n := #in~n; 8677#L6 assume ~n < 1;#res := 0; 8676#fiboFINAL assume true; 8675#fiboEXIT >#34#return; 8673#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8672#fiboFINAL assume true; 8662#fiboEXIT >#32#return; 8658#L11-1 call #t~ret1 := fibo(~n - 2);< 8659#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8666#L8 assume 1 == ~n;#res := 1; 8554#fiboFINAL assume true; 8657#fiboEXIT >#34#return; 8621#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8652#fiboFINAL assume true; 8626#fiboEXIT >#32#return; 8553#L11-1 call #t~ret1 := fibo(~n - 2);< 8628#fiboENTRY ~n := #in~n; 8559#L6 assume !(~n < 1); 8550#L8 assume !(1 == ~n); 8507#L11 call #t~ret0 := fibo(~n - 1);< 8540#fiboENTRY ~n := #in~n; 8755#L6 assume !(~n < 1); 8752#L8 assume !(1 == ~n); 8561#L11 call #t~ret0 := fibo(~n - 1);< 8565#fiboENTRY ~n := #in~n; 8586#L6 assume !(~n < 1); 8584#L8 assume !(1 == ~n); 8562#L11 [2019-01-14 04:34:47,316 INFO L796 eck$LassoCheckResult]: Loop: 8562#L11 call #t~ret0 := fibo(~n - 1);< 8565#fiboENTRY ~n := #in~n; 8586#L6 assume !(~n < 1); 8584#L8 assume !(1 == ~n); 8562#L11 [2019-01-14 04:34:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 272834295, now seen corresponding path program 3 times [2019-01-14 04:34:47,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:47,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:47,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-14 04:34:47,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:47,538 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 [2019-01-14 04:34:47,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:34:47,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 04:34:47,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:47,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-14 04:34:47,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 19 [2019-01-14 04:34:47,669 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-01-14 04:34:47,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:47,739 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:47,739 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:47,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:47,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:47,740 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:47,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:47,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:47,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:47,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:47,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:47,741 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:47,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:47,821 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:47,822 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 [2019-01-14 04:34:47,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:47,832 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:47,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:47,836 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 [2019-01-14 04:34:47,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:47,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 [2019-01-14 04:34:47,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:47,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:49,108 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:49,112 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:49,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:49,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:49,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:49,112 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:49,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:49,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:49,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:49,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:49,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:49,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:49,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:49,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:49,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:49,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:49,195 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:49,196 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:49,197 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 [2019-01-14 04:34:49,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:49,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:49,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:49,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:49,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:49,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:49,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:49,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:49,203 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 [2019-01-14 04:34:49,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:49,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:49,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:49,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:49,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:49,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:49,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:49,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:49,218 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:49,219 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:49,219 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:49,220 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:49,222 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:49,222 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:49,222 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:49,418 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 [2019-01-14 04:34:49,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2019-01-14 04:34:49,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 285 states and 380 transitions. Complement of second has 18 states. [2019-01-14 04:34:49,499 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 [2019-01-14 04:34:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:49,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:34:49,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,501 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:49,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:49,791 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 [2019-01-14 04:34:49,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2019-01-14 04:34:49,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 291 states and 386 transitions. Complement of second has 17 states. [2019-01-14 04:34:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:49,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:34:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:49,924 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:50,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:50,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:50,194 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 [2019-01-14 04:34:50,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98 Second operand 6 states. [2019-01-14 04:34:50,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 364 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 349 states and 462 transitions. Complement of second has 27 states. [2019-01-14 04:34:50,312 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 [2019-01-14 04:34:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:50,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:34:50,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:50,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:50,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:50,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 60 letters. Loop has 8 letters. [2019-01-14 04:34:50,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:50,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 462 transitions. [2019-01-14 04:34:50,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:50,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 274 states and 369 transitions. [2019-01-14 04:34:50,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2019-01-14 04:34:50,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:34:50,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 369 transitions. [2019-01-14 04:34:50,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:50,327 INFO L706 BuchiCegarLoop]: Abstraction has 274 states and 369 transitions. [2019-01-14 04:34:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 369 transitions. [2019-01-14 04:34:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2019-01-14 04:34:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-14 04:34:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-01-14 04:34:50,341 INFO L729 BuchiCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-01-14 04:34:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 04:34:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-01-14 04:34:50,342 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 19 states. [2019-01-14 04:34:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:50,837 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2019-01-14 04:34:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:34:50,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 336 transitions. [2019-01-14 04:34:50,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:50,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 0 states and 0 transitions. [2019-01-14 04:34:50,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:50,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:50,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:50,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:50,845 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:50,845 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:50,845 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:50,845 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:34:50,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:50,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:50,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:50 BoogieIcfgContainer [2019-01-14 04:34:50,862 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:50,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:50,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:50,863 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:50,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:34:21" (3/4) ... [2019-01-14 04:34:50,871 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:50,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:50,872 INFO L168 Benchmark]: Toolchain (without parser) took 29865.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -295.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,874 INFO L168 Benchmark]: CDTParser took 0.22 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. [2019-01-14 04:34:50,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.90 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.72 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:50,876 INFO L168 Benchmark]: Boogie Preprocessor took 35.73 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:50,877 INFO L168 Benchmark]: RCFGBuilder took 542.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,878 INFO L168 Benchmark]: BuchiAutomizer took 28906.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:50,880 INFO L168 Benchmark]: Witness Printer took 8.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:50,885 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.22 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 302.90 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 61.72 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.73 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 542.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28906.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Witness Printer took 8.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.7s and 8 iterations. TraceHistogramMax:12. Analysis of lassos took 17.6s. Construction of modules took 3.2s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 342 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 239 SDtfs, 640 SDslu, 300 SDs, 0 SdLazy, 1132 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 11.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...