./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_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/Fibonacci02_true-unreach-call_true-no-overflow_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 7e40a98558d0111ea95f3ee60a44cc14c7768182 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:05,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:05,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:05,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:05,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:05,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:05,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:05,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:05,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:05,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:05,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:05,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:05,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:05,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:05,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:05,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:05,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:05,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:05,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:05,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:05,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:05,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:05,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:05,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:05,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:05,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:05,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:05,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:05,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:05,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:05,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:05,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:05,206 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:05,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:05,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:05,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:05,208 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:05,242 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:05,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:05,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:05,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:05,245 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:05,246 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:05,246 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:05,246 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:05,246 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:05,246 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:05,246 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:05,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:05,249 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:05,249 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:05,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:05,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:05,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:05,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:05,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:05,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:05,252 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:05,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:05,252 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:05,252 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:05,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:05,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:05,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:05,254 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:05,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:05,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:05,254 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:05,256 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:05,257 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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2019-01-14 04:33:05,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:05,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:05,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:05,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:05,341 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:05,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:05,404 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37694f8ab/2fc0ef759b4442caad985b41df8362c2/FLAG3e0b79b41 [2019-01-14 04:33:05,822 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:05,823 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:05,828 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37694f8ab/2fc0ef759b4442caad985b41df8362c2/FLAG3e0b79b41 [2019-01-14 04:33:06,198 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37694f8ab/2fc0ef759b4442caad985b41df8362c2 [2019-01-14 04:33:06,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:06,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:06,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:06,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:06,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:06,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:06" (1/1) ... [2019-01-14 04:33:06,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:06, skipping insertion in model container [2019-01-14 04:33:06,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:06" (1/1) ... [2019-01-14 04:33:06,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:06,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:06,385 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:06,390 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:06,408 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:06,424 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:06,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:06 WrapperNode [2019-01-14 04:33:06,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:06,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:06,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:06,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:06,435 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:06" (1/1) ... [2019-01-14 04:33:06,442 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:06" (1/1) ... [2019-01-14 04:33:06,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:06,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:06,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:06,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:06,478 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:06" (1/1) ... [2019-01-14 04:33:06,479 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:06" (1/1) ... [2019-01-14 04:33:06,479 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:06" (1/1) ... [2019-01-14 04:33:06,480 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:06" (1/1) ... [2019-01-14 04:33:06,483 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:06" (1/1) ... [2019-01-14 04:33:06,486 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:06" (1/1) ... [2019-01-14 04:33:06,487 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:06" (1/1) ... [2019-01-14 04:33:06,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:06,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:06,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:06,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:06,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:06" (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:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-01-14 04:33:06,655 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-01-14 04:33:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:06,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:06,870 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:06,871 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:06,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:06 BoogieIcfgContainer [2019-01-14 04:33:06,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:06,873 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:06,873 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:06,876 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:06,877 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:06,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:06" (1/3) ... [2019-01-14 04:33:06,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5749d955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:06, skipping insertion in model container [2019-01-14 04:33:06,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:06,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:06" (2/3) ... [2019-01-14 04:33:06,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5749d955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:06, skipping insertion in model container [2019-01-14 04:33:06,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:06,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:06" (3/3) ... [2019-01-14 04:33:06,881 INFO L375 chiAutomizerObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:06,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:06,951 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:06,951 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:06,951 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:06,952 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:06,952 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:06,952 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:06,952 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:06,952 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:06,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:33:07,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:07,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:07,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:07,062 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:07,062 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:07,063 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:07,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:33:07,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:07,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:07,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:07,067 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:33:07,067 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:07,074 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6#L27true call main_#t~ret2 := fibonacci(main_~x~0);< 16#fibonacciENTRYtrue [2019-01-14 04:33:07,074 INFO L796 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2019-01-14 04:33:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2019-01-14 04:33:07,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:07,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:07,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:07,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2019-01-14 04:33:07,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:07,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:07,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:07,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:07,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2019-01-14 04:33:07,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:07,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:07,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:07,435 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:07,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:07,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:07,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:07,438 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:07,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:07,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:07,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:07,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:07,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:07,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:07,456 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:07,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:07,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:07,494 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:07,497 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:07,710 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:07,711 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:07,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:07,725 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:07,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:07,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=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:07,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:07,783 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:07,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:07,790 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=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:07,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:07,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:07,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:07,824 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=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:07,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:07,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:07,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:07,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=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:07,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:07,870 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) [2019-01-14 04:33:07,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:07,934 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:07,961 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:07,963 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:07,964 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:07,964 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:07,964 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:07,964 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:07,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:07,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:07,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:07,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:07,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:07,966 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:07,968 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:07,981 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:07,985 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:07,992 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:07,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:08,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:08,173 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:08,175 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:08,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:08,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:08,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:08,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:08,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:08,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:08,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:08,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:08,186 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:08,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:08,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:08,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:08,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:08,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:08,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:08,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:08,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:08,191 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:08,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:08,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:08,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:08,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:08,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:08,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:08,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:08,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:08,195 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:08,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:08,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:08,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:08,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:08,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:08,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:08,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:08,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:08,200 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:08,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:08,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:08,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:08,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:08,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:08,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:08,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:08,210 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:08,214 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:08,215 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:08,217 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:08,217 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:08,217 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:08,218 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2019-01-14 04:33:08,219 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:08,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:08,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:08,652 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:08,666 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:08,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-01-14 04:33:08,969 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2019-01-14 04:33:08,971 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:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:33:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:33:08,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:33:08,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:08,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:33:08,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:08,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 04:33:08,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:08,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-01-14 04:33:08,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:08,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2019-01-14 04:33:08,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:33:08,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:33:09,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 04:33:09,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:09,002 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:33:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 04:33:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-14 04:33:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:33:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 04:33:09,036 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:33:09,036 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 04:33:09,036 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:09,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 04:33:09,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:09,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:09,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:09,040 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:09,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:09,040 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 120#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 128#fibonacciENTRY ~n := #in~n; 125#L15 assume !(~n < 1); 126#L17 assume !(1 == ~n); 118#L20 call #t~ret0 := fibonacci(~n - 1);< 119#fibonacciENTRY ~n := #in~n; 122#L15 assume ~n < 1;#res := 0; 123#fibonacciFINAL assume true; 121#fibonacciEXIT >#28#return; 116#L20-1 [2019-01-14 04:33:09,041 INFO L796 eck$LassoCheckResult]: Loop: 116#L20-1 call #t~ret1 := fibonacci(~n - 2);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume !(~n < 1); 131#L17 assume !(1 == ~n); 115#L20 call #t~ret0 := fibonacci(~n - 1);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume ~n < 1;#res := 0; 130#fibonacciFINAL assume true; 132#fibonacciEXIT >#28#return; 116#L20-1 [2019-01-14 04:33:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2019-01-14 04:33:09,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:09,207 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:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:09,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:09,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:09,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:09,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2019-01-14 04:33:09,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:09,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:09,622 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:09,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:33:09,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:33:09,623 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:33:09,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:33:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:33:09,627 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 04:33:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:09,787 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-14 04:33:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:33:09,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 04:33:09,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:09,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-01-14 04:33:09,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:33:09,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:33:09,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-01-14 04:33:09,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:09,794 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-01-14 04:33:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:33:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:33:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:33:09,798 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:09,798 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:33:09,798 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:09,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:33:09,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:33:09,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:09,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:09,801 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:09,801 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:09,801 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 184#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 191#fibonacciENTRY ~n := #in~n; 188#L15 assume !(~n < 1); 189#L17 assume !(1 == ~n); 183#L20 call #t~ret0 := fibonacci(~n - 1);< 185#fibonacciENTRY ~n := #in~n; 186#L15 assume !(~n < 1); 187#L17 assume 1 == ~n;#res := 1; 192#fibonacciFINAL assume true; 199#fibonacciEXIT >#28#return; 180#L20-1 [2019-01-14 04:33:09,801 INFO L796 eck$LassoCheckResult]: Loop: 180#L20-1 call #t~ret1 := fibonacci(~n - 2);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume !(1 == ~n); 179#L20 call #t~ret0 := fibonacci(~n - 1);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume 1 == ~n;#res := 1; 196#fibonacciFINAL assume true; 197#fibonacciEXIT >#28#return; 180#L20-1 [2019-01-14 04:33:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2019-01-14 04:33:09,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:09,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:09,880 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:09,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:09,880 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:09,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:09,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:09,913 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:09,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:09,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 04:33:09,932 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 1 times [2019-01-14 04:33:09,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:09,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:10,177 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:10,177 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:10,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:10,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:10,178 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:10,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:10,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:10,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:10,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-14 04:33:10,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:10,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:10,181 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:10,183 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:10,202 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:10,205 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:10,304 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:10,304 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:10,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:10,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:10,310 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:10,310 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:10,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:10,337 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:10,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:10,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:11,159 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:11,161 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:11,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:11,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:11,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:11,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:11,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:11,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:11,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:11,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-14 04:33:11,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:11,163 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:11,164 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:11,203 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:11,205 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:11,207 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:11,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:11,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:11,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:11,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:11,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:11,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:11,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:11,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:11,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:11,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:11,327 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:11,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:11,333 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:11,334 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:11,334 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:11,334 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:11,334 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-01-14 04:33:11,338 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:11,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:11,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:11,550 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:11,551 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:11,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 04:33:11,819 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:11,822 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:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:33:11,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 04:33:11,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:11,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-14 04:33:11,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:11,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-01-14 04:33:11,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:11,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-01-14 04:33:11,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:11,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-01-14 04:33:11,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-14 04:33:11,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:33:11,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-01-14 04:33:11,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:11,842 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-01-14 04:33:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-01-14 04:33:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-01-14 04:33:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:33:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-01-14 04:33:11,859 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-01-14 04:33:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:33:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:33:11,860 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2019-01-14 04:33:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:12,004 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-01-14 04:33:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:33:12,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-01-14 04:33:12,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:12,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-01-14 04:33:12,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:33:12,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:33:12,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-01-14 04:33:12,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:12,021 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-14 04:33:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-01-14 04:33:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-01-14 04:33:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 04:33:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-14 04:33:12,034 INFO L729 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:33:12,034 INFO L609 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-14 04:33:12,034 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:12,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-01-14 04:33:12,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 04:33:12,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:12,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:12,038 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:12,038 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:12,039 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 696#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 711#fibonacciENTRY ~n := #in~n; 709#L15 assume !(~n < 1); 710#L17 assume !(1 == ~n); 695#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 715#L15 assume !(~n < 1); 754#L17 assume 1 == ~n;#res := 1; 753#fibonacciFINAL assume true; 752#fibonacciEXIT >#28#return; 728#L20-1 call #t~ret1 := fibonacci(~n - 2);< 751#fibonacciENTRY ~n := #in~n; 781#L15 assume ~n < 1;#res := 0; 780#fibonacciFINAL assume true; 777#fibonacciEXIT >#30#return; 776#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 774#fibonacciFINAL assume true; 772#fibonacciEXIT >#28#return; 692#L20-1 [2019-01-14 04:33:12,039 INFO L796 eck$LassoCheckResult]: Loop: 692#L20-1 call #t~ret1 := fibonacci(~n - 2);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume !(1 == ~n); 691#L20 call #t~ret0 := fibonacci(~n - 1);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume 1 == ~n;#res := 1; 717#fibonacciFINAL assume true; 770#fibonacciEXIT >#28#return; 692#L20-1 [2019-01-14 04:33:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2019-01-14 04:33:12,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:12,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:12,166 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:12,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:12,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:12,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:12,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:12,201 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:12,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:12,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 04:33:12,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 2 times [2019-01-14 04:33:12,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:12,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:12,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:12,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:12,442 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:12,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:12,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:12,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:12,443 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:12,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:12,444 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:12,444 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:12,444 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-14 04:33:12,444 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:12,444 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:12,446 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:12,469 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:12,472 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:12,476 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:12,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:12,523 INFO L412 LassoAnalysis]: Checking for nontermination... 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:12,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:12,529 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:12,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:12,553 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:12,934 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:12,936 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:12,936 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:12,936 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:12,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:12,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:12,937 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:12,937 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:12,937 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:12,937 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-14 04:33:12,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:12,941 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:12,942 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:12,945 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:12,950 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:12,953 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:13,016 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:13,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:13,018 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:13,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:13,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:13,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:13,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:13,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:13,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:13,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:13,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:13,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:13,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:13,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:13,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:13,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:13,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:13,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:13,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:13,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:13,046 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:13,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:13,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:13,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:13,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:13,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:13,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:13,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:13,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:13,056 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:13,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:13,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:13,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:13,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:13,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:13,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:13,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:13,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:13,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:13,075 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:13,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:13,079 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:13,080 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:13,080 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-01-14 04:33:13,083 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:13,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:13,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:13,281 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:13,281 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:13,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:13,529 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:13,539 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:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-01-14 04:33:13,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:13,540 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:13,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:13,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:13,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:13,791 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:13,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:14,081 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:14,086 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:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-01-14 04:33:14,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:14,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:14,087 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:14,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:14,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:14,418 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:14,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 5 loop predicates [2019-01-14 04:33:14,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-14 04:33:14,697 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:14,701 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:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 04:33:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-14 04:33:14,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2019-01-14 04:33:14,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:14,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2019-01-14 04:33:14,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:14,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2019-01-14 04:33:14,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:14,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2019-01-14 04:33:14,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:33:14,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2019-01-14 04:33:14,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2019-01-14 04:33:14,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-01-14 04:33:14,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2019-01-14 04:33:14,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:14,761 INFO L706 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-01-14 04:33:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2019-01-14 04:33:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2019-01-14 04:33:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-14 04:33:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2019-01-14 04:33:14,847 INFO L729 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2019-01-14 04:33:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:33:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:33:14,849 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2019-01-14 04:33:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:15,714 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2019-01-14 04:33:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:33:15,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2019-01-14 04:33:15,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 04:33:15,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2019-01-14 04:33:15,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-01-14 04:33:15,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2019-01-14 04:33:15,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2019-01-14 04:33:15,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:15,754 INFO L706 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2019-01-14 04:33:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2019-01-14 04:33:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2019-01-14 04:33:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-14 04:33:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2019-01-14 04:33:15,800 INFO L729 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:33:15,801 INFO L609 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2019-01-14 04:33:15,801 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:33:15,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2019-01-14 04:33:15,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:33:15,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:15,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:15,808 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:15,809 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:15,809 INFO L794 eck$LassoCheckResult]: Stem: 3550#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 3551#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 3552#fibonacciENTRY ~n := #in~n; 3592#L15 assume !(~n < 1); 3591#L17 assume !(1 == ~n); 3587#L20 call #t~ret0 := fibonacci(~n - 1);< 3589#fibonacciENTRY ~n := #in~n; 3590#L15 assume !(~n < 1); 3586#L17 assume !(1 == ~n); 3554#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3584#L15 assume !(~n < 1); 3588#L17 assume !(1 == ~n); 3555#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3585#L15 assume !(~n < 1); 3553#L17 assume 1 == ~n;#res := 1; 3556#fibonacciFINAL assume true; 3627#fibonacciEXIT >#28#return; 3609#L20-1 call #t~ret1 := fibonacci(~n - 2);< 3617#fibonacciENTRY ~n := #in~n; 3726#L15 assume !(~n < 1); 3657#L17 assume !(1 == ~n); 3659#L20 call #t~ret0 := fibonacci(~n - 1);< 3880#fibonacciENTRY ~n := #in~n; 3884#L15 assume !(~n < 1); 3882#L17 assume !(1 == ~n); 3579#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2019-01-14 04:33:15,809 INFO L796 eck$LassoCheckResult]: Loop: 3582#fibonacciENTRY ~n := #in~n; 3577#L15 assume !(~n < 1); 3581#L17 assume !(1 == ~n); 3578#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2019-01-14 04:33:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1149422575, now seen corresponding path program 1 times [2019-01-14 04:33:15,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:15,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:15,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:15,970 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:15,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:15,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:15,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:15,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:16,088 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:16,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:16,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-14 04:33:16,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2019-01-14 04:33:16,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:16,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:16,163 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:16,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:16,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:16,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:16,164 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:16,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:16,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:16,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-14 04:33:16,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:16,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:16,167 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:16,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:33:16,175 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:16,182 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:16,184 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:16,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:16,220 INFO L412 LassoAnalysis]: Checking for nontermination... 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:16,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,228 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:16,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,252 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:16,252 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:16,274 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:16,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:16,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:16,328 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:16,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:16,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:16,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:16,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:16,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:16,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:16,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:16,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:16,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-14 04:33:16,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:16,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:16,334 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:16,377 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:16,378 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:16,384 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:16,387 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:16,437 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:16,438 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:16,438 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:16,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:16,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:16,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:16,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:16,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:16,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:16,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:16,447 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:16,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:16,450 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:16,450 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:16,450 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:16,450 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:16,451 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2019-01-14 04:33:16,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:16,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:16,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:16,624 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:16,624 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:16,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:16,721 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:16,725 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:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:33:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:16,727 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:16,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:16,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:16,947 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:16,948 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:16,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:17,018 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:17,020 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:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:33:17,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:17,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,021 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:17,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:17,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:17,204 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:17,205 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:17,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2019-01-14 04:33:17,310 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:17,313 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:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 04:33:17,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:33:17,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:33:17,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:33:17,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:17,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2019-01-14 04:33:17,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2019-01-14 04:33:17,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2019-01-14 04:33:17,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2019-01-14 04:33:17,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-14 04:33:17,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2019-01-14 04:33:17,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:17,335 INFO L706 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2019-01-14 04:33:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2019-01-14 04:33:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2019-01-14 04:33:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-14 04:33:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2019-01-14 04:33:17,357 INFO L729 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2019-01-14 04:33:17,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:33:17,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:33:17,358 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2019-01-14 04:33:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:18,000 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2019-01-14 04:33:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 04:33:18,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2019-01-14 04:33:18,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:18,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2019-01-14 04:33:18,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:33:18,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2019-01-14 04:33:18,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2019-01-14 04:33:18,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:18,009 INFO L706 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2019-01-14 04:33:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2019-01-14 04:33:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2019-01-14 04:33:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:33:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:33:18,020 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:18,020 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:18,020 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:33:18,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2019-01-14 04:33:18,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:18,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:18,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:18,026 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:18,026 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:18,026 INFO L794 eck$LassoCheckResult]: Stem: 6312#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6313#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 6314#fibonacciENTRY ~n := #in~n; 6403#L15 assume !(~n < 1); 6402#L17 assume !(1 == ~n); 6398#L20 call #t~ret0 := fibonacci(~n - 1);< 6401#fibonacciENTRY ~n := #in~n; 6400#L15 assume !(~n < 1); 6399#L17 assume !(1 == ~n); 6393#L20 call #t~ret0 := fibonacci(~n - 1);< 6397#fibonacciENTRY ~n := #in~n; 6395#L15 assume !(~n < 1); 6396#L17 assume !(1 == ~n); 6334#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6387#L15 assume !(~n < 1); 6388#L17 assume 1 == ~n;#res := 1; 6493#fibonacciFINAL assume true; 6492#fibonacciEXIT >#28#return; 6308#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6315#fibonacciENTRY ~n := #in~n; 6307#L15 assume ~n < 1;#res := 0; 6309#fibonacciFINAL assume true; 6495#fibonacciEXIT >#30#return; 6297#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6482#fibonacciFINAL assume true; 6468#fibonacciEXIT >#28#return; 6296#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6466#fibonacciENTRY ~n := #in~n; 6485#L15 assume !(~n < 1); 6336#L17 assume !(1 == ~n); 6320#L20 call #t~ret0 := fibonacci(~n - 1);< 6303#fibonacciENTRY ~n := #in~n; 6382#L15 assume !(~n < 1); 6373#L17 assume !(1 == ~n); 6352#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2019-01-14 04:33:18,026 INFO L796 eck$LassoCheckResult]: Loop: 6354#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2019-01-14 04:33:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1438652912, now seen corresponding path program 2 times [2019-01-14 04:33:18,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:18,143 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:18,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:18,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:18,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:33:18,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:33:18,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:33:18,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:18,310 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:18,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:18,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2019-01-14 04:33:18,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2019-01-14 04:33:18,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:18,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:18,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:18,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:18,446 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:18,447 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:18,447 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:18,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:18,447 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:18,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:18,448 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:18,448 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2019-01-14 04:33:18,448 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:18,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:18,449 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:18,460 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:18,462 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:18,464 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:18,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:18,502 INFO L412 LassoAnalysis]: Checking for nontermination... 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:18,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:18,510 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:18,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:18,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:19,584 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:19,586 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:19,586 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:19,586 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:19,586 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:19,586 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:19,586 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:19,586 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:19,586 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:19,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2019-01-14 04:33:19,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:19,587 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:19,588 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:19,602 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:19,604 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:19,607 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:19,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:19,645 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:19,645 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:19,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:19,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:19,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:19,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:19,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:19,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:19,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:19,651 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:19,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:19,654 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:19,655 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:19,655 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:19,655 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:19,655 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-01-14 04:33:19,655 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:19,849 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:19,850 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:19,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:19,930 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:19,930 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:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:33:19,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:19,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:19,931 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:19,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:20,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:20,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:33:20,063 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:20,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:20,143 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:20,145 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:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:33:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:20,147 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:20,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:20,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:20,307 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:20,307 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:20,307 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 04:33:20,377 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:20,379 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:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:33:20,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-14 04:33:20,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:20,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-14 04:33:20,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:20,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-14 04:33:20,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:20,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2019-01-14 04:33:20,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:20,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2019-01-14 04:33:20,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-14 04:33:20,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-01-14 04:33:20,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2019-01-14 04:33:20,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:20,393 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-01-14 04:33:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2019-01-14 04:33:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-01-14 04:33:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:33:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2019-01-14 04:33:20,403 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2019-01-14 04:33:20,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 04:33:20,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-14 04:33:20,403 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2019-01-14 04:33:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:20,979 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2019-01-14 04:33:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:33:20,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2019-01-14 04:33:20,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:20,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2019-01-14 04:33:20,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2019-01-14 04:33:20,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:33:20,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2019-01-14 04:33:20,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:20,992 INFO L706 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2019-01-14 04:33:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2019-01-14 04:33:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2019-01-14 04:33:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-14 04:33:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-14 04:33:21,004 INFO L729 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:33:21,004 INFO L609 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:33:21,004 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:33:21,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2019-01-14 04:33:21,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:21,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:21,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:21,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-01-14 04:33:21,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:21,012 INFO L794 eck$LassoCheckResult]: Stem: 8511#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 8512#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 8513#fibonacciENTRY ~n := #in~n; 8603#L15 assume !(~n < 1); 8601#L17 assume !(1 == ~n); 8598#L20 call #t~ret0 := fibonacci(~n - 1);< 8599#fibonacciENTRY ~n := #in~n; 8615#L15 assume !(~n < 1); 8613#L17 assume !(1 == ~n); 8609#L20 call #t~ret0 := fibonacci(~n - 1);< 8612#fibonacciENTRY ~n := #in~n; 8669#L15 assume !(~n < 1); 8666#L17 assume !(1 == ~n); 8605#L20 call #t~ret0 := fibonacci(~n - 1);< 8610#fibonacciENTRY ~n := #in~n; 8630#L15 assume !(~n < 1); 8627#L17 assume !(1 == ~n); 8503#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8722#L15 assume !(~n < 1); 8772#L17 assume 1 == ~n;#res := 1; 8771#fibonacciFINAL assume true; 8769#fibonacciEXIT >#28#return; 8531#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8532#fibonacciENTRY ~n := #in~n; 8764#L15 assume ~n < 1;#res := 0; 8762#fibonacciFINAL assume true; 8760#fibonacciEXIT >#30#return; 8759#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fibonacciFINAL assume true; 8752#fibonacciEXIT >#28#return; 8747#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8749#fibonacciENTRY ~n := #in~n; 8758#L15 assume !(~n < 1); 8754#L17 assume 1 == ~n;#res := 1; 8750#fibonacciFINAL assume true; 8746#fibonacciEXIT >#30#return; 8742#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8740#fibonacciFINAL assume true; 8735#fibonacciEXIT >#28#return; 8618#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8621#fibonacciENTRY ~n := #in~n; 8757#L15 assume !(~n < 1); 8753#L17 assume !(1 == ~n); 8507#L20 call #t~ret0 := fibonacci(~n - 1);< 8501#fibonacciENTRY ~n := #in~n; 8509#L15 assume !(~n < 1); 8510#L17 assume !(1 == ~n); 8551#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2019-01-14 04:33:21,012 INFO L796 eck$LassoCheckResult]: Loop: 8552#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2019-01-14 04:33:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -570292781, now seen corresponding path program 3 times [2019-01-14 04:33:21,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:21,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:21,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 153 proven. 80 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-14 04:33:21,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:33:21,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:33:21,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:33:21,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-14 04:33:21,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:33:21,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:21,369 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:33:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:33:21,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 24 [2019-01-14 04:33:21,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:33:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2019-01-14 04:33:21,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:21,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:21,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:21,434 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:21,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:21,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:21,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:21,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:21,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:21,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:21,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:21,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2019-01-14 04:33:21,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:21,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:21,437 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:21,440 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:21,449 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:21,452 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:21,490 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:21,491 INFO L412 LassoAnalysis]: Checking for nontermination... 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:33:21,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:21,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:21,500 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:21,500 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:33:21,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:21,519 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:21,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:21,546 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:23,108 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:23,109 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:23,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:23,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:23,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:23,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:23,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:23,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:23,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2019-01-14 04:33:23,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:23,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:23,111 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:23,119 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:23,126 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:23,128 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:23,163 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:23,163 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:23,164 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:23,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:23,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:23,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:23,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:23,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:23,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:23,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:23,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:23,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:23,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:23,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:23,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:23,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:23,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:23,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:23,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:23,176 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:23,178 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:23,178 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:23,178 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:23,178 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:23,179 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:23,179 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-01-14 04:33:23,179 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:23,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:23,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:23,428 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:23,428 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:23,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:33:23,499 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:33:23,500 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:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-14 04:33:23,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:33:23,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:23,501 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:23,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:23,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:23,774 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:23,774 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:23,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:33:23,862 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:33:23,865 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:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 04:33:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:33:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:23,866 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:33:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:23,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:24,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:24,142 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:24,143 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:24,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2019-01-14 04:33:24,298 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:33:24,300 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:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:33:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 04:33:24,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2019-01-14 04:33:24,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:24,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2019-01-14 04:33:24,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:24,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2019-01-14 04:33:24,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:24,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2019-01-14 04:33:24,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 04:33:24,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2019-01-14 04:33:24,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-01-14 04:33:24,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2019-01-14 04:33:24,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2019-01-14 04:33:24,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:24,313 INFO L706 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2019-01-14 04:33:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2019-01-14 04:33:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2019-01-14 04:33:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-14 04:33:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-14 04:33:24,323 INFO L729 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-14 04:33:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 04:33:24,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-01-14 04:33:24,326 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 24 states. [2019-01-14 04:33:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:33:25,288 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2019-01-14 04:33:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 04:33:25,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 595 transitions. [2019-01-14 04:33:25,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:33:25,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 0 states and 0 transitions. [2019-01-14 04:33:25,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:33:25,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:33:25,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:33:25,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:33:25,297 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:25,297 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:25,297 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:33:25,297 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:33:25,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:33:25,298 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:33:25,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:33:25,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:33:25 BoogieIcfgContainer [2019-01-14 04:33:25,311 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:33:25,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:33:25,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:33:25,312 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:33:25,313 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:06" (3/4) ... [2019-01-14 04:33:25,317 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:33:25,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:33:25,318 INFO L168 Benchmark]: Toolchain (without parser) took 19115.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 109.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:25,320 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:25,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.98 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:25,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.55 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:25,322 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:25,322 INFO L168 Benchmark]: RCFGBuilder took 383.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:25,324 INFO L168 Benchmark]: BuchiAutomizer took 18438.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -25.3 MB). Peak memory consumption was 135.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:33:25,325 INFO L168 Benchmark]: Witness Printer took 5.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:33:25,329 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 219.98 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.55 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 383.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18438.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -25.3 MB). Peak memory consumption was 135.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.3s and 8 iterations. TraceHistogramMax:13. Analysis of lassos took 8.8s. Construction of modules took 2.9s. Büchi inclusion checks took 5.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 330 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 238 SDtfs, 740 SDslu, 328 SDs, 0 SdLazy, 1266 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...