./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:02:29,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:02:29,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:02:29,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:02:29,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:02:29,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:02:29,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:02:29,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:02:29,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:02:29,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:02:29,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:02:29,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:02:29,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:02:29,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:02:29,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:02:29,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:02:29,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:02:29,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:02:29,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:02:29,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:02:29,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:02:29,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:02:29,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:02:29,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:02:29,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:02:29,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:02:29,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:02:29,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:02:29,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:02:29,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:02:29,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:02:29,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:02:29,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:02:29,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:02:29,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:02:29,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:02:29,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:02:29,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:02:29,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:02:29,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:02:29,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:02:29,225 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:02:29,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:02:29,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:02:29,226 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:02:29,226 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:02:29,226 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:02:29,226 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:02:29,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:02:29,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:02:29,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:02:29,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:02:29,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:02:29,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:02:29,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:02:29,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:02:29,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:02:29,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:02:29,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:02:29,229 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:02:29,229 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:02:29,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:02:29,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:02:29,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:02:29,229 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:02:29,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:02:29,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:02:29,230 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:02:29,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:02:29,231 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-11-29 00:02:29,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:02:29,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:02:29,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:02:29,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:02:29,296 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:02:29,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-29 00:02:29,368 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a047084/a75c0258d5254540982a9d4dc5e7b83e/FLAG15a5cbc29 [2018-11-29 00:02:29,844 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:02:29,844 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-29 00:02:29,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a047084/a75c0258d5254540982a9d4dc5e7b83e/FLAG15a5cbc29 [2018-11-29 00:02:30,192 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a047084/a75c0258d5254540982a9d4dc5e7b83e [2018-11-29 00:02:30,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:02:30,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:02:30,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:30,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:02:30,202 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:02:30,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71aa32a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30, skipping insertion in model container [2018-11-29 00:02:30,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:02:30,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:02:30,420 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:30,426 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:02:30,449 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:30,468 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:02:30,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30 WrapperNode [2018-11-29 00:02:30,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:30,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:30,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:02:30,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:02:30,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:30,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:02:30,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:02:30,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:02:30,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... [2018-11-29 00:02:30,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:02:30,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:02:30,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:02:30,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:02:30,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:02:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:02:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-29 00:02:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-29 00:02:30,893 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:02:30,894 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:02:30,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:30 BoogieIcfgContainer [2018-11-29 00:02:30,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:02:30,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:02:30,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:02:30,900 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:02:30,900 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:30,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:02:30" (1/3) ... [2018-11-29 00:02:30,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd5bb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:30, skipping insertion in model container [2018-11-29 00:02:30,902 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:30,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30" (2/3) ... [2018-11-29 00:02:30,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd5bb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:30, skipping insertion in model container [2018-11-29 00:02:30,903 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:30,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:30" (3/3) ... [2018-11-29 00:02:30,906 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-11-29 00:02:31,017 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:02:31,018 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:02:31,019 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:02:31,019 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:02:31,019 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:02:31,019 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:02:31,019 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:02:31,019 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:02:31,019 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:02:31,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:02:31,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:31,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:31,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:31,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:31,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:31,089 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:02:31,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:02:31,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:31,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:31,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:31,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:31,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:31,104 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-11-29 00:02:31,105 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2018-11-29 00:02:31,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-11-29 00:02:31,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:31,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-11-29 00:02:31,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:31,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:31,248 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-11-29 00:02:31,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:31,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:31,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:31,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,474 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:31,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:31,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:31,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:31,475 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:31,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:31,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:31,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:02:31,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:31,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:31,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,779 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:31,781 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:31,817 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,819 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:02:31,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,856 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,869 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:31,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,904 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:31,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,952 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:31,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:32,021 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:32,033 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:32,033 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:32,033 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:32,033 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:32,033 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:32,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:32,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:32,034 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:32,034 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:02:32,034 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:32,034 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:32,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:32,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:32,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:32,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:32,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:32,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:32,248 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:32,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:32,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:32,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:32,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:32,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:32,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:32,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:32,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:32,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:32,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:32,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:32,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:32,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:32,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:32,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:32,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:32,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:32,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:32,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:32,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:32,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:32,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:32,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:32,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:32,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:32,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:32,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:32,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:32,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:32,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:32,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:32,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:32,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:32,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:32,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:32,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:32,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:32,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:32,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:32,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:32,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:32,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:32,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:32,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:32,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:32,292 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:32,292 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:32,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:32,295 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:32,295 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:32,296 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:02:32,297 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:32,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:32,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:32,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:32,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:02:32,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-29 00:02:33,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-11-29 00:02:33,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:02:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-29 00:02:33,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:02:33,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:33,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:02:33,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:33,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:02:33,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:33,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-29 00:02:33,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:33,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-11-29 00:02:33,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:02:33,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:02:33,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-29 00:02:33,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:33,197 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:02:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-29 00:02:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-29 00:02:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-29 00:02:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-29 00:02:33,233 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:02:33,233 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:02:33,233 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:02:33,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-29 00:02:33,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:33,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:33,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:33,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:33,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:33,237 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2018-11-29 00:02:33,237 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2018-11-29 00:02:33,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-11-29 00:02:33,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:33,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:33,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:02:33,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:33,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:02:33,418 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:33,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-11-29 00:02:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:33,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:33,590 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 3 [2018-11-29 00:02:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:02:33,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:02:33,865 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:02:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:02:33,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:02:33,870 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-29 00:02:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:34,035 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-29 00:02:34,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:02:34,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-29 00:02:34,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:34,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-29 00:02:34,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:02:34,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:02:34,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-29 00:02:34,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:34,042 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:02:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-29 00:02:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:02:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:02:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-29 00:02:34,047 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:02:34,047 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:02:34,047 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:02:34,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-29 00:02:34,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:02:34,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:34,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:34,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:34,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:34,050 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2018-11-29 00:02:34,050 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2018-11-29 00:02:34,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-11-29 00:02:34,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:34,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:34,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:34,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:34,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:34,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-29 00:02:34,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:34,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-11-29 00:02:34,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:34,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:34,425 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:34,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:34,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:34,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:34,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:34,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:34,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:34,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:34,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:02:34,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:34,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:34,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:34,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:34,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:34,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:34,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:34,587 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:34,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:34,590 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:34,615 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:34,615 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:35,331 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:35,334 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:35,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:35,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:35,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:35,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:35,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:35,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:35,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:35,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:02:35,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:35,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:35,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:35,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:35,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:35,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:35,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:35,484 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:35,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:35,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:35,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:35,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:35,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:35,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:35,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:35,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:35,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:35,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:35,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:35,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:35,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:35,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:35,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:35,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:35,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:35,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:35,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:35,510 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:35,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:35,510 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:35,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:35,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:35,513 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:35,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:35,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:35,720 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:02:35,721 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-29 00:02:36,057 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-11-29 00:02:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:02:36,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-29 00:02:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:36,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-29 00:02:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:36,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-29 00:02:36,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:36,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-29 00:02:36,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:02:36,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-29 00:02:36,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-29 00:02:36,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:02:36,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-29 00:02:36,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:36,079 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-29 00:02:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-29 00:02:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-29 00:02:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:02:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-29 00:02:36,098 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-29 00:02:36,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:02:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:02:36,099 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-29 00:02:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:36,239 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-29 00:02:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:02:36,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-29 00:02:36,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:02:36,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-29 00:02:36,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:02:36,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:02:36,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-29 00:02:36,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:36,255 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-29 00:02:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-29 00:02:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-29 00:02:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:02:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-29 00:02:36,269 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:02:36,269 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:02:36,269 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:02:36,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-29 00:02:36,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:02:36,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:36,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:36,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:36,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:36,274 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:02:36,274 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:02:36,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-11-29 00:02:36,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:36,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:36,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:02:36,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:36,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:36,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:36,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:02:36,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:36,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:02:36,468 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:36,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-11-29 00:02:36,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:36,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:36,679 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:36,679 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:36,679 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:36,679 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:36,679 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:36,679 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:36,679 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:36,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:36,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:02:36,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:36,680 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:36,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:36,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:36,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:36,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:36,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:36,765 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:36,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:36,768 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:36,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:36,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:37,510 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:37,513 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:37,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:37,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:37,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:37,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:37,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:37,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:37,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:37,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:02:37,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:37,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:37,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:37,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:37,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:37,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:37,607 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:37,607 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:37,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:37,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:37,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:37,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:37,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:37,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:37,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:37,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:37,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:37,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:37,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:37,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:37,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:37,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:37,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:37,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:37,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:37,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:37,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:37,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:37,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:37,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:37,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:37,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:37,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:37,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:37,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:37,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:37,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:37,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:37,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:37,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:37,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:37,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:37,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:37,629 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:37,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:37,633 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:37,634 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:37,634 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:37,634 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:37,634 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:37,635 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:37,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:37,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:37,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:37,902 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:02:37,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:02:38,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-11-29 00:02:38,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:02:38,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:02:38,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:38,090 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:38,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:38,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:38,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:38,300 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:02:38,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:02:38,638 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-11-29 00:02:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-29 00:02:38,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:02:38,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:38,643 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:38,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:38,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:38,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:38,859 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:02:38,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:02:39,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-11-29 00:02:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:02:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-29 00:02:39,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:02:39,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:39,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-29 00:02:39,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:39,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-29 00:02:39,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:39,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-29 00:02:39,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:02:39,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-29 00:02:39,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-29 00:02:39,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-29 00:02:39,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-29 00:02:39,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:39,574 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-29 00:02:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-29 00:02:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-29 00:02:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-29 00:02:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-29 00:02:39,633 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-29 00:02:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:02:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:02:39,634 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-29 00:02:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:40,432 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-11-29 00:02:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:02:40,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-11-29 00:02:40,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:02:40,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-11-29 00:02:40,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-29 00:02:40,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-29 00:02:40,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-11-29 00:02:40,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:40,469 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-11-29 00:02:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-11-29 00:02:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-11-29 00:02:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-29 00:02:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-11-29 00:02:40,527 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:02:40,527 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-29 00:02:40,527 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:02:40,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-11-29 00:02:40,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:02:40,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:40,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:40,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:40,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:40,537 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-29 00:02:40,539 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-29 00:02:40,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-11-29 00:02:40,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:40,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:40,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-29 00:02:40,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:40,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:02:40,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:40,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-29 00:02:40,852 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:40,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-11-29 00:02:40,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:40,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:40,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:40,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:40,904 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:40,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:40,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:40,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:40,905 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:40,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:40,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:40,906 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:40,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:02:40,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:40,906 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:40,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:40,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:40,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:40,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:40,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:40,970 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:40,970 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:40,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:40,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:40,982 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:40,982 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:41,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:41,006 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:41,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:41,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:41,057 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:41,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:41,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:41,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:41,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:41,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:41,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:41,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:41,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:41,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:02:41,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:41,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:41,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:41,158 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:41,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:41,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:41,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:41,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:41,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:41,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:41,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:41,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:41,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:41,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:41,173 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:41,174 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:41,174 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:41,174 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:41,174 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:02:41,179 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:41,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:41,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:41,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:02:41,427 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-29 00:02:41,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:02:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:02:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:41,432 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:41,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:41,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:41,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:02:41,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-29 00:02:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:02:41,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:02:41,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:41,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:41,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:41,953 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:02:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:42,004 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:42,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-29 00:02:42,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-11-29 00:02:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-29 00:02:42,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:02:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-29 00:02:42,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:42,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-29 00:02:42,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:42,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-11-29 00:02:42,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:02:42,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-11-29 00:02:42,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-29 00:02:42,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-29 00:02:42,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-11-29 00:02:42,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:42,309 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-11-29 00:02:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-11-29 00:02:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-11-29 00:02:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-29 00:02:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-11-29 00:02:42,331 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-11-29 00:02:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-29 00:02:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-29 00:02:42,332 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-11-29 00:02:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:43,051 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-11-29 00:02:43,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-29 00:02:43,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-11-29 00:02:43,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:43,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-11-29 00:02:43,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-29 00:02:43,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-29 00:02:43,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-11-29 00:02:43,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:43,067 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-11-29 00:02:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-11-29 00:02:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-11-29 00:02:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:02:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:02:43,084 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:02:43,084 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:02:43,084 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:02:43,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-11-29 00:02:43,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:43,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:43,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:43,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:43,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:43,092 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-29 00:02:43,092 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-29 00:02:43,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-11-29 00:02:43,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:43,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:43,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-29 00:02:43,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:43,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:43,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:02:43,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:02:43,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:43,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-29 00:02:43,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:43,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-29 00:02:43,457 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:43,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-11-29 00:02:43,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:43,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:43,525 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:43,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:43,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:43,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:43,525 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:43,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:43,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:43,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:02:43,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:43,526 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:43,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:43,637 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:43,646 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:43,669 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:43,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,433 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:51,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:51,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:51,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:51,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:51,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:51,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:51,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:51,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-29 00:02:51,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:51,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:51,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:51,507 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:51,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:51,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:51,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:51,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:51,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:51,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:51,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:51,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:51,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:51,520 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:51,520 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:51,521 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:51,521 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:51,522 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:51,522 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:51,522 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:51,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:51,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:51,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:51,735 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:51,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:02:51,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-11-29 00:02:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:02:51,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:02:51,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:51,815 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:52,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:52,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:52,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:52,271 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:52,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:02:52,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-11-29 00:02:52,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:02:52,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:02:52,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:52,388 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:52,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:52,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:52,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:52,552 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:52,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-29 00:02:52,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-11-29 00:02:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:52,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-29 00:02:52,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:52,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-11-29 00:02:52,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:52,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-11-29 00:02:52,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:52,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-11-29 00:02:52,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:52,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-11-29 00:02:52,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-29 00:02:52,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-29 00:02:52,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-11-29 00:02:52,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:52,774 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-11-29 00:02:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-11-29 00:02:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-29 00:02:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-29 00:02:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-29 00:02:52,782 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-29 00:02:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:02:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:02:52,783 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-11-29 00:02:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:53,285 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-11-29 00:02:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:02:53,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-11-29 00:02:53,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:53,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-11-29 00:02:53,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-29 00:02:53,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-29 00:02:53,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-11-29 00:02:53,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:53,297 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-11-29 00:02:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-11-29 00:02:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-11-29 00:02:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-29 00:02:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-29 00:02:53,311 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-29 00:02:53,311 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-29 00:02:53,311 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:02:53,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-11-29 00:02:53,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:53,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:53,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:53,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-29 00:02:53,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:53,320 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-11-29 00:02:53,320 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-11-29 00:02:53,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2018-11-29 00:02:53,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:53,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:53,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:53,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-29 00:02:53,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:53,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:53,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:02:53,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-29 00:02:53,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:53,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-29 00:02:53,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:53,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-29 00:02:53,508 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-11-29 00:02:53,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:53,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:53,583 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:53,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:53,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:53,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:53,584 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:53,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:53,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:53,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:53,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:02:53,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:53,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:53,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:53,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:53,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:53,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:53,655 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:53,656 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:53,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:53,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:53,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:53,667 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:53,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:53,689 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:53,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:53,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:54,788 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:54,790 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:54,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:54,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:54,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:54,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:54,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:54,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:54,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:54,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-29 00:02:54,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:54,791 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:54,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:54,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:54,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:54,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:54,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:54,901 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:54,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:54,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:54,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:54,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:54,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:54,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:54,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:54,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:54,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:54,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:54,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:54,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:54,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:54,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:54,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:54,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:54,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:54,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:54,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:54,912 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:54,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:54,913 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:54,913 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:54,913 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:54,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:54,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:55,188 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:55,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-29 00:02:55,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-11-29 00:02:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:02:55,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:02:55,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:55,277 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:55,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:55,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:55,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-29 00:02:55,639 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-11-29 00:02:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:02:55,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:02:55,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:55,655 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:55,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:55,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:55,942 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:55,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-29 00:02:56,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-11-29 00:02:56,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:56,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-29 00:02:56,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:56,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-11-29 00:02:56,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:56,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:02:56,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:56,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-11-29 00:02:56,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:56,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-11-29 00:02:56,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-29 00:02:56,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-29 00:02:56,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-11-29 00:02:56,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:56,038 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-11-29 00:02:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-11-29 00:02:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-11-29 00:02:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-29 00:02:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-29 00:02:56,052 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-29 00:02:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-29 00:02:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-29 00:02:56,053 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2018-11-29 00:02:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:56,286 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2018-11-29 00:02:56,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-29 00:02:56,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2018-11-29 00:02:56,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:56,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2018-11-29 00:02:56,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2018-11-29 00:02:56,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-11-29 00:02:56,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2018-11-29 00:02:56,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:56,302 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2018-11-29 00:02:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2018-11-29 00:02:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2018-11-29 00:02:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-29 00:02:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-11-29 00:02:56,320 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:02:56,320 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:02:56,320 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:02:56,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2018-11-29 00:02:56,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:56,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:56,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:56,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2018-11-29 00:02:56,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:56,327 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-11-29 00:02:56,330 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-11-29 00:02:56,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2018-11-29 00:02:56,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:56,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:56,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:56,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-29 00:02:56,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:56,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-29 00:02:56,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-29 00:02:56,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:56,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-29 00:02:57,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:57,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2018-11-29 00:02:57,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:57,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2018-11-29 00:02:57,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:57,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:57,132 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:57,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:57,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:57,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:57,133 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:57,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:57,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:57,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:57,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:02:57,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:57,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:57,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:57,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:57,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:57,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:57,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:57,234 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:57,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:57,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:57,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:57,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:57,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:57,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:57,287 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:57,287 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:57,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:57,312 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:57,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:57,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:58,230 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:58,232 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:58,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:58,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:58,233 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:58,233 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:58,233 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:58,233 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:58,233 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:58,233 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-29 00:02:58,233 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:58,233 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:58,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:58,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:58,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:58,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:58,422 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:02:58,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:58,424 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:58,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:58,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:58,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:58,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:58,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:58,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:58,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:58,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:58,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:58,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:58,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:58,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:58,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:58,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:58,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:58,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:58,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:58,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:58,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:58,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:58,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:58,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:58,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:58,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:58,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:58,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:58,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:58,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:58,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:58,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:58,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:58,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:58,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:58,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:58,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:58,450 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:58,454 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:58,454 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:58,455 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:58,455 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:58,455 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:58,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:02:58,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:58,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:58,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:58,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:58,734 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:58,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-29 00:02:58,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2018-11-29 00:02:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:02:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-29 00:02:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:58,816 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:59,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:59,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:59,374 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-29 00:02:59,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2018-11-29 00:02:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:02:59,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-29 00:02:59,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:59,467 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:59,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:59,699 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:02:59,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-29 00:02:59,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2018-11-29 00:02:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-29 00:02:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2018-11-29 00:02:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2018-11-29 00:02:59,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:59,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2018-11-29 00:02:59,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:02:59,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2018-11-29 00:02:59,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-29 00:02:59,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2018-11-29 00:02:59,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2018-11-29 00:02:59,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:59,915 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:02:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2018-11-29 00:02:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-11-29 00:02:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-29 00:02:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-11-29 00:02:59,932 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-29 00:02:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-29 00:02:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-11-29 00:02:59,933 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2018-11-29 00:03:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:00,988 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2018-11-29 00:03:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-29 00:03:00,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2018-11-29 00:03:00,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:01,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2018-11-29 00:03:01,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-29 00:03:01,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2018-11-29 00:03:01,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2018-11-29 00:03:01,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:01,011 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2018-11-29 00:03:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2018-11-29 00:03:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2018-11-29 00:03:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-29 00:03:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-11-29 00:03:01,033 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-29 00:03:01,033 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-29 00:03:01,033 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:03:01,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2018-11-29 00:03:01,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:01,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:01,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:01,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1] [2018-11-29 00:03:01,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:01,046 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14905#fiboENTRY ~n := #in~n; 15099#L6 assume !(~n < 1); 15095#L8 assume !(1 == ~n); 15070#L11 call #t~ret0 := fibo(~n - 1);< 15090#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(1 == ~n); 15059#L11 call #t~ret0 := fibo(~n - 1);< 15066#fiboENTRY ~n := #in~n; 15064#L6 assume !(~n < 1); 15062#L8 assume !(1 == ~n); 15054#L11 call #t~ret0 := fibo(~n - 1);< 15058#fiboENTRY ~n := #in~n; 15057#L6 assume !(~n < 1); 15055#L8 assume !(1 == ~n); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14982#fiboENTRY ~n := #in~n; 14979#L6 assume !(~n < 1); 14976#L8 assume !(1 == ~n); 14932#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14959#L6 assume !(~n < 1); 15218#L8 assume 1 == ~n;#res := 1; 15217#fiboFINAL assume true; 15216#fiboEXIT >#32#return; 15214#L11-1 call #t~ret1 := fibo(~n - 2);< 15215#fiboENTRY ~n := #in~n; 15227#L6 assume ~n < 1;#res := 0; 15224#fiboFINAL assume true; 15213#fiboEXIT >#34#return; 15211#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15209#fiboFINAL assume true; 15208#fiboEXIT >#32#return; 15044#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15234#L6 assume !(~n < 1); 15053#L8 assume 1 == ~n;#res := 1; 14924#fiboFINAL assume true; 15043#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15027#fiboFINAL assume true; 15012#fiboEXIT >#32#return; 14986#L11-1 call #t~ret1 := fibo(~n - 2);< 14988#fiboENTRY ~n := #in~n; 15056#L6 assume !(~n < 1); 15052#L8 assume !(1 == ~n); 15022#L11 call #t~ret0 := fibo(~n - 1);< 15228#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15047#L8 assume 1 == ~n;#res := 1; 15036#fiboFINAL assume true; 15019#fiboEXIT >#32#return; 14996#L11-1 call #t~ret1 := fibo(~n - 2);< 15001#fiboENTRY ~n := #in~n; 15035#L6 assume ~n < 1;#res := 0; 15018#fiboFINAL assume true; 14993#fiboEXIT >#34#return; 14992#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14990#fiboFINAL assume true; 14985#fiboEXIT >#34#return; 14980#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14950#fiboFINAL assume true; 14942#fiboEXIT >#32#return; 14923#L11-1 call #t~ret1 := fibo(~n - 2);< 14934#fiboENTRY ~n := #in~n; 14928#L6 assume !(~n < 1); 14922#L8 assume !(1 == ~n); 14925#L11 call #t~ret0 := fibo(~n - 1);< 15197#fiboENTRY ~n := #in~n; 15196#L6 assume !(~n < 1); 15195#L8 assume !(1 == ~n); 15189#L11 call #t~ret0 := fibo(~n - 1);< 15191#fiboENTRY ~n := #in~n; 15148#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15194#fiboFINAL assume true; 15188#fiboEXIT >#32#return; 15181#L11-1 call #t~ret1 := fibo(~n - 2);< 15187#fiboENTRY ~n := #in~n; 15198#L6 assume ~n < 1;#res := 0; 15142#fiboFINAL assume true; 15179#fiboEXIT >#34#return; 15185#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15204#fiboFINAL assume true; 15203#fiboEXIT >#32#return; 15042#L11-1 call #t~ret1 := fibo(~n - 2);< 15045#fiboENTRY ~n := #in~n; 15232#L6 assume !(~n < 1); 15048#L8 assume 1 == ~n;#res := 1; 15038#fiboFINAL assume true; 15041#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15027#fiboFINAL assume true; 15012#fiboEXIT >#34#return; 14944#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15221#fiboFINAL assume true; 15013#fiboEXIT >#32#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 15146#L6 assume !(~n < 1); 14977#L8 assume !(1 == ~n); 14978#L11 call #t~ret0 := fibo(~n - 1);< 15024#fiboENTRY ~n := #in~n; 15229#L6 assume !(~n < 1); 15266#L8 assume !(1 == ~n); 14882#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2018-11-29 00:03:01,046 INFO L796 eck$LassoCheckResult]: Loop: 14883#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2018-11-29 00:03:01,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash 79280042, now seen corresponding path program 5 times [2018-11-29 00:03:01,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:01,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:01,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:01,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:01,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2018-11-29 00:03:01,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:01,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:01,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:01,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:01,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash 477112511, now seen corresponding path program 6 times [2018-11-29 00:03:01,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:01,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:01,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:01,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-11-29 00:03:01,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:01,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:01,952 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-29 00:03:01,979 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-29 00:03:01,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:01,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-29 00:03:02,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:02,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-11-29 00:03:02,261 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:02,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:02,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:02,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:02,262 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:02,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:02,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:02,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:02,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-29 00:03:02,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:02,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:02,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:02,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:02,347 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:02,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:02,351 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:02,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:02,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:10,576 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:10,579 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:10,579 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:10,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:10,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:10,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:10,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:10,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:10,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:10,580 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-29 00:03:10,580 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:10,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:10,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:10,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:10,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:10,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:03:10,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:10,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:10,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:10,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:10,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:10,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:10,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:10,653 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:10,658 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:10,658 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:10,658 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:10,661 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:10,661 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:10,661 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:10,662 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:10,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:11,101 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:11,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-29 00:03:11,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2018-11-29 00:03:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-29 00:03:11,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 127 letters. Loop has 4 letters. [2018-11-29 00:03:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:11,164 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:11,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:11,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:11,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:11,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-29 00:03:12,066 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2018-11-29 00:03:12,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-29 00:03:12,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 127 letters. Loop has 4 letters. [2018-11-29 00:03:12,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:12,068 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:12,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:12,469 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-29 00:03:12,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-29 00:03:12,561 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2018-11-29 00:03:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:03:12,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 4 letters. [2018-11-29 00:03:12,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:12,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-29 00:03:12,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:12,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 8 letters. [2018-11-29 00:03:12,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:12,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2018-11-29 00:03:12,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:03:12,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2018-11-29 00:03:12,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2018-11-29 00:03:12,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2018-11-29 00:03:12,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2018-11-29 00:03:12,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:12,590 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2018-11-29 00:03:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2018-11-29 00:03:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2018-11-29 00:03:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-29 00:03:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-11-29 00:03:12,612 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-29 00:03:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-29 00:03:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-29 00:03:12,613 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 25 states. [2018-11-29 00:03:12,902 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:13,683 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2018-11-29 00:03:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-29 00:03:13,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 600 states and 864 transitions. [2018-11-29 00:03:13,691 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:13,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 600 states to 0 states and 0 transitions. [2018-11-29 00:03:13,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:13,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:13,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:13,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:13,691 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:13,692 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:13,692 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:13,692 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:03:13,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:13,692 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:13,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:13,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:13 BoogieIcfgContainer [2018-11-29 00:03:13,709 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:13,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:13,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:13,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:13,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:30" (3/4) ... [2018-11-29 00:03:13,720 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:13,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:13,721 INFO L168 Benchmark]: Toolchain (without parser) took 43525.40 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 951.3 MB in the beginning and 868.4 MB in the end (delta: 83.0 MB). Peak memory consumption was 425.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:13,724 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:13,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:13,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:13,729 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:13,729 INFO L168 Benchmark]: RCFGBuilder took 357.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:13,732 INFO L168 Benchmark]: BuchiAutomizer took 42813.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 868.4 MB in the end (delta: 257.2 MB). Peak memory consumption was 452.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:13,734 INFO L168 Benchmark]: Witness Printer took 10.58 ms. Allocated memory is still 1.4 GB. Free memory is still 868.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:13,739 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 357.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42813.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 868.4 MB in the end (delta: 257.2 MB). Peak memory consumption was 452.2 MB. Max. memory is 11.5 GB. * Witness Printer took 10.58 ms. Allocated memory is still 1.4 GB. Free memory is still 868.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.7s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 27.1s. Construction of modules took 4.4s. Büchi inclusion checks took 10.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 330 SDtfs, 948 SDslu, 470 SDs, 0 SdLazy, 1976 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 19.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...