./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-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_2calls_6_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 595c6555624af5bbcf79585a20acb2500e3eeee8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:03:04,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:03:04,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:03:04,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:03:04,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:03:04,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:03:04,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:03:04,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:03:04,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:03:04,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:03:04,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:03:04,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:03:04,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:03:04,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:03:04,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:03:04,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:03:04,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:03:04,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:03:04,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:03:04,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:03:04,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:03:04,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:03:04,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:03:04,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:03:04,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:03:04,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:03:04,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:03:04,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:03:04,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:03:04,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:03:04,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:03:04,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:03:04,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:03:04,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:03:04,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:03:04,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:03:04,464 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:03:04,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:03:04,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:03:04,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:03:04,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:03:04,485 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:03:04,485 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:03:04,485 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:03:04,485 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:03:04,485 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:03:04,486 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:03:04,486 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:03:04,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:03:04,486 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:03:04,489 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:03:04,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:03:04,489 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:03:04,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:03:04,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:03:04,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:03:04,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:03:04,490 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:03:04,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:03:04,490 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:03:04,494 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:03:04,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:03:04,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:03:04,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:03:04,495 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:03:04,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:03:04,495 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:03:04,495 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:03:04,497 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:03:04,499 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 -> 595c6555624af5bbcf79585a20acb2500e3eeee8 [2018-11-29 00:03:04,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:03:04,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:03:04,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:03:04,588 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:03:04,589 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:03:04,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c [2018-11-29 00:03:04,659 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26fa06ea/acb2679cf683473ba216fc64585ca05f/FLAG5b8b1fb58 [2018-11-29 00:03:05,146 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:03:05,146 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_true-unreach-call_true-termination.c [2018-11-29 00:03:05,153 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26fa06ea/acb2679cf683473ba216fc64585ca05f/FLAG5b8b1fb58 [2018-11-29 00:03:05,519 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26fa06ea/acb2679cf683473ba216fc64585ca05f [2018-11-29 00:03:05,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:03:05,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:03:05,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:05,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:03:05,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:03:05,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b2a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05, skipping insertion in model container [2018-11-29 00:03:05,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:03:05,569 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:03:05,777 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:05,782 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:03:05,804 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:05,822 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:03:05,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05 WrapperNode [2018-11-29 00:03:05,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:05,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:05,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:03:05,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:03:05,836 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:03:05" (1/1) ... [2018-11-29 00:03:05,843 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:03:05" (1/1) ... [2018-11-29 00:03:05,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:05,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:03:05,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:03:05,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:03:05,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (1/1) ... [2018-11-29 00:03:05,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:03:05,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:03:05,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:03:05,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:03:05,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (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:03:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:03:06,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:03:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-29 00:03:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-29 00:03:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-29 00:03:06,093 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-29 00:03:06,455 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:03:06,455 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:03:06,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06 BoogieIcfgContainer [2018-11-29 00:03:06,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:03:06,457 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:03:06,457 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:03:06,462 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:03:06,463 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:03:05" (1/3) ... [2018-11-29 00:03:06,465 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37835990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:06, skipping insertion in model container [2018-11-29 00:03:06,465 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:05" (2/3) ... [2018-11-29 00:03:06,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37835990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:06, skipping insertion in model container [2018-11-29 00:03:06,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:06,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06" (3/3) ... [2018-11-29 00:03:06,475 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_6_true-unreach-call_true-termination.c [2018-11-29 00:03:06,572 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:03:06,573 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:03:06,573 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:03:06,573 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:03:06,576 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:03:06,576 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:03:06,577 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:03:06,577 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:03:06,577 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:03:06,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:03:06,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:06,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:06,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:06,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:06,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:06,643 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:03:06,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-29 00:03:06,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:06,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:06,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:06,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:06,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:06,658 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2018-11-29 00:03:06,659 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2018-11-29 00:03:06,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2018-11-29 00:03:06,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2018-11-29 00:03:06,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2018-11-29 00:03:06,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:07,295 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-29 00:03:07,415 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:07,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:07,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:07,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:07,417 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:07,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:07,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:07,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:07,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:07,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:07,444 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:07,476 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:07,484 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:07,489 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:07,495 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:07,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:03:07,507 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:07,513 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:07,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:03:07,532 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:07,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:07,812 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:03:07,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,826 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,827 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,869 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#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:03:07,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:07,915 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,915 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=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) [2018-11-29 00:03:07,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:07,951 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:07,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:07,967 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=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) [2018-11-29 00:03:08,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,009 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,023 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:03:08,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,072 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,077 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:03:08,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,105 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:08,132 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:08,156 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:03:08,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:08,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:08,235 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:08,237 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:08,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:08,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:08,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:08,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:08,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:08,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:08,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:08,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:08,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:08,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:08,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:08,254 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:08,262 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:08,268 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:08,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:08,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:08,285 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:08,289 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:08,300 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:08,717 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-29 00:03:09,019 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-29 00:03:09,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:09,050 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:09,053 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:09,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,068 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:09,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,075 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:09,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,082 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:09,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,089 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:09,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,099 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:09,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,108 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:09,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,125 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:09,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:09,136 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:09,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:09,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:09,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:09,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:09,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:09,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:09,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:09,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:09,176 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:09,182 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:09,184 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:09,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:09,188 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:09,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-29 00:03:09,193 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:09,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:09,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:09,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:09,604 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:09,620 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-29 00:03:09,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-11-29 00:03:10,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2018-11-29 00:03:10,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:03:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-29 00:03:10,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:03:10,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-29 00:03:10,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-29 00:03:10,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:10,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2018-11-29 00:03:10,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2018-11-29 00:03:10,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-29 00:03:10,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-29 00:03:10,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-11-29 00:03:10,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:10,073 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-11-29 00:03:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-11-29 00:03:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-11-29 00:03:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-29 00:03:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-11-29 00:03:10,113 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:03:10,113 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-29 00:03:10,114 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:03:10,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2018-11-29 00:03:10,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,119 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2018-11-29 00:03:10,119 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2018-11-29 00:03:10,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2018-11-29 00:03:10,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,269 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:03:10,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:10,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:10,273 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:10,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2018-11-29 00:03:10,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,382 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:03:10,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:10,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:10,384 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:10,390 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-29 00:03:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:10,629 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-11-29 00:03:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:10,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2018-11-29 00:03:10,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2018-11-29 00:03:10,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-29 00:03:10,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-29 00:03:10,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2018-11-29 00:03:10,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:10,638 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-11-29 00:03:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2018-11-29 00:03:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-29 00:03:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-29 00:03:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-11-29 00:03:10,648 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:03:10,648 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-29 00:03:10,648 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:03:10,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-11-29 00:03:10,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-29 00:03:10,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:10,652 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2018-11-29 00:03:10,653 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume !(1 == ~n); 328#L13 call #t~ret0 := fibo2(~n - 1);< 373#fibo2ENTRY ~n := #in~n; 378#L18 assume !(~n < 1); 369#L20 assume !(1 == ~n); 326#L23 call #t~ret2 := fibo1(~n - 1);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume 1 == ~n;#res := 1; 357#fibo1FINAL assume true; 370#fibo1EXIT >#45#return; 346#L23-1 [2018-11-29 00:03:10,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2018-11-29 00:03:10,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,807 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:03:10,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:10,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:10,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:10,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:10,834 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:03:10,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:10,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-29 00:03:10,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:10,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2018-11-29 00:03:10,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,134 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:11,134 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:11,134 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:11,134 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:11,135 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:11,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:11,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:11,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:11,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:11,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:11,138 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:11,142 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:11,144 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:11,152 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:11,157 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:11,161 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:11,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,167 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:11,170 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:11,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:11,237 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:03:11,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,272 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,272 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=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:03:11,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,295 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:03:11,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:11,320 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:12,252 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:12,255 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:12,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:12,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:12,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:12,255 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:12,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:12,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:12,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:12,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:12,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:12,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:12,257 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:12,263 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:12,265 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:12,274 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:12,277 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:12,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:12,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:12,287 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:12,289 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:12,440 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:12,440 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:12,441 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:12,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,450 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:12,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:12,455 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:12,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:12,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:12,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:12,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:12,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:12,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:12,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:12,463 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:12,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:12,468 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:12,468 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:12,469 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:12,469 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:12,469 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-29 00:03:12,470 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:12,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,770 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:03:12,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:12,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-29 00:03:13,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2018-11-29 00:03:13,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-29 00:03:13,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-29 00:03:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2018-11-29 00:03:13,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2018-11-29 00:03:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2018-11-29 00:03:13,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2018-11-29 00:03:13,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-29 00:03:13,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-29 00:03:13,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2018-11-29 00:03:13,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,393 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2018-11-29 00:03:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2018-11-29 00:03:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-11-29 00:03:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-29 00:03:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2018-11-29 00:03:13,414 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2018-11-29 00:03:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:03:13,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:03:13,415 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2018-11-29 00:03:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:13,651 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2018-11-29 00:03:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:03:13,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2018-11-29 00:03:13,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2018-11-29 00:03:13,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-29 00:03:13,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-29 00:03:13,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2018-11-29 00:03:13,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,670 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2018-11-29 00:03:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2018-11-29 00:03:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2018-11-29 00:03:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-29 00:03:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2018-11-29 00:03:13,699 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:03:13,700 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-11-29 00:03:13,700 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:03:13,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2018-11-29 00:03:13,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:13,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:13,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:13,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:03:13,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:03:13,712 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-11-29 00:03:13,712 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-11-29 00:03:13,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2018-11-29 00:03:13,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-29 00:03:13,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:13,858 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:03:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-29 00:03:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:03:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-29 00:03:13,978 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:13,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2018-11-29 00:03:13,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-29 00:03:14,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-29 00:03:14,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:03:14,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-29 00:03:14,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:14,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:14,249 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-29 00:03:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:14,347 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2018-11-29 00:03:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:14,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2018-11-29 00:03:14,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:14,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2018-11-29 00:03:14,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-29 00:03:14,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-29 00:03:14,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2018-11-29 00:03:14,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:14,361 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2018-11-29 00:03:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2018-11-29 00:03:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2018-11-29 00:03:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-29 00:03:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-29 00:03:14,379 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:03:14,379 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-29 00:03:14,379 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:03:14,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2018-11-29 00:03:14,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:03:14,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:14,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:14,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-29 00:03:14,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,396 INFO L794 eck$LassoCheckResult]: Stem: 1902#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 1869#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1873#fibo1ENTRY ~n := #in~n; 1907#L8 assume !(~n < 1); 1868#L10 assume !(1 == ~n); 1854#L13 call #t~ret0 := fibo2(~n - 1);< 1886#fibo2ENTRY ~n := #in~n; 1988#L18 assume !(~n < 1); 1987#L20 assume !(1 == ~n); 1853#L23 call #t~ret2 := fibo1(~n - 1);< 1855#fibo1ENTRY ~n := #in~n; 1935#L8 assume !(~n < 1); 1934#L10 assume !(1 == ~n); 1863#L13 call #t~ret0 := fibo2(~n - 1);< 1932#fibo2ENTRY ~n := #in~n; 1956#L18 assume !(~n < 1); 1946#L20 assume !(1 == ~n); 1892#L23 call #t~ret2 := fibo1(~n - 1);< 1855#fibo1ENTRY ~n := #in~n; 1935#L8 assume !(~n < 1); 1934#L10 assume !(1 == ~n); 1863#L13 call #t~ret0 := fibo2(~n - 1);< 1932#fibo2ENTRY ~n := #in~n; 1956#L18 assume !(~n < 1); 1946#L20 assume 1 == ~n;#res := 1; 1862#fibo2FINAL assume true; 1864#fibo2EXIT >#49#return; 1891#L13-1 call #t~ret1 := fibo2(~n - 2);< 1893#fibo2ENTRY ~n := #in~n; 1904#L18 assume !(~n < 1); 1911#L20 assume !(1 == ~n); 1892#L23 call #t~ret2 := fibo1(~n - 1);< 1855#fibo1ENTRY ~n := #in~n; 1936#L8 assume !(~n < 1); 1942#L10 assume 1 == ~n;#res := 1; 1941#fibo1FINAL assume true; 1937#fibo1EXIT >#45#return; 1927#L23-1 call #t~ret3 := fibo1(~n - 2);< 1872#fibo1ENTRY ~n := #in~n; 1933#L8 assume !(~n < 1); 1930#L10 assume !(1 == ~n); 1851#L13 call #t~ret0 := fibo2(~n - 1);< 1925#fibo2ENTRY ~n := #in~n; 1923#L18 assume !(~n < 1); 1919#L20 assume 1 == ~n;#res := 1; 1875#fibo2FINAL assume true; 1905#fibo2EXIT >#49#return; 1906#L13-1 call #t~ret1 := fibo2(~n - 2);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume ~n < 1;#res := 0; 1914#fibo2FINAL assume true; 1991#fibo2EXIT >#51#return; 1962#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1989#fibo1FINAL assume true; 1981#fibo1EXIT >#47#return; 1978#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1969#fibo2FINAL assume true; 1963#fibo2EXIT >#51#return; 1962#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1989#fibo1FINAL assume true; 1981#fibo1EXIT >#45#return; 1966#L23-1 call #t~ret3 := fibo1(~n - 2);< 1983#fibo1ENTRY ~n := #in~n; 1984#L8 assume !(~n < 1); 1971#L10 assume !(1 == ~n); 1913#L13 call #t~ret0 := fibo2(~n - 1);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume !(~n < 1); 1915#L20 assume 1 == ~n;#res := 1; 1977#fibo2FINAL assume true; 1973#fibo2EXIT >#49#return; 1906#L13-1 call #t~ret1 := fibo2(~n - 2);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume ~n < 1;#res := 0; 1914#fibo2FINAL assume true; 1991#fibo2EXIT >#51#return; 1962#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1989#fibo1FINAL assume true; 1981#fibo1EXIT >#47#return; 1978#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1969#fibo2FINAL assume true; 1963#fibo2EXIT >#49#return; 1906#L13-1 [2018-11-29 00:03:14,396 INFO L796 eck$LassoCheckResult]: Loop: 1906#L13-1 call #t~ret1 := fibo2(~n - 2);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume !(~n < 1); 1915#L20 assume !(1 == ~n); 1965#L23 call #t~ret2 := fibo1(~n - 1);< 1983#fibo1ENTRY ~n := #in~n; 1984#L8 assume !(~n < 1); 1971#L10 assume !(1 == ~n); 1913#L13 call #t~ret0 := fibo2(~n - 1);< 1890#fibo2ENTRY ~n := #in~n; 1912#L18 assume !(~n < 1); 1915#L20 assume 1 == ~n;#res := 1; 1977#fibo2FINAL assume true; 1973#fibo2EXIT >#49#return; 1906#L13-1 [2018-11-29 00:03:14,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2018-11-29 00:03:14,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-29 00:03:14,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:14,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:14,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:14,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:14,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-29 00:03:14,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:14,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-29 00:03:14,743 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:14,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2018-11-29 00:03:14,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:14,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:15,006 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,007 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:15,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,009 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,009 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,009 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:15,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,011 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:15,015 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:15,019 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:15,022 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:15,045 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:15,070 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:15,101 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:15,164 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:15,166 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:15,308 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:15,308 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,322 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,322 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,349 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:03:15,372 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,372 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,375 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=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) [2018-11-29 00:03:15,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,397 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,400 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,426 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,426 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:15,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:03:15,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:15,480 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:03:15,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:15,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:17,116 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:17,118 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:17,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:17,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:17,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:17,118 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:17,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:17,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:17,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:17,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:17,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:17,120 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:17,124 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:17,126 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:17,129 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:17,131 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:17,136 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:17,138 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:17,156 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:17,158 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:17,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:17,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:17,286 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:17,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,294 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:17,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,302 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:17,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,311 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:17,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,319 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:17,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,326 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:17,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,333 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:17,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,343 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:17,348 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:17,349 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:17,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:17,349 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:17,350 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:17,350 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-29 00:03:17,350 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:17,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,047 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:03:18,048 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:18,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:18,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 879 states and 1167 transitions. Complement of second has 26 states. [2018-11-29 00:03:18,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-29 00:03:18,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:18,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:18,605 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:18,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:19,050 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:03:19,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:19,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:19,737 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 669 states and 942 transitions. Complement of second has 24 states. [2018-11-29 00:03:19,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-29 00:03:19,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:19,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:19,744 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:19,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,468 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:03:21,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 7 loop predicates [2018-11-29 00:03:21,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-29 00:03:22,068 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1660 states and 2156 transitions. Complement of second has 90 states. [2018-11-29 00:03:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-29 00:03:22,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2018-11-29 00:03:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2018-11-29 00:03:22,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2018-11-29 00:03:22,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:22,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2018-11-29 00:03:22,124 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-29 00:03:22,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2018-11-29 00:03:22,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-11-29 00:03:22,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2018-11-29 00:03:22,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2018-11-29 00:03:22,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:22,169 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2018-11-29 00:03:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2018-11-29 00:03:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2018-11-29 00:03:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-29 00:03:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2018-11-29 00:03:22,289 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2018-11-29 00:03:22,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-29 00:03:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-29 00:03:22,290 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 14 states. [2018-11-29 00:03:22,719 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:23,340 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:23,729 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-29 00:03:24,218 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-29 00:03:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:24,658 INFO L93 Difference]: Finished difference Result 1364 states and 1982 transitions. [2018-11-29 00:03:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-29 00:03:24,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1364 states and 1982 transitions. [2018-11-29 00:03:24,679 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2018-11-29 00:03:24,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1364 states to 835 states and 1100 transitions. [2018-11-29 00:03:24,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2018-11-29 00:03:24,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2018-11-29 00:03:24,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 835 states and 1100 transitions. [2018-11-29 00:03:24,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:24,693 INFO L705 BuchiCegarLoop]: Abstraction has 835 states and 1100 transitions. [2018-11-29 00:03:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states and 1100 transitions. [2018-11-29 00:03:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 811. [2018-11-29 00:03:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-11-29 00:03:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1054 transitions. [2018-11-29 00:03:24,728 INFO L728 BuchiCegarLoop]: Abstraction has 811 states and 1054 transitions. [2018-11-29 00:03:24,728 INFO L608 BuchiCegarLoop]: Abstraction has 811 states and 1054 transitions. [2018-11-29 00:03:24,728 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:24,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 811 states and 1054 transitions. [2018-11-29 00:03:24,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-29 00:03:24,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:24,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:24,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:24,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:24,741 INFO L794 eck$LassoCheckResult]: Stem: 9041#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 8989#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8990#fibo1ENTRY ~n := #in~n; 9226#L8 assume !(~n < 1); 9220#L10 assume !(1 == ~n); 8992#L13 call #t~ret0 := fibo2(~n - 1);< 9210#fibo2ENTRY ~n := #in~n; 9211#L18 assume !(~n < 1); 9207#L20 assume !(1 == ~n); 9204#L23 call #t~ret2 := fibo1(~n - 1);< 9206#fibo1ENTRY ~n := #in~n; 9228#L8 assume !(~n < 1); 9222#L10 assume !(1 == ~n); 9168#L13 call #t~ret0 := fibo2(~n - 1);< 9217#fibo2ENTRY ~n := #in~n; 9230#L18 assume !(~n < 1); 9225#L20 assume !(1 == ~n); 9205#L23 call #t~ret2 := fibo1(~n - 1);< 9206#fibo1ENTRY ~n := #in~n; 9233#L8 assume !(~n < 1); 9256#L10 assume 1 == ~n;#res := 1; 9254#fibo1FINAL assume true; 9255#fibo1EXIT >#45#return; 9163#L23-1 call #t~ret3 := fibo1(~n - 2);< 9710#fibo1ENTRY ~n := #in~n; 9729#L8 assume ~n < 1;#res := 0; 9728#fibo1FINAL assume true; 9724#fibo1EXIT >#47#return; 9721#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9719#fibo2FINAL assume true; 9714#fibo2EXIT >#49#return; 9387#L13-1 [2018-11-29 00:03:24,741 INFO L796 eck$LassoCheckResult]: Loop: 9387#L13-1 call #t~ret1 := fibo2(~n - 2);< 9460#fibo2ENTRY ~n := #in~n; 9459#L18 assume !(~n < 1); 9440#L20 assume !(1 == ~n); 9013#L23 call #t~ret2 := fibo1(~n - 1);< 9376#fibo1ENTRY ~n := #in~n; 9359#L8 assume !(~n < 1); 9354#L10 assume !(1 == ~n); 9356#L13 call #t~ret0 := fibo2(~n - 1);< 9697#fibo2ENTRY ~n := #in~n; 9701#L18 assume !(~n < 1); 9700#L20 assume 1 == ~n;#res := 1; 9699#fibo2FINAL assume true; 9695#fibo2EXIT >#49#return; 9011#L13-1 call #t~ret1 := fibo2(~n - 2);< 9014#fibo2ENTRY ~n := #in~n; 9042#L18 assume ~n < 1;#res := 0; 9052#fibo2FINAL assume true; 9744#fibo2EXIT >#51#return; 9743#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9742#fibo1FINAL assume true; 9733#fibo1EXIT >#45#return; 9006#L23-1 call #t~ret3 := fibo1(~n - 2);< 8966#fibo1ENTRY ~n := #in~n; 9705#L8 assume !(~n < 1); 9703#L10 assume !(1 == ~n); 8965#L13 call #t~ret0 := fibo2(~n - 1);< 9008#fibo2ENTRY ~n := #in~n; 9707#L18 assume !(~n < 1); 9054#L20 assume 1 == ~n;#res := 1; 9055#fibo2FINAL assume true; 9716#fibo2EXIT >#49#return; 9387#L13-1 [2018-11-29 00:03:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2018-11-29 00:03:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:25,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:25,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:25,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:25,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:25,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-29 00:03:25,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:25,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 1 times [2018-11-29 00:03:25,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:25,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-29 00:03:25,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:25,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:25,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:25,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:25,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-29 00:03:25,455 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-29 00:03:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-29 00:03:25,456 INFO L87 Difference]: Start difference. First operand 811 states and 1054 transitions. cyclomatic complexity: 259 Second operand 13 states. [2018-11-29 00:03:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:26,045 INFO L93 Difference]: Finished difference Result 974 states and 1340 transitions. [2018-11-29 00:03:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-29 00:03:26,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 974 states and 1340 transitions. [2018-11-29 00:03:26,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2018-11-29 00:03:26,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 974 states to 971 states and 1336 transitions. [2018-11-29 00:03:26,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 483 [2018-11-29 00:03:26,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 483 [2018-11-29 00:03:26,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 971 states and 1336 transitions. [2018-11-29 00:03:26,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:26,080 INFO L705 BuchiCegarLoop]: Abstraction has 971 states and 1336 transitions. [2018-11-29 00:03:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states and 1336 transitions. [2018-11-29 00:03:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 831. [2018-11-29 00:03:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-11-29 00:03:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1086 transitions. [2018-11-29 00:03:26,115 INFO L728 BuchiCegarLoop]: Abstraction has 831 states and 1086 transitions. [2018-11-29 00:03:26,115 INFO L608 BuchiCegarLoop]: Abstraction has 831 states and 1086 transitions. [2018-11-29 00:03:26,115 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:03:26,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1086 transitions. [2018-11-29 00:03:26,124 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 93 [2018-11-29 00:03:26,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:26,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:26,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:26,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:26,127 INFO L794 eck$LassoCheckResult]: Stem: 11033#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 10998#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10999#fibo1ENTRY ~n := #in~n; 11238#L8 assume !(~n < 1); 11237#L10 assume !(1 == ~n); 11226#L13 call #t~ret0 := fibo2(~n - 1);< 11233#fibo2ENTRY ~n := #in~n; 11230#L18 assume !(~n < 1); 11227#L20 assume !(1 == ~n); 11017#L23 call #t~ret2 := fibo1(~n - 1);< 11225#fibo1ENTRY ~n := #in~n; 11223#L8 assume !(~n < 1); 11220#L10 assume !(1 == ~n); 11077#L13 call #t~ret0 := fibo2(~n - 1);< 11212#fibo2ENTRY ~n := #in~n; 11208#L18 assume !(~n < 1); 11209#L20 assume !(1 == ~n); 11213#L23 call #t~ret2 := fibo1(~n - 1);< 11234#fibo1ENTRY ~n := #in~n; 11231#L8 assume !(~n < 1); 11228#L10 assume !(1 == ~n); 11076#L13 call #t~ret0 := fibo2(~n - 1);< 11212#fibo2ENTRY ~n := #in~n; 11208#L18 assume !(~n < 1); 11209#L20 assume !(1 == ~n); 11213#L23 call #t~ret2 := fibo1(~n - 1);< 11234#fibo1ENTRY ~n := #in~n; 11235#L8 assume !(~n < 1); 11260#L10 assume 1 == ~n;#res := 1; 11261#fibo1FINAL assume true; 11456#fibo1EXIT >#45#return; 11057#L23-1 call #t~ret3 := fibo1(~n - 2);< 11446#fibo1ENTRY ~n := #in~n; 11467#L8 assume ~n < 1;#res := 0; 11453#fibo1FINAL assume true; 11444#fibo1EXIT >#47#return; 11445#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11506#fibo2FINAL assume true; 11417#fibo2EXIT >#49#return; 11304#L13-1 [2018-11-29 00:03:26,127 INFO L796 eck$LassoCheckResult]: Loop: 11304#L13-1 call #t~ret1 := fibo2(~n - 2);< 11307#fibo2ENTRY ~n := #in~n; 11306#L18 assume !(~n < 1); 11305#L20 assume !(1 == ~n); 11295#L23 call #t~ret2 := fibo1(~n - 1);< 11301#fibo1ENTRY ~n := #in~n; 11300#L8 assume !(~n < 1); 11297#L10 assume 1 == ~n;#res := 1; 11298#fibo1FINAL assume true; 11472#fibo1EXIT >#45#return; 11426#L23-1 call #t~ret3 := fibo1(~n - 2);< 11448#fibo1ENTRY ~n := #in~n; 11458#L8 assume !(~n < 1); 11454#L10 assume !(1 == ~n); 11420#L13 call #t~ret0 := fibo2(~n - 1);< 11431#fibo2ENTRY ~n := #in~n; 11465#L18 assume !(~n < 1); 11452#L20 assume 1 == ~n;#res := 1; 11443#fibo2FINAL assume true; 11425#fibo2EXIT >#49#return; 11304#L13-1 [2018-11-29 00:03:26,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 2 times [2018-11-29 00:03:26,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:26,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:26,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:26,400 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:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:26,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:26,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:26,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:26,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:26,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2018-11-29 00:03:26,753 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:26,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 534326566, now seen corresponding path program 1 times [2018-11-29 00:03:26,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-29 00:03:26,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:26,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:26,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:26,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:26,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:26,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-29 00:03:26,917 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:03:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:03:26,917 INFO L87 Difference]: Start difference. First operand 831 states and 1086 transitions. cyclomatic complexity: 271 Second operand 7 states. [2018-11-29 00:03:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:27,068 INFO L93 Difference]: Finished difference Result 1019 states and 1344 transitions. [2018-11-29 00:03:27,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:03:27,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1019 states and 1344 transitions. [2018-11-29 00:03:27,082 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-29 00:03:27,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1019 states to 1004 states and 1323 transitions. [2018-11-29 00:03:27,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2018-11-29 00:03:27,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2018-11-29 00:03:27,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1004 states and 1323 transitions. [2018-11-29 00:03:27,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:27,101 INFO L705 BuchiCegarLoop]: Abstraction has 1004 states and 1323 transitions. [2018-11-29 00:03:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states and 1323 transitions. [2018-11-29 00:03:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 935. [2018-11-29 00:03:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2018-11-29 00:03:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1236 transitions. [2018-11-29 00:03:27,141 INFO L728 BuchiCegarLoop]: Abstraction has 935 states and 1236 transitions. [2018-11-29 00:03:27,141 INFO L608 BuchiCegarLoop]: Abstraction has 935 states and 1236 transitions. [2018-11-29 00:03:27,141 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:03:27,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 935 states and 1236 transitions. [2018-11-29 00:03:27,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-29 00:03:27,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:27,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:27,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:27,154 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-29 00:03:27,154 INFO L794 eck$LassoCheckResult]: Stem: 13077#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 13044#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13045#fibo1ENTRY ~n := #in~n; 13299#L8 assume !(~n < 1); 13298#L10 assume !(1 == ~n); 13294#L13 call #t~ret0 := fibo2(~n - 1);< 13297#fibo2ENTRY ~n := #in~n; 13296#L18 assume !(~n < 1); 13295#L20 assume !(1 == ~n); 13270#L23 call #t~ret2 := fibo1(~n - 1);< 13293#fibo1ENTRY ~n := #in~n; 13292#L8 assume !(~n < 1); 13291#L10 assume !(1 == ~n); 13047#L13 call #t~ret0 := fibo2(~n - 1);< 13269#fibo2ENTRY ~n := #in~n; 13266#L18 assume !(~n < 1); 13267#L20 assume !(1 == ~n); 13271#L23 call #t~ret2 := fibo1(~n - 1);< 13287#fibo1ENTRY ~n := #in~n; 13283#L8 assume !(~n < 1); 13279#L10 assume !(1 == ~n); 13048#L13 call #t~ret0 := fibo2(~n - 1);< 13269#fibo2ENTRY ~n := #in~n; 13266#L18 assume !(~n < 1); 13267#L20 assume !(1 == ~n); 13271#L23 call #t~ret2 := fibo1(~n - 1);< 13287#fibo1ENTRY ~n := #in~n; 13288#L8 assume !(~n < 1); 13328#L10 assume 1 == ~n;#res := 1; 13329#fibo1FINAL assume true; 13901#fibo1EXIT >#45#return; 13888#L23-1 call #t~ret3 := fibo1(~n - 2);< 13889#fibo1ENTRY ~n := #in~n; 13900#L8 assume ~n < 1;#res := 0; 13899#fibo1FINAL assume true; 13887#fibo1EXIT >#47#return; 13881#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13875#fibo2FINAL assume true; 13874#fibo2EXIT >#49#return; 13422#L13-1 [2018-11-29 00:03:27,155 INFO L796 eck$LassoCheckResult]: Loop: 13422#L13-1 call #t~ret1 := fibo2(~n - 2);< 13426#fibo2ENTRY ~n := #in~n; 13425#L18 assume !(~n < 1); 13424#L20 assume !(1 == ~n); 13057#L23 call #t~ret2 := fibo1(~n - 1);< 13420#fibo1ENTRY ~n := #in~n; 13419#L8 assume !(~n < 1); 13417#L10 assume !(1 == ~n); 13056#L13 call #t~ret0 := fibo2(~n - 1);< 13058#fibo2ENTRY ~n := #in~n; 13844#L18 assume !(~n < 1); 13095#L20 assume 1 == ~n;#res := 1; 13096#fibo2FINAL assume true; 13847#fibo2EXIT >#49#return; 13064#L13-1 call #t~ret1 := fibo2(~n - 2);< 13066#fibo2ENTRY ~n := #in~n; 13078#L18 assume ~n < 1;#res := 0; 13093#fibo2FINAL assume true; 13919#fibo2EXIT >#51#return; 13917#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13916#fibo1FINAL assume true; 13897#fibo1EXIT >#45#return; 13824#L23-1 call #t~ret3 := fibo1(~n - 2);< 13023#fibo1ENTRY ~n := #in~n; 13827#L8 assume !(~n < 1); 13825#L10 assume !(1 == ~n); 13022#L13 call #t~ret0 := fibo2(~n - 1);< 13821#fibo2ENTRY ~n := #in~n; 13820#L18 assume !(~n < 1); 13818#L20 assume !(1 == ~n); 13021#L23 call #t~ret2 := fibo1(~n - 1);< 13023#fibo1ENTRY ~n := #in~n; 13827#L8 assume !(~n < 1); 13825#L10 assume !(1 == ~n); 13022#L13 call #t~ret0 := fibo2(~n - 1);< 13821#fibo2ENTRY ~n := #in~n; 13820#L18 assume !(~n < 1); 13818#L20 assume 1 == ~n;#res := 1; 13819#fibo2FINAL assume true; 13867#fibo2EXIT >#49#return; 13422#L13-1 call #t~ret1 := fibo2(~n - 2);< 13866#fibo2ENTRY ~n := #in~n; 13913#L18 assume ~n < 1;#res := 0; 13911#fibo2FINAL assume true; 13910#fibo2EXIT >#51#return; 13906#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13903#fibo1FINAL assume true; 13890#fibo1EXIT >#45#return; 13824#L23-1 call #t~ret3 := fibo1(~n - 2);< 13023#fibo1ENTRY ~n := #in~n; 13827#L8 assume !(~n < 1); 13825#L10 assume 1 == ~n;#res := 1; 13826#fibo1FINAL assume true; 13892#fibo1EXIT >#47#return; 13886#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13880#fibo2FINAL assume true; 13873#fibo2EXIT >#49#return; 13422#L13-1 [2018-11-29 00:03:27,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1646893086, now seen corresponding path program 3 times [2018-11-29 00:03:27,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:27,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:27,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:27,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:03:27,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-29 00:03:27,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:27,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:27,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:27,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2018-11-29 00:03:27,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:27,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1765387140, now seen corresponding path program 1 times [2018-11-29 00:03:27,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:27,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-29 00:03:27,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:27,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:27,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:27,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 61 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-29 00:03:27,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2018-11-29 00:03:27,875 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:03:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:03:27,876 INFO L87 Difference]: Start difference. First operand 935 states and 1236 transitions. cyclomatic complexity: 317 Second operand 20 states. [2018-11-29 00:03:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:28,733 INFO L93 Difference]: Finished difference Result 988 states and 1194 transitions. [2018-11-29 00:03:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-29 00:03:28,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1194 transitions. [2018-11-29 00:03:28,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2018-11-29 00:03:28,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 529 states and 608 transitions. [2018-11-29 00:03:28,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2018-11-29 00:03:28,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2018-11-29 00:03:28,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 608 transitions. [2018-11-29 00:03:28,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:28,757 INFO L705 BuchiCegarLoop]: Abstraction has 529 states and 608 transitions. [2018-11-29 00:03:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 608 transitions. [2018-11-29 00:03:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 446. [2018-11-29 00:03:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-11-29 00:03:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 512 transitions. [2018-11-29 00:03:28,776 INFO L728 BuchiCegarLoop]: Abstraction has 446 states and 512 transitions. [2018-11-29 00:03:28,776 INFO L608 BuchiCegarLoop]: Abstraction has 446 states and 512 transitions. [2018-11-29 00:03:28,776 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:03:28,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 446 states and 512 transitions. [2018-11-29 00:03:28,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 69 [2018-11-29 00:03:28,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:28,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:28,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:28,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:28,783 INFO L794 eck$LassoCheckResult]: Stem: 15355#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 15319#L37 call main_#t~ret4 := fibo1(main_~x~0);< 15320#fibo1ENTRY ~n := #in~n; 15470#L8 assume !(~n < 1); 15468#L10 assume !(1 == ~n); 15450#L13 call #t~ret0 := fibo2(~n - 1);< 15455#fibo2ENTRY ~n := #in~n; 15484#L18 assume !(~n < 1); 15479#L20 assume !(1 == ~n); 15458#L23 call #t~ret2 := fibo1(~n - 1);< 15477#fibo1ENTRY ~n := #in~n; 15462#L8 assume !(~n < 1); 15461#L10 assume !(1 == ~n); 15443#L13 call #t~ret0 := fibo2(~n - 1);< 15459#fibo2ENTRY ~n := #in~n; 15657#L18 assume !(~n < 1); 15658#L20 assume !(1 == ~n); 15520#L23 call #t~ret2 := fibo1(~n - 1);< 15521#fibo1ENTRY ~n := #in~n; 15595#L8 assume !(~n < 1); 15596#L10 assume !(1 == ~n); 15585#L13 call #t~ret0 := fibo2(~n - 1);< 15586#fibo2ENTRY ~n := #in~n; 15602#L18 assume !(~n < 1); 15593#L20 assume 1 == ~n;#res := 1; 15594#fibo2FINAL assume true; 15584#fibo2EXIT >#49#return; 15582#L13-1 call #t~ret1 := fibo2(~n - 2);< 15669#fibo2ENTRY ~n := #in~n; 15671#L18 assume ~n < 1;#res := 0; 15581#fibo2FINAL assume true; 15583#fibo2EXIT >#51#return; 15573#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15574#fibo1FINAL assume true; 15519#fibo1EXIT >#45#return; 15436#L23-1 call #t~ret3 := fibo1(~n - 2);< 15315#fibo1ENTRY ~n := #in~n; 15440#L8 assume !(~n < 1); 15435#L10 assume !(1 == ~n); 15314#L13 call #t~ret0 := fibo2(~n - 1);< 15430#fibo2ENTRY ~n := #in~n; 15427#L18 assume !(~n < 1); 15428#L20 assume 1 == ~n;#res := 1; 15460#fibo2FINAL assume true; 15445#fibo2EXIT >#49#return; 15327#L13-1 [2018-11-29 00:03:28,784 INFO L796 eck$LassoCheckResult]: Loop: 15327#L13-1 call #t~ret1 := fibo2(~n - 2);< 15425#fibo2ENTRY ~n := #in~n; 15420#L18 assume !(~n < 1); 15416#L20 assume !(1 == ~n); 15417#L23 call #t~ret2 := fibo1(~n - 1);< 15487#fibo1ENTRY ~n := #in~n; 15503#L8 assume !(~n < 1); 15501#L10 assume !(1 == ~n); 15499#L13 call #t~ret0 := fibo2(~n - 1);< 15500#fibo2ENTRY ~n := #in~n; 15518#L18 assume !(~n < 1); 15511#L20 assume 1 == ~n;#res := 1; 15504#fibo2FINAL assume true; 15498#fibo2EXIT >#49#return; 15495#L13-1 call #t~ret1 := fibo2(~n - 2);< 15497#fibo2ENTRY ~n := #in~n; 15507#L18 assume ~n < 1;#res := 0; 15505#fibo2FINAL assume true; 15493#fibo2EXIT >#51#return; 15492#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15491#fibo1FINAL assume true; 15485#fibo1EXIT >#45#return; 15453#L23-1 call #t~ret3 := fibo1(~n - 2);< 15483#fibo1ENTRY ~n := #in~n; 15546#L8 assume !(~n < 1); 15465#L10 assume !(1 == ~n); 15326#L13 call #t~ret0 := fibo2(~n - 1);< 15454#fibo2ENTRY ~n := #in~n; 15490#L18 assume !(~n < 1); 15488#L20 assume 1 == ~n;#res := 1; 15489#fibo2FINAL assume true; 15545#fibo2EXIT >#49#return; 15327#L13-1 [2018-11-29 00:03:28,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1947124180, now seen corresponding path program 1 times [2018-11-29 00:03:28,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:28,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:28,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:28,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-29 00:03:29,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:29,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:29,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:29,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:29,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 18 [2018-11-29 00:03:29,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:29,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 2 times [2018-11-29 00:03:29,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:29,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-29 00:03:29,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:29,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:29,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:03:29,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:03:29,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:03:29,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:29,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:29,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-29 00:03:29,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:03:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:03:29,584 INFO L87 Difference]: Start difference. First operand 446 states and 512 transitions. cyclomatic complexity: 74 Second operand 10 states. [2018-11-29 00:03:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:29,870 INFO L93 Difference]: Finished difference Result 364 states and 423 transitions. [2018-11-29 00:03:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:03:29,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 364 states and 423 transitions. [2018-11-29 00:03:29,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-29 00:03:29,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 364 states to 243 states and 288 transitions. [2018-11-29 00:03:29,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-29 00:03:29,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2018-11-29 00:03:29,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 288 transitions. [2018-11-29 00:03:29,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:29,879 INFO L705 BuchiCegarLoop]: Abstraction has 243 states and 288 transitions. [2018-11-29 00:03:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 288 transitions. [2018-11-29 00:03:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-11-29 00:03:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-29 00:03:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2018-11-29 00:03:29,889 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 272 transitions. [2018-11-29 00:03:29,889 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 272 transitions. [2018-11-29 00:03:29,889 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:03:29,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 272 transitions. [2018-11-29 00:03:29,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-29 00:03:29,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:29,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:29,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:29,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:29,895 INFO L794 eck$LassoCheckResult]: Stem: 16429#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 6; 16378#L37 call main_#t~ret4 := fibo1(main_~x~0);< 16379#fibo1ENTRY ~n := #in~n; 16526#L8 assume !(~n < 1); 16525#L10 assume !(1 == ~n); 16502#L13 call #t~ret0 := fibo2(~n - 1);< 16523#fibo2ENTRY ~n := #in~n; 16522#L18 assume !(~n < 1); 16501#L20 assume !(1 == ~n); 16503#L23 call #t~ret2 := fibo1(~n - 1);< 16517#fibo1ENTRY ~n := #in~n; 16516#L8 assume !(~n < 1); 16515#L10 assume !(1 == ~n); 16511#L13 call #t~ret0 := fibo2(~n - 1);< 16514#fibo2ENTRY ~n := #in~n; 16513#L18 assume !(~n < 1); 16512#L20 assume !(1 == ~n); 16415#L23 call #t~ret2 := fibo1(~n - 1);< 16510#fibo1ENTRY ~n := #in~n; 16509#L8 assume !(~n < 1); 16508#L10 assume !(1 == ~n); 16414#L13 call #t~ret0 := fibo2(~n - 1);< 16416#fibo2ENTRY ~n := #in~n; 16529#L18 assume !(~n < 1); 16528#L20 assume 1 == ~n;#res := 1; 16527#fibo2FINAL assume true; 16524#fibo2EXIT >#49#return; 16519#L13-1 call #t~ret1 := fibo2(~n - 2);< 16518#fibo2ENTRY ~n := #in~n; 16520#L18 assume ~n < 1;#res := 0; 16558#fibo2FINAL assume true; 16557#fibo2EXIT >#51#return; 16556#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16555#fibo1FINAL assume true; 16554#fibo1EXIT >#45#return; 16552#L23-1 call #t~ret3 := fibo1(~n - 2);< 16553#fibo1ENTRY ~n := #in~n; 16564#L8 assume ~n < 1;#res := 0; 16560#fibo1FINAL assume true; 16551#fibo1EXIT >#47#return; 16550#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 16549#fibo2FINAL assume true; 16548#fibo2EXIT >#49#return; 16404#L13-1 call #t~ret1 := fibo2(~n - 2);< 16420#fibo2ENTRY ~n := #in~n; 16436#L18 assume !(~n < 1); 16448#L20 assume !(1 == ~n); 16418#L23 call #t~ret2 := fibo1(~n - 1);< 16575#fibo1ENTRY ~n := #in~n; 16593#L8 assume !(~n < 1); 16592#L10 assume !(1 == ~n); 16496#L13 call #t~ret0 := fibo2(~n - 1);< 16538#fibo2ENTRY ~n := #in~n; 16495#L18 assume !(~n < 1); 16497#L20 assume !(1 == ~n); 16409#L23 call #t~ret2 := fibo1(~n - 1);< 16493#fibo1ENTRY [2018-11-29 00:03:29,895 INFO L796 eck$LassoCheckResult]: Loop: 16493#fibo1ENTRY ~n := #in~n; 16492#L8 assume !(~n < 1); 16490#L10 assume !(1 == ~n); 16485#L13 call #t~ret0 := fibo2(~n - 1);< 16486#fibo2ENTRY ~n := #in~n; 16491#L18 assume !(~n < 1); 16489#L20 assume !(1 == ~n); 16410#L23 call #t~ret2 := fibo1(~n - 1);< 16493#fibo1ENTRY [2018-11-29 00:03:29,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1585247159, now seen corresponding path program 1 times [2018-11-29 00:03:29,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:29,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:29,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:29,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,340 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-29 00:03:30,659 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-11-29 00:03:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-29 00:03:30,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:30,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:30,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:30,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-29 00:03:31,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:31,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2018-11-29 00:03:31,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:31,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 2 times [2018-11-29 00:03:31,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:31,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:31,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:31,099 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:31,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:31,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:31,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:31,100 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:31,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:31,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:31,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:31,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration10_Loop [2018-11-29 00:03:31,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:31,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:31,102 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:31,112 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:31,114 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:31,117 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:31,119 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:31,122 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:31,124 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:31,127 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:31,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:03:31,136 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:31,180 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:31,180 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:31,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:31,185 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:31,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:31,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:31,260 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:31,262 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:31,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:31,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:31,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:31,262 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:31,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:31,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:31,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:31,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6_true-unreach-call_true-termination.c_Iteration10_Loop [2018-11-29 00:03:31,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:31,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:31,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:31,271 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:31,273 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:31,276 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:31,279 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:31,285 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:31,287 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:31,288 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:31,292 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:31,294 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:31,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:31,340 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:31,341 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:31,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:31,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:31,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:31,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:31,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:31,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:31,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:31,352 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:31,353 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:31,353 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:31,356 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:31,356 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:31,357 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:31,357 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-29 00:03:31,357 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:31,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:31,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:31,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:31,573 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:31,573 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:03:31,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44 Second operand 7 states. [2018-11-29 00:03:31,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44. Second operand 7 states. Result 251 states and 292 transitions. Complement of second has 22 states. [2018-11-29 00:03:31,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-29 00:03:31,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 56 letters. Loop has 8 letters. [2018-11-29 00:03:31,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:31,710 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:31,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:31,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:31,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:31,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:03:31,942 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:03:31,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44 Second operand 7 states. [2018-11-29 00:03:32,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44. Second operand 7 states. Result 251 states and 292 transitions. Complement of second has 22 states. [2018-11-29 00:03:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-29 00:03:32,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 56 letters. Loop has 8 letters. [2018-11-29 00:03:32,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:32,167 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:32,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:32,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:32,503 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-29 00:03:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:32,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:32,559 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:32,559 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:03:32,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44 Second operand 7 states. [2018-11-29 00:03:32,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 272 transitions. cyclomatic complexity: 44. Second operand 7 states. Result 470 states and 541 transitions. Complement of second has 27 states. [2018-11-29 00:03:32,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-29 00:03:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 56 letters. Loop has 8 letters. [2018-11-29 00:03:32,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:32,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-29 00:03:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:32,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 56 letters. Loop has 16 letters. [2018-11-29 00:03:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:32,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 541 transitions. [2018-11-29 00:03:32,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:32,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 0 states and 0 transitions. [2018-11-29 00:03:32,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:32,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:32,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:32,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:32,902 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:32,902 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-29 00:03:32,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-11-29 00:03:32,907 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 18 states. [2018-11-29 00:03:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:32,907 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:03:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:03:32,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:03:32,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:32,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:03:32,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:32,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:32,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:32,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:32,908 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:32,914 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:32,914 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:32,914 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:03:32,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:32,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:32,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:32 BoogieIcfgContainer [2018-11-29 00:03:32,928 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:32,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:32,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:32,929 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:32,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:06" (3/4) ... [2018-11-29 00:03:32,937 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:32,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:32,939 INFO L168 Benchmark]: Toolchain (without parser) took 27415.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 950.0 MB in the beginning and 1.3 GB in the end (delta: -391.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:32,942 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:32,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.11 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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:32,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:32,944 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:32,944 INFO L168 Benchmark]: RCFGBuilder took 554.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:32,945 INFO L168 Benchmark]: BuchiAutomizer took 26471.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -228.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:32,951 INFO L168 Benchmark]: Witness Printer took 9.79 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:32,960 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 297.11 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 47.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 554.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26471.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -228.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.79 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (9 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 9 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.3s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 12.6s. Construction of modules took 4.4s. Büchi inclusion checks took 8.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 534 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 935 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 338 SDtfs, 741 SDslu, 842 SDs, 0 SdLazy, 1893 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI6 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...