./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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_10_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd317ac0ecdb37853dacea373914a521115465e0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:33:35,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:35,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:35,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:35,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:35,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:35,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:35,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:35,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:35,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:35,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:35,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:35,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:35,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:35,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:35,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:35,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:35,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:35,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:35,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:35,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:35,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:35,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:35,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:35,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:35,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:35,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:35,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:35,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:35,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:35,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:35,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:35,841 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:35,841 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:35,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:35,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:35,844 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:33:35,873 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:35,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:35,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:35,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:35,878 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:35,878 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:35,879 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:35,880 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:35,880 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:35,880 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:35,881 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:35,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:35,881 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:35,881 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:35,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:35,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:35,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:35,883 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:35,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:35,883 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:35,883 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:35,883 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:35,883 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:35,884 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:35,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:35,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:35,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:35,884 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:35,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:35,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:35,887 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:35,888 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:35,888 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd317ac0ecdb37853dacea373914a521115465e0 [2019-01-14 04:33:35,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:35,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:35,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:35,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:35,953 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:35,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2019-01-14 04:33:36,017 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f06e9c9/1ce991721f3648a89462f6ae9fdcd081/FLAGfcf2885b2 [2019-01-14 04:33:36,427 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:36,427 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2019-01-14 04:33:36,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f06e9c9/1ce991721f3648a89462f6ae9fdcd081/FLAGfcf2885b2 [2019-01-14 04:33:36,826 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f06e9c9/1ce991721f3648a89462f6ae9fdcd081 [2019-01-14 04:33:36,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:36,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:36,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:36,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:36,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:36,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2abdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:36, skipping insertion in model container [2019-01-14 04:33:36,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:36" (1/1) ... [2019-01-14 04:33:36,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:36,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:37,144 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:37,151 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:37,170 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:37,190 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:37,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37 WrapperNode [2019-01-14 04:33:37,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:37,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:37,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:37,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:37,205 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:33:37" (1/1) ... [2019-01-14 04:33:37,211 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:33:37" (1/1) ... [2019-01-14 04:33:37,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:37,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:37,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:37,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:37,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (1/1) ... [2019-01-14 04:33:37,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:37,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:37,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:37,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:37,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (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:33:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-14 04:33:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-14 04:33:37,600 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:37,600 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:37,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:37 BoogieIcfgContainer [2019-01-14 04:33:37,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:37,603 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:37,603 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:37,607 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:37,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:37,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:36" (1/3) ... [2019-01-14 04:33:37,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aff23f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:37, skipping insertion in model container [2019-01-14 04:33:37,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:37,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:37" (2/3) ... [2019-01-14 04:33:37,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aff23f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:37, skipping insertion in model container [2019-01-14 04:33:37,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:37,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:37" (3/3) ... [2019-01-14 04:33:37,613 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_true-unreach-call_true-termination.c [2019-01-14 04:33:37,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:37,730 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:37,730 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:37,730 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:37,731 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:37,731 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:37,731 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:37,731 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:37,731 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:37,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:33:37,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:37,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:37,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:37,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:37,799 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:37,799 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:37,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:33:37,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:37,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:37,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:37,806 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:37,807 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:37,817 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-01-14 04:33:37,817 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:33:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-01-14 04:33:37,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:37,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:37,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:37,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-01-14 04:33:37,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:37,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-01-14 04:33:37,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:37,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:37,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:38,181 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:38,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:38,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:38,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:38,183 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:38,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:38,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:38,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:38,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:33:38,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:38,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:38,208 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:33:38,223 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:33:38,250 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:33:38,274 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:33:38,286 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:33:38,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:38,467 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:33:38,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,481 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:33:38,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,501 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:33:38,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,540 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:33:38,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,552 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:33:38,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,615 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:33:38,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:38,665 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:33:38,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:38,692 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:33:38,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:38,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:38,768 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:38,771 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:38,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:38,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:38,771 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:38,771 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:38,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:38,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:38,772 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:38,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2019-01-14 04:33:38,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:38,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:38,774 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:33:38,784 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:33:38,789 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:33:38,797 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:33:38,802 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:33:38,958 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:38,964 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:38,966 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:33:38,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,977 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:33:38,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,982 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:33:38,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,987 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:33:38,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:38,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:38,992 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:33:38,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:38,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:38,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:38,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:38,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:38,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:38,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:39,002 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:39,008 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:39,008 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:39,011 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:39,011 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:39,011 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:39,012 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:33:39,014 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:39,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:39,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:39,430 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:33:39,451 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:33:39,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 04:33:39,826 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:33:39,827 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:33:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:33:39,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:33:39,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:39,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:33:39,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:39,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:33:39,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:39,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:33:39,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:39,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-01-14 04:33:39,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:33:39,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:33:39,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:33:39,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:39,855 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:33:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:33:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:33:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:33:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:33:39,886 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:33:39,887 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:33:39,887 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:39,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:33:39,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:39,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:39,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:39,890 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:39,890 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:39,891 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-01-14 04:33:39,891 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:33:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-01-14 04:33:39,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:40,048 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:33:40,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:40,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:40,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-01-14 04:33:40,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:40,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:40,470 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:33:40,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:40,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:40,471 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:33:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:33:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:33:40,476 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:33:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:40,640 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:33:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:40,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:33:40,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:40,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:33:40,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:33:40,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:33:40,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:33:40,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:40,647 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:33:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:33:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:33:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:33:40,653 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:40,653 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:40,653 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:40,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:33:40,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:40,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:40,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:40,656 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:40,656 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:40,656 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2019-01-14 04:33:40,656 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:33:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-01-14 04:33:40,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:40,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:40,759 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:33:40,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:40,760 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:33:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:40,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:40,790 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:33:40,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:40,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:33:40,811 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-01-14 04:33:40,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:40,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:40,992 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:40,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:40,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:40,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:40,993 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:40,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:40,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:40,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:33:40,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:40,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:40,995 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:33:41,005 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:33:41,022 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:33:41,032 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:33:41,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:41,129 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:33:41,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:41,132 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:33:41,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:41,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:41,814 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:41,816 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:41,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:41,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:41,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:41,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:41,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:41,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:41,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:41,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2019-01-14 04:33:41,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:41,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:41,820 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:33:41,825 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:33:41,868 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:33:41,871 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:33:41,976 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:41,977 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:41,977 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:33:41,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:41,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:41,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:41,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:41,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:41,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:41,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:41,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:41,982 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:33:41,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:41,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:41,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:41,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:41,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:41,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:41,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:41,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:42,000 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:42,000 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:42,000 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:42,001 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:42,001 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:42,001 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:33:42,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:42,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:42,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:42,214 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:33:42,214 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:33:42,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:33:42,508 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:33:42,510 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:33:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:33:42,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:33:42,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:42,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:33:42,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:42,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:33:42,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:42,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:33:42,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:42,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:33:42,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:33:42,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:33:42,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:33:42,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:42,535 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:33:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:33:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:33:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:33:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:33:42,553 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:33:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:33:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:33:42,553 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:33:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:42,700 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:33:42,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:33:42,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:33:42,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:42,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:33:42,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:33:42,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:33:42,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:33:42,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:42,715 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:33:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:33:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:33:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:33:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:33:42,729 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:33:42,729 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:33:42,729 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:42,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:33:42,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:42,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:42,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:42,735 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:42,735 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:42,735 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2019-01-14 04:33:42,735 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:33:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-01-14 04:33:42,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:42,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:42,860 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:33:42,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:42,861 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:33:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:42,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:42,897 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:33:42,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:42,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:33:42,921 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2019-01-14 04:33:42,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:42,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:43,083 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:43,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:43,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:43,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:43,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:43,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:43,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:43,085 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:43,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:33:43,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:43,085 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:43,087 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:33:43,117 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:33:43,120 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:33:43,124 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:33:43,195 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:43,195 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:33:43,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:43,200 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:33:43,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:43,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:43,884 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:43,887 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:43,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:43,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:43,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:43,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:43,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:43,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:43,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:43,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2019-01-14 04:33:43,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:43,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:43,890 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:33:43,893 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:33:43,897 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:33:43,904 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:33:43,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:43,997 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:43,999 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:33:43,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:44,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:44,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:44,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:44,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:44,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:44,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:44,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:44,005 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:33:44,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:44,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:44,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:44,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:44,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:44,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:44,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:44,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:44,013 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:33:44,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:44,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:44,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:44,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:44,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:44,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:44,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:44,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:44,025 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:33:44,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:44,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:44,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:44,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:44,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:44,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:44,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:44,039 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:44,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:44,047 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:44,048 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:44,048 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:44,048 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:44,048 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:33:44,049 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,256 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:33:44,256 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:33:44,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:44,554 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:33:44,558 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:33:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:33:44,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:44,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:44,560 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:44,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:44,811 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:33:44,811 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:33:44,811 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:45,022 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:33:45,027 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:33:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:33:45,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:45,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:45,028 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:45,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:45,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:45,392 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:33:45,393 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:33:45,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:45,991 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:33:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:33:45,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:45,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:46,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:33:46,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:46,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:33:46,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:46,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:33:46,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:33:46,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:33:46,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:33:46,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:33:46,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:33:46,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:46,042 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:33:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:33:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:33:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:33:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:33:46,089 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:33:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:33:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:33:46,091 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:33:46,426 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:33:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:46,956 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2019-01-14 04:33:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:33:46,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2019-01-14 04:33:46,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:33:46,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2019-01-14 04:33:46,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:33:46,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:33:46,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2019-01-14 04:33:46,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:46,983 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2019-01-14 04:33:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2019-01-14 04:33:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2019-01-14 04:33:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-14 04:33:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2019-01-14 04:33:47,041 INFO L729 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:33:47,041 INFO L609 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:33:47,041 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:33:47,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2019-01-14 04:33:47,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:33:47,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:47,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:47,050 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:47,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:47,052 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2019-01-14 04:33:47,053 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:33:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2019-01-14 04:33:47,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,170 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:33:47,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:47,171 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:33:47,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,346 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:33:47,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:47,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-14 04:33:47,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-01-14 04:33:47,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,470 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:47,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:47,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:47,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:47,471 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:47,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:47,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:47,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:47,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:33:47,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:47,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:47,474 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:33:47,479 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:33:47,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:33:47,488 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:33:47,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:33:47,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:47,529 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:33:47,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:47,533 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:47,536 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:47,537 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:33:47,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:47,559 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:33:47,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:47,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:47,609 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:47,612 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:47,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:47,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:47,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:47,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:47,613 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:47,613 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:47,613 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:47,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2019-01-14 04:33:47,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:47,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:47,619 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:33:47,653 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:33:47,654 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:33:47,659 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:33:47,660 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:33:47,732 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:47,732 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:47,733 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:33:47,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:47,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:47,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:47,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:47,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:47,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:47,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:47,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:47,740 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:47,741 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:47,741 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:47,741 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:47,741 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:47,742 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-01-14 04:33:47,742 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:47,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,904 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:33:47,904 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:33:47,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:48,007 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:33:48,009 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:33:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:33:48,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:48,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:48,010 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:48,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:48,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:48,212 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:33:48,212 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:33:48,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:48,315 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:33:48,317 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:33:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:33:48,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:48,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:48,319 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:48,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:48,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:48,483 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:33:48,484 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:33:48,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:48,758 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:33:48,759 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:33:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:33:48,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:33:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:33:48,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:48,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2019-01-14 04:33:48,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:33:48,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2019-01-14 04:33:48,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-01-14 04:33:48,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-14 04:33:48,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2019-01-14 04:33:48,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:48,781 INFO L706 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2019-01-14 04:33:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2019-01-14 04:33:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2019-01-14 04:33:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:33:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2019-01-14 04:33:48,806 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2019-01-14 04:33:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:33:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:33:48,807 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2019-01-14 04:33:49,096 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:33:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:49,564 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2019-01-14 04:33:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:33:49,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2019-01-14 04:33:49,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:49,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2019-01-14 04:33:49,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:33:49,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:33:49,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2019-01-14 04:33:49,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:49,598 INFO L706 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2019-01-14 04:33:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2019-01-14 04:33:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2019-01-14 04:33:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:33:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:33:49,608 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:49,608 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:49,608 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:33:49,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2019-01-14 04:33:49,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:49,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:49,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:49,612 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:49,612 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:49,612 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~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:33:49,612 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:33:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2019-01-14 04:33:49,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:49,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:49,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:49,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:49,799 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:33:49,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:49,799 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:33:49,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:33:49,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:33:49,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:33:49,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:50,011 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:33:50,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:50,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2019-01-14 04:33:50,045 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-01-14 04:33:50,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:50,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:50,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:50,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:50,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:50,120 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:50,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:50,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:50,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:50,121 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:50,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:50,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:50,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:50,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:33:50,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:50,121 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:50,123 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:33:50,154 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:33:50,185 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:33:50,186 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:33:50,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:50,230 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:33:50,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:50,236 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:50,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:50,240 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:33:50,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:50,265 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:33:50,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:50,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:58,211 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:58,215 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:58,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:58,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:58,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:58,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:58,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:58,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:58,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:58,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2019-01-14 04:33:58,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:58,216 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:58,217 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:33:58,238 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:33:58,240 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:33:58,246 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:33:58,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:58,288 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:58,288 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:33:58,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:58,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:58,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:58,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:58,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:58,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:58,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:58,297 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:58,301 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:58,301 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:58,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:58,301 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:58,302 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:58,303 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:33:58,303 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:58,528 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:33:58,528 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:33:58,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:58,591 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:33:58,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:33:58,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:58,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:58,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:58,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:59,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,124 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:33:59,124 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:33:59,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:59,242 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:33:59,243 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:33:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:33:59,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:59,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,244 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:59,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:59,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:59,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:33:59,419 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:33:59,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:59,621 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:33:59,623 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:33:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:33:59,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:59,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-14 04:33:59,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-14 04:33:59,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:59,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2019-01-14 04:33:59,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:59,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2019-01-14 04:33:59,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-14 04:33:59,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-01-14 04:33:59,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2019-01-14 04:33:59,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:59,634 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-01-14 04:33:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2019-01-14 04:33:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-01-14 04:33:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:33:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:33:59,642 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:33:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:33:59,643 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2019-01-14 04:34:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:00,312 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2019-01-14 04:34:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:34:00,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2019-01-14 04:34:00,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:00,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2019-01-14 04:34:00,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2019-01-14 04:34:00,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:34:00,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2019-01-14 04:34:00,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:00,325 INFO L706 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2019-01-14 04:34:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2019-01-14 04:34:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2019-01-14 04:34:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-14 04:34:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-14 04:34:00,336 INFO L729 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:34:00,336 INFO L609 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:34:00,336 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:34:00,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2019-01-14 04:34:00,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:00,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:00,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:00,341 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-01-14 04:34:00,341 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:00,342 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2019-01-14 04:34:00,342 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2019-01-14 04:34:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2019-01-14 04:34:00,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:00,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:00,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 04:34:00,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:00,475 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:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:34:00,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 04:34:00,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:00,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 04:34:00,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:00,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-14 04:34:00,541 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:00,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:00,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-01-14 04:34:00,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:00,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:00,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:00,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:00,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:00,613 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:00,613 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:00,613 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:00,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:00,614 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:00,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:00,614 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:00,614 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:00,614 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:00,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:00,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:00,616 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:00,620 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:00,629 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:00,631 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:00,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:00,683 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:00,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:00,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:00,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:00,696 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:00,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:00,718 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:00,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:00,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:01,789 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:01,792 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:01,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:01,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:01,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:01,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:01,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:01,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:01,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:01,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2019-01-14 04:34:01,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:01,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:01,794 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:01,799 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:01,805 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:01,809 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:01,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:01,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:01,860 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:01,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:01,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:01,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:01,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:01,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:01,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:01,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:01,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:01,865 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:01,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:01,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:01,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:01,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:01,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:01,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:01,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:01,872 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:01,875 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:01,875 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:01,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:01,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:01,876 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:01,876 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:01,877 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:01,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,062 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:02,063 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:02,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:34:02,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2019-01-14 04:34:02,138 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:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:02,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:02,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,141 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,475 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:02,476 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:02,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:34:02,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2019-01-14 04:34:02,577 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:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:02,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:02,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,579 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:02,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:02,896 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:02,897 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:02,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:34:02,981 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2019-01-14 04:34:02,983 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:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:02,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:34:02,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2019-01-14 04:34:02,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-14 04:34:02,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:02,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2019-01-14 04:34:02,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:03,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2019-01-14 04:34:03,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-01-14 04:34:03,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2019-01-14 04:34:03,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2019-01-14 04:34:03,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:03,001 INFO L706 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2019-01-14 04:34:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2019-01-14 04:34:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2019-01-14 04:34:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-14 04:34:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-14 04:34:03,015 INFO L729 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:34:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 04:34:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 04:34:03,018 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2019-01-14 04:34:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:03,362 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2019-01-14 04:34:03,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 04:34:03,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2019-01-14 04:34:03,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:03,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2019-01-14 04:34:03,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2019-01-14 04:34:03,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2019-01-14 04:34:03,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2019-01-14 04:34:03,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:03,378 INFO L706 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2019-01-14 04:34:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2019-01-14 04:34:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2019-01-14 04:34:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 04:34:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2019-01-14 04:34:03,392 INFO L729 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:03,392 INFO L609 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:03,392 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:34:03,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2019-01-14 04:34:03,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:03,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:03,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:03,398 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2019-01-14 04:34:03,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:03,398 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2019-01-14 04:34:03,398 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2019-01-14 04:34:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2019-01-14 04:34:03,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-14 04:34:03,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:03,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:03,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 04:34:03,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 04:34:03,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:03,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-01-14 04:34:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:03,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2019-01-14 04:34:03,842 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2019-01-14 04:34:03,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:03,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:03,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:03,910 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:03,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:03,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:03,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:03,910 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:03,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:03,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:03,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:03,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2019-01-14 04:34:03,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:03,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:03,912 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:03,917 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:03,918 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:03,926 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:03,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:03,999 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:04,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:04,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:04,009 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:04,009 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:04,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:04,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:04,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:04,047 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:04,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:04,074 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:04,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:04,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:05,048 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:05,051 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:05,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:05,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:05,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:05,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:05,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:05,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:05,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:05,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2019-01-14 04:34:05,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:05,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:05,053 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:05,058 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:05,059 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:05,061 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:05,294 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:34:05,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:05,296 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:05,296 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:05,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:05,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:05,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:05,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:05,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:05,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:05,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:05,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:05,304 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:05,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:05,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:05,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:05,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:05,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:05,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:05,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:05,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:05,309 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:05,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:05,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:05,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:05,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:05,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:05,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:05,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:05,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:05,315 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:05,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:05,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:05,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:05,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:05,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:05,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:05,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:05,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:05,330 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:05,330 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:05,331 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:05,331 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:05,331 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:05,331 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:05,331 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:05,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:05,575 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:05,576 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:05,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-14 04:34:05,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2019-01-14 04:34:05,654 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:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:05,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-14 04:34:05,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:05,656 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:06,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:06,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:06,214 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:06,214 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:06,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-14 04:34:06,309 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2019-01-14 04:34:06,310 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:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:06,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-14 04:34:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:06,311 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:06,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:06,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:06,527 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:06,527 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:06,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2019-01-14 04:34:06,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2019-01-14 04:34:06,684 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:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:06,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2019-01-14 04:34:06,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:06,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2019-01-14 04:34:06,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:06,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2019-01-14 04:34:06,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:06,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2019-01-14 04:34:06,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:06,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2019-01-14 04:34:06,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-01-14 04:34:06,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2019-01-14 04:34:06,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2019-01-14 04:34:06,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:06,710 INFO L706 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2019-01-14 04:34:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-01-14 04:34:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 04:34:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2019-01-14 04:34:06,725 INFO L729 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2019-01-14 04:34:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 04:34:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-01-14 04:34:06,727 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2019-01-14 04:34:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:07,940 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2019-01-14 04:34:07,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 04:34:07,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2019-01-14 04:34:07,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:07,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2019-01-14 04:34:07,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-01-14 04:34:07,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-01-14 04:34:07,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2019-01-14 04:34:07,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:07,962 INFO L706 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2019-01-14 04:34:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2019-01-14 04:34:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2019-01-14 04:34:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-14 04:34:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2019-01-14 04:34:07,981 INFO L729 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-14 04:34:07,981 INFO L609 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-14 04:34:07,981 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:34:07,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2019-01-14 04:34:07,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:07,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:07,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:07,987 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [24, 21, 16, 15, 15, 8, 8, 7, 7, 5, 3, 1, 1] [2019-01-14 04:34:07,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:07,988 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14934#fiboENTRY ~n := #in~n; 15105#L6 assume !(~n < 1); 15101#L8 assume !(1 == ~n); 15086#L11 call #t~ret0 := fibo(~n - 1);< 15091#fiboENTRY ~n := #in~n; 15089#L6 assume !(~n < 1); 15088#L8 assume !(1 == ~n); 15074#L11 call #t~ret0 := fibo(~n - 1);< 15084#fiboENTRY ~n := #in~n; 15082#L6 assume !(~n < 1); 15078#L8 assume !(1 == ~n); 15069#L11 call #t~ret0 := fibo(~n - 1);< 15073#fiboENTRY ~n := #in~n; 15071#L6 assume !(~n < 1); 15070#L8 assume !(1 == ~n); 14977#L11 call #t~ret0 := fibo(~n - 1);< 15002#fiboENTRY ~n := #in~n; 14997#L6 assume !(~n < 1); 14994#L8 assume !(1 == ~n); 14955#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14983#L6 assume !(~n < 1); 15241#L8 assume 1 == ~n;#res := 1; 15240#fiboFINAL assume true; 15237#fiboEXIT >#32#return; 15233#L11-1 call #t~ret1 := fibo(~n - 2);< 15234#fiboENTRY ~n := #in~n; 15239#L6 assume ~n < 1;#res := 0; 15236#fiboFINAL assume true; 15232#fiboEXIT >#34#return; 15230#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15228#fiboFINAL assume true; 15226#fiboEXIT >#32#return; 15059#L11-1 call #t~ret1 := fibo(~n - 2);< 15061#fiboENTRY ~n := #in~n; 15200#L6 assume !(~n < 1); 15068#L8 assume 1 == ~n;#res := 1; 14947#fiboFINAL assume true; 15058#fiboEXIT >#34#return; 15043#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15042#fiboFINAL assume true; 15027#fiboEXIT >#32#return; 15006#L11-1 call #t~ret1 := fibo(~n - 2);< 15008#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15067#L8 assume !(1 == ~n); 15036#L11 call #t~ret0 := fibo(~n - 1);< 15220#fiboENTRY ~n := #in~n; 15219#L6 assume !(~n < 1); 15054#L8 assume 1 == ~n;#res := 1; 15050#fiboFINAL assume true; 15034#fiboEXIT >#32#return; 14903#L11-1 call #t~ret1 := fibo(~n - 2);< 14900#fiboENTRY ~n := #in~n; 14905#L6 assume ~n < 1;#res := 0; 15033#fiboFINAL assume true; 15013#fiboEXIT >#34#return; 15012#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15010#fiboFINAL assume true; 15005#fiboEXIT >#34#return; 14998#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14974#fiboFINAL assume true; 14966#fiboEXIT >#32#return; 14946#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14945#L8 assume !(1 == ~n); 14948#L11 call #t~ret0 := fibo(~n - 1);< 15216#fiboENTRY ~n := #in~n; 15215#L6 assume !(~n < 1); 15212#L8 assume !(1 == ~n); 15194#L11 call #t~ret0 := fibo(~n - 1);< 15198#fiboENTRY ~n := #in~n; 15165#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15197#fiboFINAL assume true; 15193#fiboEXIT >#32#return; 15186#L11-1 call #t~ret1 := fibo(~n - 2);< 15192#fiboENTRY ~n := #in~n; 15196#L6 assume ~n < 1;#res := 0; 15150#fiboFINAL assume true; 15184#fiboEXIT >#34#return; 15189#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15225#fiboFINAL assume true; 15224#fiboEXIT >#32#return; 15057#L11-1 call #t~ret1 := fibo(~n - 2);< 15060#fiboENTRY ~n := #in~n; 15175#L6 assume !(~n < 1); 15063#L8 assume 1 == ~n;#res := 1; 15052#fiboFINAL assume true; 15056#fiboEXIT >#34#return; 15043#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15042#fiboFINAL assume true; 15027#fiboEXIT >#34#return; 14968#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15177#fiboFINAL assume true; 15028#fiboEXIT >#32#return; 14961#L11-1 call #t~ret1 := fibo(~n - 2);< 14978#fiboENTRY ~n := #in~n; 15151#L6 assume !(~n < 1); 14995#L8 assume !(1 == ~n); 14996#L11 call #t~ret0 := fibo(~n - 1);< 15039#fiboENTRY ~n := #in~n; 15221#L6 assume !(~n < 1); 15288#L8 assume !(1 == ~n); 14893#L11 call #t~ret0 := fibo(~n - 1);< 15249#fiboENTRY ~n := #in~n; 15261#L6 assume !(~n < 1); 15256#L8 assume !(1 == ~n); 14890#L11 [2019-01-14 04:34:07,988 INFO L796 eck$LassoCheckResult]: Loop: 14890#L11 call #t~ret0 := fibo(~n - 1);< 15249#fiboENTRY ~n := #in~n; 15261#L6 assume !(~n < 1); 15256#L8 assume !(1 == ~n); 14890#L11 [2019-01-14 04:34:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -235209217, now seen corresponding path program 5 times [2019-01-14 04:34:07,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:07,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:07,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 346 proven. 454 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-01-14 04:34:09,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:34:09,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:34:09,269 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 04:34:09,327 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-01-14 04:34:09,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:34:09,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 346 proven. 478 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2019-01-14 04:34:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:34:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-01-14 04:34:09,447 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:34:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2019-01-14 04:34:09,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:09,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:09,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:09,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:09,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:09,508 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:09,508 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:09,508 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:09,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:09,508 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:09,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,509 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:09,509 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:09,509 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2019-01-14 04:34:09,509 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:09,509 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:09,510 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:09,525 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:09,528 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:09,529 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:09,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:09,601 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,606 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:09,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:17,149 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:17,152 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:17,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:17,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:17,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:17,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:17,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:17,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:17,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:17,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2019-01-14 04:34:17,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:17,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:17,154 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:17,168 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:17,171 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:17,173 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:17,216 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:17,217 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:17,217 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:17,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:17,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:17,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:17,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:17,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:17,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:17,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:17,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:17,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:34:17,223 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:34:17,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:17,223 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:34:17,224 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:17,224 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-01-14 04:34:17,224 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:34:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,538 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:17,539 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:17,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-14 04:34:17,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2019-01-14 04:34:17,600 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:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:34:17,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 131 letters. Loop has 4 letters. [2019-01-14 04:34:17,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:17,601 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:17,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:18,044 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:18,045 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:18,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-14 04:34:18,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2019-01-14 04:34:18,138 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:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:34:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 131 letters. Loop has 4 letters. [2019-01-14 04:34:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:18,139 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:34:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:18,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:18,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:19,083 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:19,083 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:19,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2019-01-14 04:34:19,534 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-14 04:34:19,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2019-01-14 04:34:19,792 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:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:34:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:34:19,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2019-01-14 04:34:19,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:19,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 135 letters. Loop has 4 letters. [2019-01-14 04:34:19,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:19,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 8 letters. [2019-01-14 04:34:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:19,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2019-01-14 04:34:19,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:34:19,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2019-01-14 04:34:19,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2019-01-14 04:34:19,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-14 04:34:19,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2019-01-14 04:34:19,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:19,820 INFO L706 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2019-01-14 04:34:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2019-01-14 04:34:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2019-01-14 04:34:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-14 04:34:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2019-01-14 04:34:19,842 INFO L729 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2019-01-14 04:34:19,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 04:34:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-01-14 04:34:19,843 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 24 states. [2019-01-14 04:34:20,249 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-14 04:34:20,690 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-14 04:34:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:34:21,768 INFO L93 Difference]: Finished difference Result 575 states and 804 transitions. [2019-01-14 04:34:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 04:34:21,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 575 states and 804 transitions. [2019-01-14 04:34:21,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:21,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 575 states to 0 states and 0 transitions. [2019-01-14 04:34:21,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:21,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:21,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:21,777 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:21,778 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:21,778 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:21,778 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:34:21,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:21,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:21,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:21,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:21 BoogieIcfgContainer [2019-01-14 04:34:21,796 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:21,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:21,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:21,797 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:21,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:37" (3/4) ... [2019-01-14 04:34:21,806 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:21,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:21,807 INFO L168 Benchmark]: Toolchain (without parser) took 44974.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 951.4 MB in the beginning and 835.8 MB in the end (delta: 115.6 MB). Peak memory consumption was 457.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:21,808 INFO L168 Benchmark]: CDTParser took 0.17 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:21,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:21,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:21,813 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:21,813 INFO L168 Benchmark]: RCFGBuilder took 341.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:21,814 INFO L168 Benchmark]: BuchiAutomizer took 44193.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 835.8 MB in the end (delta: 254.6 MB). Peak memory consumption was 480.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:21,818 INFO L168 Benchmark]: Witness Printer took 9.69 ms. Allocated memory is still 1.4 GB. Free memory is still 835.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:21,824 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.17 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 355.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 341.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44193.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 835.8 MB in the end (delta: 254.6 MB). Peak memory consumption was 480.6 MB. Max. memory is 11.5 GB. * Witness Printer took 9.69 ms. Allocated memory is still 1.4 GB. Free memory is still 835.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.1s and 10 iterations. TraceHistogramMax:24. Analysis of lassos took 26.6s. Construction of modules took 4.6s. Büchi inclusion checks took 12.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 338 SDtfs, 934 SDslu, 469 SDs, 0 SdLazy, 1848 SolverSat, 717 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 19.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...