./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive/Fibonacci02.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.25-f470102 [2019-11-28 21:15:40,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:15:40,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:15:40,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:15:40,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:15:40,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:15:40,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:15:40,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:15:40,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:15:40,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:15:40,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:15:40,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:15:40,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:15:40,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:15:40,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:15:40,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:15:40,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:15:40,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:15:40,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:15:40,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:15:40,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:15:40,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:15:40,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:15:40,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:15:40,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:15:40,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:15:40,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:15:40,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:15:40,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:15:40,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:15:40,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:15:40,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:15:40,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:15:40,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:15:40,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:15:40,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:15:40,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:15:40,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:15:40,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:15:40,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:15:40,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:15:40,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:15:40,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:15:40,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:15:40,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:15:40,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:15:40,201 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:15:40,201 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:15:40,201 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:15:40,201 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:15:40,202 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:15:40,202 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:15:40,202 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:15:40,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:15:40,203 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:15:40,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:15:40,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:15:40,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:15:40,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:15:40,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:15:40,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:15:40,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:15:40,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:15:40,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:15:40,205 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:15:40,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:15:40,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:15:40,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:15:40,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:15:40,207 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:15:40,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:15:40,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:15:40,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:15:40,208 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:15:40,209 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:15:40,209 INFO L138 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-11-28 21:15:40,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:15:40,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:15:40,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:15:40,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:15:40,551 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:15:40,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 21:15:40,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9c532ae/ece165c3809147be9eed81fcaa857890/FLAG214f3c332 [2019-11-28 21:15:41,068 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:15:41,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 21:15:41,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9c532ae/ece165c3809147be9eed81fcaa857890/FLAG214f3c332 [2019-11-28 21:15:41,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9c532ae/ece165c3809147be9eed81fcaa857890 [2019-11-28 21:15:41,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:15:41,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:15:41,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:15:41,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:15:41,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:15:41,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f74f45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41, skipping insertion in model container [2019-11-28 21:15:41,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:15:41,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:15:41,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:15:41,593 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:15:41,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:15:41,624 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:15:41,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41 WrapperNode [2019-11-28 21:15:41,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:15:41,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:15:41,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:15:41,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:15:41,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:15:41,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:15:41,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:15:41,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:15:41,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (1/1) ... [2019-11-28 21:15:41,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:15:41,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:15:41,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:15:41,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:15:41,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (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-11-28 21:15:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 21:15:41,798 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 21:15:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:15:41,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:15:41,941 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:15:41,941 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 21:15:41,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:15:41 BoogieIcfgContainer [2019-11-28 21:15:41,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:15:41,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:15:41,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:15:41,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:15:41,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:15:41,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:15:41" (1/3) ... [2019-11-28 21:15:41,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b6ee61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:15:41, skipping insertion in model container [2019-11-28 21:15:41,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:15:41,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:15:41" (2/3) ... [2019-11-28 21:15:41,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b6ee61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:15:41, skipping insertion in model container [2019-11-28 21:15:41,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:15:41,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:15:41" (3/3) ... [2019-11-28 21:15:41,950 INFO L371 chiAutomizerObserver]: Analyzing ICFG Fibonacci02.c [2019-11-28 21:15:42,050 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:15:42,051 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:15:42,051 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:15:42,051 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:15:42,051 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:15:42,051 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:15:42,052 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:15:42,052 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:15:42,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 21:15:42,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:15:42,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:42,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:42,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:15:42,130 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:15:42,130 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:15:42,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 21:15:42,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:15:42,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:42,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:42,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:15:42,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:15:42,139 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-11-28 21:15:42,140 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-11-28 21:15:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2019-11-28 21:15:42,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:42,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77167810] [2019-11-28 21:15:42,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:42,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2019-11-28 21:15:42,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:42,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473123675] [2019-11-28 21:15:42,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:42,257 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2019-11-28 21:15:42,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:42,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469422863] [2019-11-28 21:15:42,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:42,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:42,388 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:42,388 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:42,389 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:42,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:42,389 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:42,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:42,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:42,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2019-11-28 21:15:42,390 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:42,390 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:42,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,541 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:42,542 INFO L404 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-11-28 21:15:42,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:42,551 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,561 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:42,562 INFO L440 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-11-28 21:15:42,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:42,568 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,572 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:42,572 INFO L440 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-11-28 21:15:42,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:42,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:42,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:42,583 INFO L440 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-11-28 21:15:42,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:42,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:42,600 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:42,600 INFO L440 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-11-28 21:15:42,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:42,619 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:42,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:42,684 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:15:42,686 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:42,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:42,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:42,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:42,687 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:15:42,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:42,690 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:42,690 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2019-11-28 21:15:42,690 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:42,691 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:42,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:42,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:42,787 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:42,794 INFO L120 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-11-28 21:15:42,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:42,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:42,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:42,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:42,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:42,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:42,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 21:15:42,826 INFO L120 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-11-28 21:15:42,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:42,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:42,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:42,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:42,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:42,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:42,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 21:15:42,849 INFO L120 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-11-28 21:15:42,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:42,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:42,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:42,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:42,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:42,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:42,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 21:15:42,872 INFO L120 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-11-28 21:15:42,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:42,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:42,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:42,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:42,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:42,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:42,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:42,889 INFO L120 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 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:42,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:42,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:42,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:42,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:42,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:42,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:42,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:42,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:15:42,903 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:15:42,903 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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-11-28 21:15:42,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:15:42,913 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:15:42,913 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:15:42,914 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2019-11-28 21:15:42,922 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:15:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:42,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:15:42,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:43,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:43,076 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-11-28 21:15:43,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-11-28 21:15:43,209 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-11-28 21:15:43,210 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-11-28 21:15:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:15:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 21:15:43,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 21:15:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:43,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 21:15:43,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:43,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-28 21:15:43,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:43,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-28 21:15:43,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:15:43,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2019-11-28 21:15:43,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 21:15:43,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:15:43,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-28 21:15:43,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:43,238 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 21:15:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-28 21:15:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-28 21:15:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 21:15:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-28 21:15:43,273 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 21:15:43,273 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 21:15:43,273 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:15:43,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-28 21:15:43,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:15:43,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:43,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:43,276 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:43,276 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:43,277 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-11-28 21:15:43,277 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-11-28 21:15:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2019-11-28 21:15:43,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:43,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271052963] [2019-11-28 21:15:43,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:43,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271052963] [2019-11-28 21:15:43,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571257417] [2019-11-28 21:15:43,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:15:43,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:43,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:43,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 21:15:43,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549333568] [2019-11-28 21:15:43,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2019-11-28 21:15:43,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:43,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209219926] [2019-11-28 21:15:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:15:43,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209219926] [2019-11-28 21:15:43,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:15:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:15:43,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988702479] [2019-11-28 21:15:43,521 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:15:43,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 21:15:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 21:15:43,526 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 21:15:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:43,620 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-28 21:15:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 21:15:43,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-28 21:15:43,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:15:43,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-28 21:15:43,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 21:15:43,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 21:15:43,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-28 21:15:43,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:43,627 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 21:15:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-28 21:15:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 21:15:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 21:15:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-28 21:15:43,632 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 21:15:43,632 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 21:15:43,632 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:15:43,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-28 21:15:43,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:15:43,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:43,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:43,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:43,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 21:15:43,635 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 219#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 228#fibonacciENTRY ~n := #in~n; 225#L15 assume !(~n < 1); 226#L17 assume !(1 == ~n); 218#L20 call #t~ret0 := fibonacci(~n - 1);< 220#fibonacciENTRY ~n := #in~n; 223#L15 assume !(~n < 1); 224#L17 assume 1 == ~n;#res := 1; 229#fibonacciFINAL assume true; 235#fibonacciEXIT >#28#return; 216#L20-1 [2019-11-28 21:15:43,636 INFO L796 eck$LassoCheckResult]: Loop: 216#L20-1 call #t~ret1 := fibonacci(~n - 2);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume !(1 == ~n); 215#L20 call #t~ret0 := fibonacci(~n - 1);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume !(1 == ~n); 215#L20 call #t~ret0 := fibonacci(~n - 1);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume 1 == ~n;#res := 1; 233#fibonacciFINAL assume true; 234#fibonacciEXIT >#28#return; 216#L20-1 call #t~ret1 := fibonacci(~n - 2);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume ~n < 1;#res := 0; 237#fibonacciFINAL assume true; 221#fibonacciEXIT >#30#return; 222#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 230#fibonacciFINAL assume true; 231#fibonacciEXIT >#28#return; 216#L20-1 [2019-11-28 21:15:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2019-11-28 21:15:43,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:43,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662209263] [2019-11-28 21:15:43,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:43,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662209263] [2019-11-28 21:15:43,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222346197] [2019-11-28 21:15:43,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:43,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:15:43,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:43,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:43,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 21:15:43,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323187304] [2019-11-28 21:15:43,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 476609746, now seen corresponding path program 1 times [2019-11-28 21:15:43,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:43,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56568795] [2019-11-28 21:15:43,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:43,768 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:44,047 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:44,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:44,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:44,048 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:44,048 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:44,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:44,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:44,049 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:44,049 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2019-11-28 21:15:44,049 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:44,049 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:44,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:44,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:44,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:44,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:44,122 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:44,123 INFO L404 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) [2019-11-28 21:15:44,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:44,142 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:44,147 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:44,147 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=1} Honda state: {fibonacci_#t~ret0=1} 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) [2019-11-28 21:15:44,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:44,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:44,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:44,174 INFO L440 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 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:44,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:44,190 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-11-28 21:15:44,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:44,203 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:45,284 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:15:45,287 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:45,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:45,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:45,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:45,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:15:45,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:45,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:45,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:45,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2019-11-28 21:15:45,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:45,289 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:45,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:45,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:45,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:45,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:45,365 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:45,366 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:45,377 INFO L120 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-11-28 21:15:45,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:45,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:45,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:45,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:45,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:45,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:45,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:45,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 21:15:45,400 INFO L120 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-11-28 21:15:45,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:45,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:45,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:45,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:45,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:45,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:45,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:45,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:15:45,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:15:45,415 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 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-11-28 21:15:45,436 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:15:45,436 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:15:45,436 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:15:45,436 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:15:45,439 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:15:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:45,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:15:45,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:45,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 21:15:45,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 21:15:45,669 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 21:15:45,669 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 21:15:45,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 134 states and 182 transitions. Complement of second has 36 states. [2019-11-28 21:15:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 21:15:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:15:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-28 21:15:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 11 letters. Loop has 22 letters. [2019-11-28 21:15:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 33 letters. Loop has 22 letters. [2019-11-28 21:15:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 11 letters. Loop has 44 letters. [2019-11-28 21:15:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:45,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-28 21:15:45,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:15:45,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-28 21:15:45,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-28 21:15:45,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 21:15:45,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-28 21:15:45,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:45,957 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-28 21:15:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-28 21:15:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-28 21:15:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 21:15:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-28 21:15:45,973 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-28 21:15:45,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 21:15:45,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 21:15:45,974 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-28 21:15:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:46,086 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-28 21:15:46,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 21:15:46,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-28 21:15:46,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:15:46,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-28 21:15:46,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-28 21:15:46,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 21:15:46,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-28 21:15:46,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:46,107 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-28 21:15:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-28 21:15:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-28 21:15:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 21:15:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-28 21:15:46,131 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 21:15:46,131 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 21:15:46,132 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:15:46,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-28 21:15:46,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:15:46,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:46,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:46,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:46,141 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-28 21:15:46,141 INFO L794 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 795#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 803#fibonacciENTRY ~n := #in~n; 844#L15 assume !(~n < 1); 843#L17 assume !(1 == ~n); 794#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 800#L15 assume !(~n < 1); 802#L17 assume !(1 == ~n); 801#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 800#L15 assume !(~n < 1); 802#L17 assume !(1 == ~n); 801#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 810#L15 assume !(~n < 1); 842#L17 assume 1 == ~n;#res := 1; 841#fibonacciFINAL assume true; 840#fibonacciEXIT >#28#return; 813#L20-1 call #t~ret1 := fibonacci(~n - 2);< 838#fibonacciENTRY ~n := #in~n; 872#L15 assume ~n < 1;#res := 0; 871#fibonacciFINAL assume true; 870#fibonacciEXIT >#30#return; 869#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 866#fibonacciFINAL assume true; 863#fibonacciEXIT >#28#return; 791#L20-1 [2019-11-28 21:15:46,141 INFO L796 eck$LassoCheckResult]: Loop: 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume 1 == ~n;#res := 1; 860#fibonacciFINAL assume true; 861#fibonacciEXIT >#28#return; 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume 1 == ~n;#res := 1; 860#fibonacciFINAL assume true; 861#fibonacciEXIT >#28#return; 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume ~n < 1;#res := 0; 846#fibonacciFINAL assume true; 868#fibonacciEXIT >#30#return; 862#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 865#fibonacciFINAL assume true; 864#fibonacciEXIT >#30#return; 862#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 865#fibonacciFINAL assume true; 864#fibonacciEXIT >#28#return; 791#L20-1 [2019-11-28 21:15:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2019-11-28 21:15:46,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:46,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236116905] [2019-11-28 21:15:46,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:46,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236116905] [2019-11-28 21:15:46,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465272216] [2019-11-28 21:15:46,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:15:46,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:46,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:46,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 21:15:46,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065418804] [2019-11-28 21:15:46,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1986955448, now seen corresponding path program 2 times [2019-11-28 21:15:46,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:46,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400843180] [2019-11-28 21:15:46,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 21:15:46,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400843180] [2019-11-28 21:15:46,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759793290] [2019-11-28 21:15:46,555 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:46,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:15:46,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:46,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:15:46,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 21:15:46,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:46,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 21:15:46,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877677255] [2019-11-28 21:15:46,671 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:15:46,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 21:15:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 21:15:46,672 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-28 21:15:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:46,917 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-11-28 21:15:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 21:15:46,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-11-28 21:15:46,923 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 21:15:46,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-11-28 21:15:46,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-28 21:15:46,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-28 21:15:46,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-11-28 21:15:46,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:46,927 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 21:15:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-11-28 21:15:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 21:15:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 21:15:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-28 21:15:46,938 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 21:15:46,938 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 21:15:46,938 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:15:46,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-11-28 21:15:46,941 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 21:15:46,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:46,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:46,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:46,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 4, 4, 4, 4, 3, 3, 2, 2] [2019-11-28 21:15:46,944 INFO L794 eck$LassoCheckResult]: Stem: 1300#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 1301#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 1308#fibonacciENTRY ~n := #in~n; 1349#L15 assume !(~n < 1); 1313#L17 assume !(1 == ~n); 1298#L20 call #t~ret0 := fibonacci(~n - 1);< 1310#fibonacciENTRY ~n := #in~n; 1306#L15 assume !(~n < 1); 1307#L17 assume !(1 == ~n); 1297#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1347#L15 assume !(~n < 1); 1345#L17 assume !(1 == ~n); 1340#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1347#L15 assume !(~n < 1); 1345#L17 assume !(1 == ~n); 1340#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1348#L15 assume !(~n < 1); 1346#L17 assume 1 == ~n;#res := 1; 1344#fibonacciFINAL assume true; 1343#fibonacciEXIT >#28#return; 1323#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1341#fibonacciENTRY ~n := #in~n; 1391#L15 assume ~n < 1;#res := 0; 1390#fibonacciFINAL assume true; 1389#fibonacciEXIT >#30#return; 1387#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1386#fibonacciFINAL assume true; 1382#fibonacciEXIT >#28#return; 1353#L20-1 [2019-11-28 21:15:46,944 INFO L796 eck$LassoCheckResult]: Loop: 1353#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume 1 == ~n;#res := 1; 1312#fibonacciFINAL assume true; 1393#fibonacciEXIT >#28#return; 1294#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1296#fibonacciENTRY ~n := #in~n; 1350#L15 assume ~n < 1;#res := 0; 1351#fibonacciFINAL assume true; 1394#fibonacciEXIT >#30#return; 1377#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1392#fibonacciFINAL assume true; 1381#fibonacciEXIT >#28#return; 1353#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume 1 == ~n;#res := 1; 1312#fibonacciFINAL assume true; 1393#fibonacciEXIT >#28#return; 1294#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1296#fibonacciENTRY ~n := #in~n; 1350#L15 assume ~n < 1;#res := 0; 1351#fibonacciFINAL assume true; 1394#fibonacciEXIT >#30#return; 1377#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1392#fibonacciFINAL assume true; 1381#fibonacciEXIT >#30#return; 1379#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1384#fibonacciFINAL assume true; 1378#fibonacciEXIT >#28#return; 1353#L20-1 [2019-11-28 21:15:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2008361138, now seen corresponding path program 2 times [2019-11-28 21:15:46,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:46,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359944759] [2019-11-28 21:15:46,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:47,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359944759] [2019-11-28 21:15:47,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181398131] [2019-11-28 21:15:47,084 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:47,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:15:47,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:47,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 21:15:47,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:47,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:47,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 21:15:47,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959989327] [2019-11-28 21:15:47,147 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1980387862, now seen corresponding path program 3 times [2019-11-28 21:15:47,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:47,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701887560] [2019-11-28 21:15:47,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-28 21:15:47,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701887560] [2019-11-28 21:15:47,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201062506] [2019-11-28 21:15:47,293 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:47,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 21:15:47,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:47,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:15:47,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 49 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 21:15:47,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:47,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2019-11-28 21:15:47,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267348804] [2019-11-28 21:15:47,382 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:15:47,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 21:15:47,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-28 21:15:47,385 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 14 states. [2019-11-28 21:15:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:47,655 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2019-11-28 21:15:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:15:47,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 171 transitions. [2019-11-28 21:15:47,659 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 21:15:47,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 125 states and 169 transitions. [2019-11-28 21:15:47,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-28 21:15:47,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-28 21:15:47,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 169 transitions. [2019-11-28 21:15:47,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:47,664 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-28 21:15:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 169 transitions. [2019-11-28 21:15:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-28 21:15:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 21:15:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2019-11-28 21:15:47,676 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-28 21:15:47,676 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-28 21:15:47,676 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:15:47,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 169 transitions. [2019-11-28 21:15:47,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 21:15:47,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:47,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:47,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:47,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 21:15:47,680 INFO L794 eck$LassoCheckResult]: Stem: 1935#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 1921#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 1936#fibonacciENTRY ~n := #in~n; 1933#L15 assume !(~n < 1); 1934#L17 assume !(1 == ~n); 1920#L20 call #t~ret0 := fibonacci(~n - 1);< 1922#fibonacciENTRY ~n := #in~n; 1940#L15 assume !(~n < 1); 1948#L17 assume !(1 == ~n); 1949#L20 call #t~ret0 := fibonacci(~n - 1);< 1990#fibonacciENTRY ~n := #in~n; 1989#L15 assume !(~n < 1); 1988#L17 assume !(1 == ~n); 1975#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1987#L15 assume !(~n < 1); 1986#L17 assume !(1 == ~n); 1976#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1987#L15 assume !(~n < 1); 1986#L17 assume !(1 == ~n); 1976#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1985#L15 assume !(~n < 1); 1984#L17 assume 1 == ~n;#res := 1; 1982#fibonacciFINAL assume true; 1980#fibonacciEXIT >#28#return; 1955#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1977#fibonacciENTRY ~n := #in~n; 2028#L15 assume ~n < 1;#res := 0; 2026#fibonacciFINAL assume true; 2025#fibonacciEXIT >#30#return; 2024#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2023#fibonacciFINAL assume true; 2017#fibonacciEXIT >#28#return; 1944#L20-1 [2019-11-28 21:15:47,680 INFO L796 eck$LassoCheckResult]: Loop: 1944#L20-1 call #t~ret1 := fibonacci(~n - 2);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume !(1 == ~n); 1945#L20 call #t~ret0 := fibonacci(~n - 1);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume !(1 == ~n); 1945#L20 call #t~ret0 := fibonacci(~n - 1);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume 1 == ~n;#res := 1; 1947#fibonacciFINAL assume true; 2012#fibonacciEXIT >#28#return; 1917#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1919#fibonacciENTRY ~n := #in~n; 2035#L15 assume ~n < 1;#res := 0; 2036#fibonacciFINAL assume true; 2030#fibonacciEXIT >#30#return; 2013#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2027#fibonacciFINAL assume true; 2018#fibonacciEXIT >#28#return; 1944#L20-1 [2019-11-28 21:15:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash 463907735, now seen corresponding path program 3 times [2019-11-28 21:15:47,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:47,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824153950] [2019-11-28 21:15:47,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824153950] [2019-11-28 21:15:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117632030] [2019-11-28 21:15:47,840 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:47,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 21:15:47,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:47,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:15:47,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:47,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:47,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-11-28 21:15:47,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249091047] [2019-11-28 21:15:47,917 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash 476609746, now seen corresponding path program 4 times [2019-11-28 21:15:47,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:47,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905503500] [2019-11-28 21:15:47,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:47,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:48,169 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:48,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:48,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:48,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:48,170 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:48,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:48,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:48,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:48,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2019-11-28 21:15:48,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:48,171 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:48,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:48,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:48,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:48,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:48,229 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:48,230 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:48,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:48,235 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:48,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:48,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:49,047 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:15:49,049 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:49,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:49,050 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:49,050 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:49,050 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:15:49,050 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:49,050 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:49,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:49,050 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2019-11-28 21:15:49,050 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:49,050 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:49,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:49,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:49,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:49,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:49,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:49,134 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:49,138 INFO L120 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-11-28 21:15:49,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:49,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:49,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:49,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:49,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:49,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:49,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:49,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:15:49,149 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:15:49,149 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:49,152 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:15:49,153 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:15:49,153 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:15:49,153 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 21:15:49,155 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:15:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:49,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:15:49,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:49,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:49,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:49,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 21:15:49,291 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 21:15:49,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 21:15:49,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-28 21:15:49,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 194 states and 261 transitions. Complement of second has 33 states. [2019-11-28 21:15:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 21:15:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:15:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-28 21:15:49,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-28 21:15:49,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:49,621 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:49,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:15:49,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:49,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:49,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:49,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 21:15:49,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 21:15:49,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 21:15:49,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-28 21:15:49,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 319 states and 430 transitions. Complement of second has 25 states. [2019-11-28 21:15:49,986 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-11-28 21:15:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:15:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-28 21:15:49,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-28 21:15:49,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:49,988 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:50,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:15:50,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:50,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 21:15:50,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 21:15:50,152 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 6 loop predicates [2019-11-28 21:15:50,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-28 21:15:50,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 1094 states and 1539 transitions. Complement of second has 130 states. [2019-11-28 21:15:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 21:15:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:15:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-28 21:15:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-28 21:15:50,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 57 letters. Loop has 22 letters. [2019-11-28 21:15:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 35 letters. Loop has 44 letters. [2019-11-28 21:15:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:50,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1094 states and 1539 transitions. [2019-11-28 21:15:50,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-28 21:15:50,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1094 states to 618 states and 954 transitions. [2019-11-28 21:15:50,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2019-11-28 21:15:50,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2019-11-28 21:15:50,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 954 transitions. [2019-11-28 21:15:50,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:50,479 INFO L688 BuchiCegarLoop]: Abstraction has 618 states and 954 transitions. [2019-11-28 21:15:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 954 transitions. [2019-11-28 21:15:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 494. [2019-11-28 21:15:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-28 21:15:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-11-28 21:15:50,546 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-28 21:15:50,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:50,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 21:15:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 21:15:50,547 INFO L87 Difference]: Start difference. First operand 494 states and 746 transitions. Second operand 16 states. [2019-11-28 21:15:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:50,859 INFO L93 Difference]: Finished difference Result 567 states and 846 transitions. [2019-11-28 21:15:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 21:15:50,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 846 transitions. [2019-11-28 21:15:50,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:50,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 561 states and 837 transitions. [2019-11-28 21:15:50,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2019-11-28 21:15:50,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2019-11-28 21:15:50,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 837 transitions. [2019-11-28 21:15:50,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:50,883 INFO L688 BuchiCegarLoop]: Abstraction has 561 states and 837 transitions. [2019-11-28 21:15:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 837 transitions. [2019-11-28 21:15:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 534. [2019-11-28 21:15:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-28 21:15:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 805 transitions. [2019-11-28 21:15:50,909 INFO L711 BuchiCegarLoop]: Abstraction has 534 states and 805 transitions. [2019-11-28 21:15:50,909 INFO L591 BuchiCegarLoop]: Abstraction has 534 states and 805 transitions. [2019-11-28 21:15:50,909 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:15:50,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 534 states and 805 transitions. [2019-11-28 21:15:50,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:50,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:50,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:50,918 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:50,919 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:15:50,919 INFO L794 eck$LassoCheckResult]: Stem: 5645#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 5646#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 5647#fibonacciENTRY ~n := #in~n; 5648#L15 assume !(~n < 1); 5711#L17 assume !(1 == ~n); 5707#L20 call #t~ret0 := fibonacci(~n - 1);< 5710#fibonacciENTRY ~n := #in~n; 5709#L15 assume !(~n < 1); 5708#L17 assume !(1 == ~n); 5703#L20 call #t~ret0 := fibonacci(~n - 1);< 5706#fibonacciENTRY ~n := #in~n; 5705#L15 assume !(~n < 1); 5704#L17 assume !(1 == ~n); 5699#L20 call #t~ret0 := fibonacci(~n - 1);< 5701#fibonacciENTRY ~n := #in~n; 5702#L15 assume !(~n < 1); 5698#L17 assume !(1 == ~n); 5652#L20 call #t~ret0 := fibonacci(~n - 1);< 5695#fibonacciENTRY ~n := #in~n; 5697#L15 assume !(~n < 1); 5700#L17 assume !(1 == ~n); 5651#L20 call #t~ret0 := fibonacci(~n - 1);< 5695#fibonacciENTRY ~n := #in~n; 5696#L15 assume !(~n < 1); 5650#L17 assume 1 == ~n;#res := 1; 5653#fibonacciFINAL assume true; 6047#fibonacciEXIT >#28#return; 5636#L20-1 call #t~ret1 := fibonacci(~n - 2);< 5899#fibonacciENTRY ~n := #in~n; 5935#L15 assume !(~n < 1); 5927#L17 assume !(1 == ~n); 5928#L20 call #t~ret0 := fibonacci(~n - 1);< 5937#fibonacciENTRY ~n := #in~n; 6049#L15 assume !(~n < 1); 5939#L17 assume !(1 == ~n); 5940#L20 call #t~ret0 := fibonacci(~n - 1);< 5957#fibonacciENTRY [2019-11-28 21:15:50,919 INFO L796 eck$LassoCheckResult]: Loop: 5957#fibonacciENTRY ~n := #in~n; 5970#L15 assume !(~n < 1); 5967#L17 assume !(1 == ~n); 5955#L20 call #t~ret0 := fibonacci(~n - 1);< 5957#fibonacciENTRY [2019-11-28 21:15:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2028848867, now seen corresponding path program 1 times [2019-11-28 21:15:50,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:50,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745474195] [2019-11-28 21:15:50,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:51,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745474195] [2019-11-28 21:15:51,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061816538] [2019-11-28 21:15:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:15:51,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 46 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:15:51,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:51,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 22 [2019-11-28 21:15:51,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179409253] [2019-11-28 21:15:51,199 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2019-11-28 21:15:51,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:51,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236616157] [2019-11-28 21:15:51,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:51,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:51,237 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:51,237 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:51,237 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:51,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:51,238 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:51,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,238 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:51,238 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:51,238 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2019-11-28 21:15:51,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:51,239 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:51,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,296 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:51,296 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:51,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:51,304 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:51,304 INFO L440 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:51,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:51,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:51,313 INFO L440 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:51,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:51,324 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:51,324 INFO L440 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:51,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:51,341 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:51,341 INFO L440 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:51,348 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:51,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:51,372 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:15:51,375 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:51,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:51,375 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:51,375 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:51,375 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:15:51,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:51,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:51,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2019-11-28 21:15:51,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:51,376 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:51,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-11-28 21:15:51,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:51,423 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:51,423 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,429 INFO L120 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-11-28 21:15:51,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:51,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:51,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:51,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:51,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:51,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:51,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:51,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,443 INFO L120 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-11-28 21:15:51,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:51,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:51,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:51,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:51,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:51,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:51,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:51,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,456 INFO L120 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-11-28 21:15:51,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:51,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:51,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:51,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:51,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:51,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:51,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:51,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:51,467 INFO L120 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 Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:51,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:51,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:51,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:51,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:51,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:51,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:51,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,478 INFO L120 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-11-28 21:15:51,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:51,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:51,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:51,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:51,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:51,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:51,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:51,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:15:51,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:15:51,487 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:51,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:15:51,495 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:15:51,495 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:15:51,495 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:51,497 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:15:51,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 21:15:51,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:51,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:51,635 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-11-28 21:15:51,635 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-28 21:15:51,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 550 states and 821 transitions. Complement of second has 13 states. [2019-11-28 21:15:51,706 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-11-28 21:15:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:15:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 21:15:51,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 21:15:51,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:51,707 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 21:15:51,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:51,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:51,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:51,823 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-11-28 21:15:51,823 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-28 21:15:51,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 550 states and 821 transitions. Complement of second has 13 states. [2019-11-28 21:15:51,908 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-11-28 21:15:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:15:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 21:15:51,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 21:15:51,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:51,910 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:52,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 21:15:52,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:52,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:52,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:52,066 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-11-28 21:15:52,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-28 21:15:52,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 701 states and 990 transitions. Complement of second has 14 states. [2019-11-28 21:15:52,152 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-11-28 21:15:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:15:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 21:15:52,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 21:15:52,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:52,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 40 letters. Loop has 4 letters. [2019-11-28 21:15:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:52,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 8 letters. [2019-11-28 21:15:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:52,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 701 states and 990 transitions. [2019-11-28 21:15:52,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:52,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 701 states to 588 states and 865 transitions. [2019-11-28 21:15:52,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2019-11-28 21:15:52,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2019-11-28 21:15:52,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 588 states and 865 transitions. [2019-11-28 21:15:52,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:52,174 INFO L688 BuchiCegarLoop]: Abstraction has 588 states and 865 transitions. [2019-11-28 21:15:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states and 865 transitions. [2019-11-28 21:15:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 558. [2019-11-28 21:15:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-28 21:15:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 829 transitions. [2019-11-28 21:15:52,193 INFO L711 BuchiCegarLoop]: Abstraction has 558 states and 829 transitions. [2019-11-28 21:15:52,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 21:15:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-28 21:15:52,194 INFO L87 Difference]: Start difference. First operand 558 states and 829 transitions. Second operand 22 states. [2019-11-28 21:15:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:52,560 INFO L93 Difference]: Finished difference Result 650 states and 972 transitions. [2019-11-28 21:15:52,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 21:15:52,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 972 transitions. [2019-11-28 21:15:52,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:52,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 635 states and 951 transitions. [2019-11-28 21:15:52,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-28 21:15:52,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-28 21:15:52,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 951 transitions. [2019-11-28 21:15:52,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:52,581 INFO L688 BuchiCegarLoop]: Abstraction has 635 states and 951 transitions. [2019-11-28 21:15:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 951 transitions. [2019-11-28 21:15:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 590. [2019-11-28 21:15:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-28 21:15:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 881 transitions. [2019-11-28 21:15:52,608 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 881 transitions. [2019-11-28 21:15:52,608 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 881 transitions. [2019-11-28 21:15:52,608 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:15:52,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 881 transitions. [2019-11-28 21:15:52,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:52,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:52,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:52,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 8, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:52,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:15:52,616 INFO L794 eck$LassoCheckResult]: Stem: 9768#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 9769#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 9770#fibonacciENTRY ~n := #in~n; 9856#L15 assume !(~n < 1); 9855#L17 assume !(1 == ~n); 9831#L20 call #t~ret0 := fibonacci(~n - 1);< 9832#fibonacciENTRY ~n := #in~n; 9839#L15 assume !(~n < 1); 9836#L17 assume !(1 == ~n); 9834#L20 call #t~ret0 := fibonacci(~n - 1);< 9850#fibonacciENTRY ~n := #in~n; 9854#L15 assume !(~n < 1); 9853#L17 assume !(1 == ~n); 9845#L20 call #t~ret0 := fibonacci(~n - 1);< 9852#fibonacciENTRY ~n := #in~n; 9876#L15 assume !(~n < 1); 9874#L17 assume !(1 == ~n); 9841#L20 call #t~ret0 := fibonacci(~n - 1);< 9849#fibonacciENTRY ~n := #in~n; 9912#L15 assume !(~n < 1); 9910#L17 assume !(1 == ~n); 9866#L20 call #t~ret0 := fibonacci(~n - 1);< 9879#fibonacciENTRY ~n := #in~n; 9986#L15 assume !(~n < 1); 9985#L17 assume !(1 == ~n); 9863#L20 call #t~ret0 := fibonacci(~n - 1);< 9879#fibonacciENTRY ~n := #in~n; 10011#L15 assume !(~n < 1); 10068#L17 assume 1 == ~n;#res := 1; 10067#fibonacciFINAL assume true; 10066#fibonacciEXIT >#28#return; 9772#L20-1 call #t~ret1 := fibonacci(~n - 2);< 9984#fibonacciENTRY ~n := #in~n; 10248#L15 assume !(~n < 1); 10240#L17 assume !(1 == ~n); 10241#L20 call #t~ret0 := fibonacci(~n - 1);< 10250#fibonacciENTRY ~n := #in~n; 10267#L15 assume !(~n < 1); 10264#L17 assume !(1 == ~n); 9803#L20 call #t~ret0 := fibonacci(~n - 1);< 9805#fibonacciENTRY ~n := #in~n; 9806#L15 assume !(~n < 1); 10278#L17 assume !(1 == ~n); 9801#L20 [2019-11-28 21:15:52,616 INFO L796 eck$LassoCheckResult]: Loop: 9801#L20 call #t~ret0 := fibonacci(~n - 1);< 9805#fibonacciENTRY ~n := #in~n; 9806#L15 assume !(~n < 1); 10278#L17 assume !(1 == ~n); 9801#L20 [2019-11-28 21:15:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1567609232, now seen corresponding path program 2 times [2019-11-28 21:15:52,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:52,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021616217] [2019-11-28 21:15:52,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:52,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021616217] [2019-11-28 21:15:52,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982861810] [2019-11-28 21:15:52,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:52,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:15:52,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:52,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:15:52,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 75 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 21:15:52,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:52,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 26 [2019-11-28 21:15:52,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339348040] [2019-11-28 21:15:52,952 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2019-11-28 21:15:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:52,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715615985] [2019-11-28 21:15:52,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:52,959 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:52,994 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:52,995 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:52,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:52,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:52,995 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:52,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:52,995 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:52,995 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:52,995 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2019-11-28 21:15:52,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:52,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:52,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:52,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:53,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:53,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:53,053 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:53,053 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:53,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:53,063 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:53,066 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:53,066 INFO L440 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:53,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:53,073 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:53,076 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:53,077 INFO L440 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:53,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:53,083 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:53,086 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:53,086 INFO L440 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:53,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:53,094 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:53,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:53,107 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,341 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:15:54,343 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:54,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:54,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:54,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:54,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:15:54,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:54,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:54,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2019-11-28 21:15:54,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:54,344 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:54,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:54,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:54,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:54,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:54,404 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:54,404 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,410 INFO L120 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-11-28 21:15:54,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:54,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:54,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:54,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:54,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:54,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:54,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:54,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,419 INFO L120 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-11-28 21:15:54,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:54,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:54,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:54,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:54,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:54,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:54,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:54,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,429 INFO L120 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-11-28 21:15:54,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:54,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:54,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:54,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:54,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:54,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:54,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:54,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:54,440 INFO L120 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 Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:54,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:54,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:54,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:54,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:54,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:54,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:54,446 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:15:54,448 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:15:54,448 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:54,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:15:54,454 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:15:54,454 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:15:54,454 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 21:15:54,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:15:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:54,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 21:15:54,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:54,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:54,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:54,576 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 21:15:54,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301 Second operand 6 states. [2019-11-28 21:15:54,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301. Second operand 6 states. Result 608 states and 900 transitions. Complement of second has 18 states. [2019-11-28 21:15:54,652 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-11-28 21:15:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:15:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-28 21:15:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-28 21:15:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:54,653 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:54,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 21:15:54,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:54,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:54,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:54,775 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-11-28 21:15:54,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301 Second operand 6 states. [2019-11-28 21:15:54,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301. Second operand 6 states. Result 838 states and 1222 transitions. Complement of second has 22 states. [2019-11-28 21:15:54,876 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-11-28 21:15:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:15:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-28 21:15:54,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-28 21:15:54,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:54,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-11-28 21:15:54,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:54,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-28 21:15:54,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:54,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 838 states and 1222 transitions. [2019-11-28 21:15:54,891 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:54,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 838 states to 768 states and 1147 transitions. [2019-11-28 21:15:54,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2019-11-28 21:15:54,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-11-28 21:15:54,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 768 states and 1147 transitions. [2019-11-28 21:15:54,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:54,906 INFO L688 BuchiCegarLoop]: Abstraction has 768 states and 1147 transitions. [2019-11-28 21:15:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states and 1147 transitions. [2019-11-28 21:15:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 755. [2019-11-28 21:15:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-28 21:15:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1130 transitions. [2019-11-28 21:15:54,931 INFO L711 BuchiCegarLoop]: Abstraction has 755 states and 1130 transitions. [2019-11-28 21:15:54,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 21:15:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-11-28 21:15:54,933 INFO L87 Difference]: Start difference. First operand 755 states and 1130 transitions. Second operand 26 states. [2019-11-28 21:15:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:55,417 INFO L93 Difference]: Finished difference Result 855 states and 1274 transitions. [2019-11-28 21:15:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 21:15:55,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 855 states and 1274 transitions. [2019-11-28 21:15:55,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:55,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 855 states to 838 states and 1248 transitions. [2019-11-28 21:15:55,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2019-11-28 21:15:55,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2019-11-28 21:15:55,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1248 transitions. [2019-11-28 21:15:55,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:55,449 INFO L688 BuchiCegarLoop]: Abstraction has 838 states and 1248 transitions. [2019-11-28 21:15:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1248 transitions. [2019-11-28 21:15:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 813. [2019-11-28 21:15:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-28 21:15:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1193 transitions. [2019-11-28 21:15:55,477 INFO L711 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 21:15:55,477 INFO L591 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 21:15:55,478 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:15:55,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 813 states and 1193 transitions. [2019-11-28 21:15:55,483 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:55,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:55,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:55,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 10, 9, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:55,487 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:15:55,489 INFO L794 eck$LassoCheckResult]: Stem: 13937#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 13938#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 13947#fibonacciENTRY ~n := #in~n; 14064#L15 assume !(~n < 1); 14060#L17 assume !(1 == ~n); 14042#L20 call #t~ret0 := fibonacci(~n - 1);< 14053#fibonacciENTRY ~n := #in~n; 14423#L15 assume !(~n < 1); 14342#L17 assume !(1 == ~n); 14044#L20 call #t~ret0 := fibonacci(~n - 1);< 14045#fibonacciENTRY ~n := #in~n; 14147#L15 assume !(~n < 1); 14146#L17 assume !(1 == ~n); 14143#L20 call #t~ret0 := fibonacci(~n - 1);< 14145#fibonacciENTRY ~n := #in~n; 14268#L15 assume !(~n < 1); 14266#L17 assume !(1 == ~n); 14258#L20 call #t~ret0 := fibonacci(~n - 1);< 14265#fibonacciENTRY ~n := #in~n; 14263#L15 assume !(~n < 1); 14261#L17 assume !(1 == ~n); 14163#L20 call #t~ret0 := fibonacci(~n - 1);< 14259#fibonacciENTRY ~n := #in~n; 14348#L15 assume !(~n < 1); 14347#L17 assume !(1 == ~n); 14276#L20 call #t~ret0 := fibonacci(~n - 1);< 14345#fibonacciENTRY ~n := #in~n; 14372#L15 assume !(~n < 1); 14371#L17 assume !(1 == ~n); 14277#L20 call #t~ret0 := fibonacci(~n - 1);< 14370#fibonacciENTRY ~n := #in~n; 14427#L15 assume !(~n < 1); 14426#L17 assume 1 == ~n;#res := 1; 14425#fibonacciFINAL assume true; 14424#fibonacciEXIT >#28#return; 14414#L20-1 call #t~ret1 := fibonacci(~n - 2);< 14417#fibonacciENTRY ~n := #in~n; 14420#L15 assume ~n < 1;#res := 0; 14418#fibonacciFINAL assume true; 14413#fibonacciEXIT >#30#return; 14411#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14410#fibonacciFINAL assume true; 14344#fibonacciEXIT >#28#return; 14270#L20-1 call #t~ret1 := fibonacci(~n - 2);< 14281#fibonacciENTRY ~n := #in~n; 14361#L15 assume !(~n < 1); 14368#L17 assume !(1 == ~n); 14048#L20 call #t~ret0 := fibonacci(~n - 1);< 14359#fibonacciENTRY ~n := #in~n; 14393#L15 assume !(~n < 1); 14392#L17 assume !(1 == ~n); 14029#L20 call #t~ret0 := fibonacci(~n - 1);< 14035#fibonacciENTRY ~n := #in~n; 14098#L15 assume !(~n < 1); 14097#L17 assume !(1 == ~n); 14032#L20 [2019-11-28 21:15:55,490 INFO L796 eck$LassoCheckResult]: Loop: 14032#L20 call #t~ret0 := fibonacci(~n - 1);< 14035#fibonacciENTRY ~n := #in~n; 14098#L15 assume !(~n < 1); 14097#L17 assume !(1 == ~n); 14032#L20 [2019-11-28 21:15:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash 439095810, now seen corresponding path program 4 times [2019-11-28 21:15:55,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:55,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950876209] [2019-11-28 21:15:55,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:15:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 20 proven. 205 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:15:55,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950876209] [2019-11-28 21:15:55,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163127734] [2019-11-28 21:15:55,855 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:55,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 21:15:55,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:55,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 21:15:55,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 95 proven. 120 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 21:15:55,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:55,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 28 [2019-11-28 21:15:55,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104562149] [2019-11-28 21:15:55,921 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2019-11-28 21:15:55,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:55,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047562442] [2019-11-28 21:15:55,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:55,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:55,969 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:55,969 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:55,969 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:55,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:55,970 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:55,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:55,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:55,970 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:55,970 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2019-11-28 21:15:55,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:55,971 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:55,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:55,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:55,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:55,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:56,043 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:56,043 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:56,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:56,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:56,050 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:56,050 INFO L440 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:56,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:56,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:56,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:56,061 INFO L440 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:56,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:56,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:56,069 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:56,069 INFO L440 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:56,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:56,075 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:56,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:56,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:15:56,923 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:15:56,924 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:56,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:56,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:56,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:56,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:15:56,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:56,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:56,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:56,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2019-11-28 21:15:56,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:56,925 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:56,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:56,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:56,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:56,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:57,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:57,009 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:57,016 INFO L120 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-11-28 21:15:57,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:57,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:57,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:57,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:57,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:57,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:57,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:57,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:57,026 INFO L120 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-11-28 21:15:57,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:57,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:57,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:57,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:57,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:57,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:57,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:57,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:57,038 INFO L120 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-11-28 21:15:57,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:15:57,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:15:57,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:15:57,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:15:57,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:15:57,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:15:57,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:15:57,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:15:57,053 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:15:57,053 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:57,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:15:57,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:15:57,057 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:15:57,057 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:15:57,059 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:15:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:57,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 21:15:57,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:57,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:57,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:57,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:57,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:57,201 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-11-28 21:15:57,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-28 21:15:57,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 838 states and 1219 transitions. Complement of second has 18 states. [2019-11-28 21:15:57,259 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-11-28 21:15:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:15:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-28 21:15:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-28 21:15:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:57,261 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:57,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 21:15:57,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:57,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:57,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:57,390 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-11-28 21:15:57,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-28 21:15:57,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 1019 states and 1430 transitions. Complement of second has 22 states. [2019-11-28 21:15:57,493 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-11-28 21:15:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:15:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-28 21:15:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-28 21:15:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:57,495 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:15:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:57,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 21:15:57,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:57,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:57,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:15:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:57,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:15:57,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:15:57,624 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-11-28 21:15:57,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-28 21:15:57,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 1102 states and 1565 transitions. Complement of second has 27 states. [2019-11-28 21:15:57,715 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-11-28 21:15:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:15:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 21:15:57,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-28 21:15:57,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:57,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 21:15:57,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:57,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 8 letters. [2019-11-28 21:15:57,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:15:57,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 1565 transitions. [2019-11-28 21:15:57,730 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 21:15:57,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 813 states and 1193 transitions. [2019-11-28 21:15:57,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-28 21:15:57,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2019-11-28 21:15:57,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 813 states and 1193 transitions. [2019-11-28 21:15:57,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:57,756 INFO L688 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 21:15:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states and 1193 transitions. [2019-11-28 21:15:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2019-11-28 21:15:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-28 21:15:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1193 transitions. [2019-11-28 21:15:57,786 INFO L711 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 21:15:57,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:15:57,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 21:15:57,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-11-28 21:15:57,788 INFO L87 Difference]: Start difference. First operand 813 states and 1193 transitions. Second operand 28 states. [2019-11-28 21:15:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:15:58,311 INFO L93 Difference]: Finished difference Result 387 states and 486 transitions. [2019-11-28 21:15:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 21:15:58,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 486 transitions. [2019-11-28 21:15:58,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 21:15:58,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 353 states and 450 transitions. [2019-11-28 21:15:58,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-28 21:15:58,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-11-28 21:15:58,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 450 transitions. [2019-11-28 21:15:58,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:15:58,321 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 450 transitions. [2019-11-28 21:15:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 450 transitions. [2019-11-28 21:15:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 328. [2019-11-28 21:15:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 21:15:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 419 transitions. [2019-11-28 21:15:58,330 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-28 21:15:58,330 INFO L591 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-28 21:15:58,330 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:15:58,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 419 transitions. [2019-11-28 21:15:58,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 21:15:58,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:15:58,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:15:58,333 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 11, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 21:15:58,333 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:15:58,334 INFO L794 eck$LassoCheckResult]: Stem: 19787#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 19788#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 19789#fibonacciENTRY ~n := #in~n; 19847#L15 assume !(~n < 1); 19846#L17 assume !(1 == ~n); 19842#L20 call #t~ret0 := fibonacci(~n - 1);< 19845#fibonacciENTRY ~n := #in~n; 19844#L15 assume !(~n < 1); 19843#L17 assume !(1 == ~n); 19838#L20 call #t~ret0 := fibonacci(~n - 1);< 19841#fibonacciENTRY ~n := #in~n; 19840#L15 assume !(~n < 1); 19839#L17 assume !(1 == ~n); 19834#L20 call #t~ret0 := fibonacci(~n - 1);< 19837#fibonacciENTRY ~n := #in~n; 19836#L15 assume !(~n < 1); 19835#L17 assume !(1 == ~n); 19830#L20 call #t~ret0 := fibonacci(~n - 1);< 19833#fibonacciENTRY ~n := #in~n; 19832#L15 assume !(~n < 1); 19831#L17 assume !(1 == ~n); 19826#L20 call #t~ret0 := fibonacci(~n - 1);< 19829#fibonacciENTRY ~n := #in~n; 19828#L15 assume !(~n < 1); 19827#L17 assume !(1 == ~n); 19820#L20 call #t~ret0 := fibonacci(~n - 1);< 19822#fibonacciENTRY ~n := #in~n; 19825#L15 assume !(~n < 1); 19824#L17 assume !(1 == ~n); 19819#L20 call #t~ret0 := fibonacci(~n - 1);< 19822#fibonacciENTRY ~n := #in~n; 19825#L15 assume !(~n < 1); 19824#L17 assume !(1 == ~n); 19819#L20 call #t~ret0 := fibonacci(~n - 1);< 19821#fibonacciENTRY ~n := #in~n; 20030#L15 assume !(~n < 1); 20029#L17 assume 1 == ~n;#res := 1; 20028#fibonacciFINAL assume true; 20025#fibonacciEXIT >#28#return; 20022#L20-1 call #t~ret1 := fibonacci(~n - 2);< 20024#fibonacciENTRY ~n := #in~n; 20039#L15 assume ~n < 1;#res := 0; 20036#fibonacciFINAL assume true; 20021#fibonacciEXIT >#30#return; 20020#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 20019#fibonacciFINAL assume true; 20013#fibonacciEXIT >#28#return; 19926#L20-1 call #t~ret1 := fibonacci(~n - 2);< 19929#fibonacciENTRY ~n := #in~n; 20016#L15 assume !(~n < 1); 20014#L17 assume !(1 == ~n); 20015#L20 call #t~ret0 := fibonacci(~n - 1);< 20052#fibonacciENTRY ~n := #in~n; 20063#L15 assume !(~n < 1); 20077#L17 assume !(1 == ~n); 19813#L20 call #t~ret0 := fibonacci(~n - 1);< 19817#fibonacciENTRY ~n := #in~n; 19818#L15 assume !(~n < 1); 20089#L17 assume !(1 == ~n); 19810#L20 [2019-11-28 21:15:58,334 INFO L796 eck$LassoCheckResult]: Loop: 19810#L20 call #t~ret0 := fibonacci(~n - 1);< 19817#fibonacciENTRY ~n := #in~n; 19818#L15 assume !(~n < 1); 20089#L17 assume !(1 == ~n); 19810#L20 [2019-11-28 21:15:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1106126005, now seen corresponding path program 5 times [2019-11-28 21:15:58,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:58,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145081531] [2019-11-28 21:15:58,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:15:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 195 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 21:15:58,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145081531] [2019-11-28 21:15:58,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826114120] [2019-11-28 21:15:58,572 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:15:58,617 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 21:15:58,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:15:58,618 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:15:58,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:15:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 142 proven. 11 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-28 21:15:58,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:15:58,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 25 [2019-11-28 21:15:58,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407636045] [2019-11-28 21:15:58,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:15:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:15:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 5 times [2019-11-28 21:15:58,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:15:58,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988431107] [2019-11-28 21:15:58,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:15:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:15:58,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:15:58,762 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:15:58,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:15:58,763 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:15:58,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:15:58,763 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:15:58,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:58,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:15:58,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:15:58,763 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration10_Loop [2019-11-28 21:15:58,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:15:58,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:15:58,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:58,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:58,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:15:58,822 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:15:58,823 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:58,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:58,837 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:58,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:58,842 INFO L440 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:58,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:58,850 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:15:58,855 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:15:58,855 INFO L440 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:58,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:15:58,862 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:15:58,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:15:58,876 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:08,237 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:08,239 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:08,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:08,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:08,239 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:08,239 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:08,239 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:08,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:08,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:08,240 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration10_Loop [2019-11-28 21:16:08,240 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:08,240 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:08,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:16:08,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:16:08,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:16:08,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:16:08,294 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:08,294 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:08,300 INFO L120 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-11-28 21:16:08,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:08,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:08,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:08,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:08,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:08,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:08,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:08,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:08,309 INFO L120 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-11-28 21:16:08,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:08,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:08,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:08,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:08,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:08,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:08,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:08,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:08,319 INFO L120 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-11-28 21:16:08,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:08,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:08,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:08,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:08,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:08,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:08,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:08,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:08,327 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:16:08,327 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:08,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:08,331 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:08,331 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:08,331 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 21:16:08,333 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:16:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:08,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 21:16:08,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:08,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:08,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:08,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:16:08,465 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:16:08,495 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-11-28 21:16:08,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-28 21:16:08,557 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 350 states and 442 transitions. Complement of second has 18 states. [2019-11-28 21:16:08,558 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-11-28 21:16:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:16:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-28 21:16:08,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 21:16:08,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:08,559 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:08,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 21:16:08,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:08,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:08,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:08,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:16:08,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:16:08,727 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-11-28 21:16:08,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-28 21:16:08,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 356 states and 448 transitions. Complement of second has 17 states. [2019-11-28 21:16:08,814 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-11-28 21:16:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:16:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-28 21:16:08,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 21:16:08,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:08,815 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:08,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 21:16:08,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:08,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:08,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:16:08,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:16:08,947 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-11-28 21:16:08,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-28 21:16:09,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 455 states and 575 transitions. Complement of second has 27 states. [2019-11-28 21:16:09,018 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-11-28 21:16:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:16:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 21:16:09,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 21:16:09,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:09,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 63 letters. Loop has 4 letters. [2019-11-28 21:16:09,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:09,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 8 letters. [2019-11-28 21:16:09,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:09,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 575 transitions. [2019-11-28 21:16:09,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 21:16:09,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 336 states and 429 transitions. [2019-11-28 21:16:09,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2019-11-28 21:16:09,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 21:16:09,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 429 transitions. [2019-11-28 21:16:09,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:09,028 INFO L688 BuchiCegarLoop]: Abstraction has 336 states and 429 transitions. [2019-11-28 21:16:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 429 transitions. [2019-11-28 21:16:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 328. [2019-11-28 21:16:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 21:16:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 419 transitions. [2019-11-28 21:16:09,036 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-28 21:16:09,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 21:16:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2019-11-28 21:16:09,037 INFO L87 Difference]: Start difference. First operand 328 states and 419 transitions. Second operand 25 states. [2019-11-28 21:16:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:09,792 INFO L93 Difference]: Finished difference Result 426 states and 559 transitions. [2019-11-28 21:16:09,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 21:16:09,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 559 transitions. [2019-11-28 21:16:09,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:16:09,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 0 states and 0 transitions. [2019-11-28 21:16:09,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:16:09,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:16:09,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:16:09,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:16:09,799 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:09,799 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:09,799 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:09,799 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:16:09,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:16:09,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:16:09,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:16:09,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:16:09 BoogieIcfgContainer [2019-11-28 21:16:09,807 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:16:09,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:16:09,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:16:09,808 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:16:09,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:15:41" (3/4) ... [2019-11-28 21:16:09,812 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:16:09,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:16:09,814 INFO L168 Benchmark]: Toolchain (without parser) took 28403.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.1 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -228.5 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:09,815 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:16:09,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.68 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:09,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:09,816 INFO L168 Benchmark]: Boogie Preprocessor took 21.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:16:09,816 INFO L168 Benchmark]: RCFGBuilder took 204.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:09,817 INFO L168 Benchmark]: BuchiAutomizer took 27864.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:09,817 INFO L168 Benchmark]: Witness Printer took 4.66 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:16:09,820 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.68 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27864.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.66 ms. Allocated memory is still 1.4 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 16 terminating modules (9 trivial, 3 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 9 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 9 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. 9 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.7s and 11 iterations. TraceHistogramMax:13. Analysis of lassos took 19.2s. Construction of modules took 2.4s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 328 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 813 states and ocurred in iteration 8. Nontrivial modules had stage [2, 1, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/46 HoareTripleCheckerStatistics: 324 SDtfs, 913 SDslu, 818 SDs, 0 SdLazy, 2689 SolverSat, 728 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI3 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...