./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive/Fibonacci02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 675300a4b632e073b31d1e86ab5660e0c5ab887b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:59:43,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:59:43,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:59:43,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:59:43,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:59:43,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:59:43,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:59:43,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:59:43,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:59:43,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:59:43,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:59:43,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:59:43,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:59:43,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:59:43,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:59:43,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:59:43,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:59:43,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:59:43,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:59:43,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:59:43,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:59:43,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:59:43,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:59:43,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:59:43,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:59:43,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:59:43,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:59:43,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:59:43,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:59:43,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:59:43,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:59:43,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:59:43,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:59:43,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:59:43,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:59:43,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:59:43,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:59:43,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:59:43,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:59:43,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:59:43,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:59:43,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:59:43,749 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:59:43,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:59:43,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:59:43,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:59:43,752 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:59:43,752 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:59:43,752 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:59:43,753 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:59:43,753 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:59:43,753 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:59:43,754 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:59:43,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:59:43,755 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:59:43,755 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:59:43,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:59:43,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:59:43,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:59:43,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:59:43,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:59:43,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:59:43,757 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:59:43,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:59:43,757 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:59:43,757 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:59:43,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:59:43,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:59:43,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:59:43,759 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:59:43,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:59:43,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:59:43,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:59:43,759 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:59:43,761 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:59:43,761 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 675300a4b632e073b31d1e86ab5660e0c5ab887b [2020-10-20 07:59:44,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:59:44,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:59:44,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:59:44,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:59:44,057 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:59:44,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2020-10-20 07:59:44,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246611b85/6a23db09deeb49bf9013d055f0a51c63/FLAGa3e58b4c6 [2020-10-20 07:59:44,743 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:59:44,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2020-10-20 07:59:44,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246611b85/6a23db09deeb49bf9013d055f0a51c63/FLAGa3e58b4c6 [2020-10-20 07:59:45,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246611b85/6a23db09deeb49bf9013d055f0a51c63 [2020-10-20 07:59:45,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:59:45,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:59:45,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:59:45,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:59:45,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:59:45,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3577a696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45, skipping insertion in model container [2020-10-20 07:59:45,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:59:45,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:59:45,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:59:45,405 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:59:45,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:59:45,447 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:59:45,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45 WrapperNode [2020-10-20 07:59:45,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:59:45,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:59:45,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:59:45,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:59:45,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:59:45,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:59:45,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:59:45,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:59:45,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (1/1) ... [2020-10-20 07:59:45,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:59:45,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:59:45,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:59:45,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:59:45,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (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 [2020-10-20 07:59:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-10-20 07:59:45,593 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-10-20 07:59:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:59:45,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:59:45,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:59:45,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:59:45,867 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:59:45,868 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 07:59:45,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:59:45 BoogieIcfgContainer [2020-10-20 07:59:45,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:59:45,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:59:45,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:59:45,875 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:59:45,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:59:45,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:59:45" (1/3) ... [2020-10-20 07:59:45,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76733135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:59:45, skipping insertion in model container [2020-10-20 07:59:45,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:59:45,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:59:45" (2/3) ... [2020-10-20 07:59:45,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76733135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:59:45, skipping insertion in model container [2020-10-20 07:59:45,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:59:45,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:59:45" (3/3) ... [2020-10-20 07:59:45,883 INFO L373 chiAutomizerObserver]: Analyzing ICFG Fibonacci02.c [2020-10-20 07:59:45,970 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:59:45,971 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:59:45,971 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:59:45,971 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:59:45,971 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:59:45,971 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:59:45,971 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:59:45,972 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:59:45,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 07:59:46,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:59:46,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:46,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:46,047 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:59:46,047 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:59:46,048 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:59:46,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 07:59:46,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:59:46,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:46,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:46,052 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:59:46,053 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:59:46,064 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 13#L-1true havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 9#L29true call main_#t~ret9 := fibonacci(main_~x~0);< 18#fibonacciENTRYtrue [2020-10-20 07:59:46,064 INFO L796 eck$LassoCheckResult]: Loop: 18#fibonacciENTRYtrue ~n := #in~n; 8#L17true assume !(~n < 1); 12#L19true assume !(1 == ~n); 16#L22true call #t~ret7 := fibonacci(~n - 1);< 18#fibonacciENTRYtrue [2020-10-20 07:59:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash 42783, now seen corresponding path program 1 times [2020-10-20 07:59:46,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:46,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970182496] [2020-10-20 07:59:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:46,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:46,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:46,266 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 1 times [2020-10-20 07:59:46,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:46,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034156719] [2020-10-20 07:59:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:46,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:46,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:46,299 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:46,302 INFO L82 PathProgramCache]: Analyzing trace with hash 856297401, now seen corresponding path program 1 times [2020-10-20 07:59:46,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:46,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749571944] [2020-10-20 07:59:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:46,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:46,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:46,383 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:46,510 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:46,512 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:46,512 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:46,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:46,513 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:59:46,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:46,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:46,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2020-10-20 07:59:46,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:46,515 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:46,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:46,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:46,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:46,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:46,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:46,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:46,685 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:46,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:59:46,712 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:59:46,712 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:46,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:59:46,748 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:59:46,748 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret7=0} Honda state: {fibonacci_#t~ret7=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) [2020-10-20 07:59:46,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:46,794 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:59:46,800 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret8=0} Honda state: {fibonacci_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:46,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:59:46,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:59:46,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:46,867 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:59:46,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:59:46,987 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:59:46,990 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:46,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:46,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:46,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:46,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:59:46,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:46,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:46,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:46,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2020-10-20 07:59:46,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:46,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:46,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:47,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:47,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:47,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:47,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:47,132 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:47,140 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:47,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:47,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:47,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:47,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:47,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:47,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:47,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:47,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:47,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:47,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:47,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:47,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:47,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:47,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:47,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:47,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:47,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:47,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:47,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:47,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:47,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:47,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:47,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:47,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:47,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:47,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:47,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:47,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:47,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:47,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:47,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:47,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:47,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:47,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:47,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:47,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:47,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:47,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:47,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:47,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:47,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:47,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:47,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:47,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:47,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:59:47,472 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:59:47,472 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:47,482 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:59:47,483 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:47,483 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:59:47,484 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2020-10-20 07:59:47,519 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:59:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:47,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:59:47,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:47,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:59:47,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:47,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 07:59:47,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2020-10-20 07:59:47,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2020-10-20 07:59:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:59:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-10-20 07:59:47,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-20 07:59:47,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:47,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-20 07:59:47,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:47,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2020-10-20 07:59:47,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:47,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2020-10-20 07:59:47,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:59:47,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2020-10-20 07:59:47,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 07:59:47,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 07:59:47,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-20 07:59:47,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:47,898 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 07:59:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-20 07:59:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-10-20 07:59:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 07:59:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-20 07:59:47,979 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 07:59:47,979 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 07:59:47,979 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:59:47,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-20 07:59:47,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:59:47,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:47,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:47,986 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:47,986 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:47,987 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 122#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 123#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 138#fibonacciENTRY ~n := #in~n; 136#L17 assume !(~n < 1); 137#L19 assume !(1 == ~n); 125#L22 call #t~ret7 := fibonacci(~n - 1);< 132#fibonacciENTRY ~n := #in~n; 133#L17 assume ~n < 1;#res := 0; 134#fibonacciFINAL assume true; 124#fibonacciEXIT >#31#return; 126#L22-1 [2020-10-20 07:59:47,987 INFO L796 eck$LassoCheckResult]: Loop: 126#L22-1 call #t~ret8 := fibonacci(~n - 2);< 131#fibonacciENTRY ~n := #in~n; 141#L17 assume !(~n < 1); 140#L19 assume !(1 == ~n); 128#L22 call #t~ret7 := fibonacci(~n - 1);< 131#fibonacciENTRY ~n := #in~n; 141#L17 assume ~n < 1;#res := 0; 129#fibonacciFINAL assume true; 139#fibonacciEXIT >#31#return; 126#L22-1 [2020-10-20 07:59:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2073663503, now seen corresponding path program 1 times [2020-10-20 07:59:47,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:47,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005229620] [2020-10-20 07:59:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 07:59:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 07:59:48,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005229620] [2020-10-20 07:59:48,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:59:48,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:59:48,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014706809] [2020-10-20 07:59:48,231 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:59:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1606275375, now seen corresponding path program 1 times [2020-10-20 07:59:48,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:48,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555967588] [2020-10-20 07:59:48,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-20 07:59:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 07:59:48,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555967588] [2020-10-20 07:59:48,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:59:48,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:59:48,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995233219] [2020-10-20 07:59:48,292 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:59:48,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:59:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:59:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:59:48,300 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-10-20 07:59:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:59:48,431 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-10-20 07:59:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:59:48,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-10-20 07:59:48,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:59:48,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2020-10-20 07:59:48,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 07:59:48,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 07:59:48,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2020-10-20 07:59:48,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:48,448 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-20 07:59:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2020-10-20 07:59:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-20 07:59:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 07:59:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-10-20 07:59:48,454 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-20 07:59:48,454 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-20 07:59:48,454 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:59:48,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-10-20 07:59:48,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:59:48,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:48,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:48,457 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:48,458 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:48,458 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 195#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 196#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 212#fibonacciENTRY ~n := #in~n; 208#L17 assume !(~n < 1); 211#L19 assume !(1 == ~n); 201#L22 call #t~ret7 := fibonacci(~n - 1);< 205#fibonacciENTRY ~n := #in~n; 207#L17 assume !(~n < 1); 218#L19 assume 1 == ~n;#res := 1; 217#fibonacciFINAL assume true; 216#fibonacciEXIT >#31#return; 199#L22-1 [2020-10-20 07:59:48,458 INFO L796 eck$LassoCheckResult]: Loop: 199#L22-1 call #t~ret8 := fibonacci(~n - 2);< 204#fibonacciENTRY ~n := #in~n; 206#L17 assume !(~n < 1); 210#L19 assume !(1 == ~n); 198#L22 call #t~ret7 := fibonacci(~n - 1);< 204#fibonacciENTRY ~n := #in~n; 206#L17 assume !(~n < 1); 210#L19 assume 1 == ~n;#res := 1; 213#fibonacciFINAL assume true; 214#fibonacciEXIT >#31#return; 199#L22-1 [2020-10-20 07:59:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash -140916419, now seen corresponding path program 1 times [2020-10-20 07:59:48,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:48,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747993512] [2020-10-20 07:59:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 07:59:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:48,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747993512] [2020-10-20 07:59:48,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157363525] [2020-10-20 07:59:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:59:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:48,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:59:48,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:48,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:59:48,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 07:59:48,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899529132] [2020-10-20 07:59:48,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:59:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1745046499, now seen corresponding path program 1 times [2020-10-20 07:59:48,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:48,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645992450] [2020-10-20 07:59:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:48,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:48,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:48,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:48,777 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:48,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:48,778 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:48,778 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:48,778 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:59:48,778 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:48,778 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:48,779 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:48,779 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2020-10-20 07:59:48,779 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:48,779 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:48,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:48,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:48,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:48,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:48,915 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:48,916 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:48,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:48,930 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:49,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:59:49,004 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:49,969 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:59:49,973 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:49,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:49,973 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:49,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:49,974 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:59:49,974 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:49,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:49,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:49,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2020-10-20 07:59:49,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:49,974 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:49,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:49,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:49,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:50,042 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:50,042 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 07:59:50,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:50,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:50,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:50,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:50,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:50,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:50,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:50,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:50,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:59:50,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:59:50,072 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:50,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:59:50,079 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:59:50,079 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:59:50,079 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:50,115 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:59:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:50,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:59:50,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:50,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:59:50,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:50,326 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2020-10-20 07:59:50,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-10-20 07:59:50,648 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 135 states and 183 transitions. Complement of second has 36 states. [2020-10-20 07:59:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 07:59:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-10-20 07:59:50,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 12 letters. Loop has 10 letters. [2020-10-20 07:59:50,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:50,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 22 letters. Loop has 10 letters. [2020-10-20 07:59:50,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:50,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 12 letters. Loop has 20 letters. [2020-10-20 07:59:50,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:50,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2020-10-20 07:59:50,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:59:50,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2020-10-20 07:59:50,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-10-20 07:59:50,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2020-10-20 07:59:50,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2020-10-20 07:59:50,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:50,675 INFO L691 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2020-10-20 07:59:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2020-10-20 07:59:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2020-10-20 07:59:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-20 07:59:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2020-10-20 07:59:50,703 INFO L714 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2020-10-20 07:59:50,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:59:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:59:50,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:59:50,705 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 8 states. [2020-10-20 07:59:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:59:50,837 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2020-10-20 07:59:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:59:50,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2020-10-20 07:59:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:59:50,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2020-10-20 07:59:50,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-10-20 07:59:50,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2020-10-20 07:59:50,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2020-10-20 07:59:50,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:50,853 INFO L691 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2020-10-20 07:59:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2020-10-20 07:59:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-10-20 07:59:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-20 07:59:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2020-10-20 07:59:50,869 INFO L714 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2020-10-20 07:59:50,869 INFO L594 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2020-10-20 07:59:50,869 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:59:50,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2020-10-20 07:59:50,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:59:50,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:50,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:50,875 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:50,875 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:50,875 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 736#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 737#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 766#fibonacciENTRY ~n := #in~n; 798#L17 assume !(~n < 1); 791#L19 assume !(1 == ~n); 756#L22 call #t~ret7 := fibonacci(~n - 1);< 757#fibonacciENTRY ~n := #in~n; 760#L17 assume !(~n < 1); 792#L19 assume !(1 == ~n); 759#L22 call #t~ret7 := fibonacci(~n - 1);< 757#fibonacciENTRY ~n := #in~n; 760#L17 assume !(~n < 1); 792#L19 assume !(1 == ~n); 759#L22 call #t~ret7 := fibonacci(~n - 1);< 757#fibonacciENTRY ~n := #in~n; 761#L17 assume !(~n < 1); 797#L19 assume 1 == ~n;#res := 1; 796#fibonacciFINAL assume true; 795#fibonacciEXIT >#31#return; 752#L22-1 call #t~ret8 := fibonacci(~n - 2);< 794#fibonacciENTRY ~n := #in~n; 827#L17 assume ~n < 1;#res := 0; 826#fibonacciFINAL assume true; 825#fibonacciEXIT >#33#return; 824#L22-2 #res := #t~ret7 + #t~ret8;havoc #t~ret8;havoc #t~ret7; 821#fibonacciFINAL assume true; 818#fibonacciEXIT >#31#return; 755#L22-1 [2020-10-20 07:59:50,876 INFO L796 eck$LassoCheckResult]: Loop: 755#L22-1 call #t~ret8 := fibonacci(~n - 2);< 751#fibonacciENTRY ~n := #in~n; 758#L17 assume !(~n < 1); 800#L19 assume !(1 == ~n); 754#L22 call #t~ret7 := fibonacci(~n - 1);< 751#fibonacciENTRY ~n := #in~n; 758#L17 assume !(~n < 1); 800#L19 assume 1 == ~n;#res := 1; 815#fibonacciFINAL assume true; 816#fibonacciEXIT >#31#return; 755#L22-1 [2020-10-20 07:59:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2137317009, now seen corresponding path program 1 times [2020-10-20 07:59:50,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:50,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174238841] [2020-10-20 07:59:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:50,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 07:59:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:51,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 07:59:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:51,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 07:59:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 07:59:51,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174238841] [2020-10-20 07:59:51,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286609633] [2020-10-20 07:59:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:59:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:51,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 07:59:51,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 07:59:51,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:59:51,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 07:59:51,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870481112] [2020-10-20 07:59:51,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:59:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1745046499, now seen corresponding path program 2 times [2020-10-20 07:59:51,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:51,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515757148] [2020-10-20 07:59:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:51,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:51,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:51,191 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:51,305 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:51,305 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:51,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:51,306 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:51,306 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:59:51,306 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:51,306 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:51,306 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:51,306 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration4_Loop [2020-10-20 07:59:51,306 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:51,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:51,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:51,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:51,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:51,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:51,395 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:51,395 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:51,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:51,401 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:51,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:59:51,442 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:52,109 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:59:52,112 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:52,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:52,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:52,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:52,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:59:52,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:52,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:52,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:52,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration4_Loop [2020-10-20 07:59:52,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:52,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:52,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:52,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:52,187 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:52,189 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 07:59:52,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:52,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:52,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:52,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:52,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:52,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:52,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:52,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:52,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:52,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:52,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:52,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:52,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:52,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:52,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:52,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:52,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:52,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:52,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:52,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:52,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:52,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:52,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:52,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:52,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:52,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:52,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-10-20 07:59:52,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:52,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:52,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:52,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:52,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:52,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:52,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:52,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:52,327 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:59:52,330 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 07:59:52,330 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:52,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:59:52,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:59:52,334 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:59:52,335 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:52,361 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:59:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:52,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 07:59:52,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:52,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:59:52,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:59:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:52,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:59:52,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:52,590 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2020-10-20 07:59:52,590 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 8 states. [2020-10-20 07:59:52,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 163 states and 217 transitions. Complement of second has 33 states. [2020-10-20 07:59:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 07:59:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-10-20 07:59:52,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 28 letters. Loop has 10 letters. [2020-10-20 07:59:52,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:52,899 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:59:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:52,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 07:59:52,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:53,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:59:53,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:59:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:53,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:59:53,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:53,135 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2020-10-20 07:59:53,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 8 states. [2020-10-20 07:59:53,384 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2020-10-20 07:59:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 07:59:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-10-20 07:59:53,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2020-10-20 07:59:53,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:53,386 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:59:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:53,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 07:59:53,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:53,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:59:53,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:59:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:53,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:59:53,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:53,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2020-10-20 07:59:53,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 8 states. [2020-10-20 07:59:53,960 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 826 states and 1091 transitions. Complement of second has 130 states. [2020-10-20 07:59:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 07:59:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-10-20 07:59:53,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 28 letters. Loop has 10 letters. [2020-10-20 07:59:53,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:53,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 38 letters. Loop has 10 letters. [2020-10-20 07:59:53,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:53,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 28 letters. Loop has 20 letters. [2020-10-20 07:59:53,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:53,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2020-10-20 07:59:53,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2020-10-20 07:59:54,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2020-10-20 07:59:54,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2020-10-20 07:59:54,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2020-10-20 07:59:54,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2020-10-20 07:59:54,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:54,020 INFO L691 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2020-10-20 07:59:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2020-10-20 07:59:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2020-10-20 07:59:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-10-20 07:59:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2020-10-20 07:59:54,068 INFO L714 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2020-10-20 07:59:54,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:59:54,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 07:59:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-20 07:59:54,068 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 11 states. [2020-10-20 07:59:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:59:54,375 INFO L93 Difference]: Finished difference Result 508 states and 758 transitions. [2020-10-20 07:59:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 07:59:54,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 758 transitions. [2020-10-20 07:59:54,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:54,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 506 states and 755 transitions. [2020-10-20 07:59:54,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2020-10-20 07:59:54,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 228 [2020-10-20 07:59:54,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 755 transitions. [2020-10-20 07:59:54,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:54,434 INFO L691 BuchiCegarLoop]: Abstraction has 506 states and 755 transitions. [2020-10-20 07:59:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 755 transitions. [2020-10-20 07:59:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 460. [2020-10-20 07:59:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2020-10-20 07:59:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 691 transitions. [2020-10-20 07:59:54,518 INFO L714 BuchiCegarLoop]: Abstraction has 460 states and 691 transitions. [2020-10-20 07:59:54,518 INFO L594 BuchiCegarLoop]: Abstraction has 460 states and 691 transitions. [2020-10-20 07:59:54,518 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:59:54,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 460 states and 691 transitions. [2020-10-20 07:59:54,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:54,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:54,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:54,526 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:54,527 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:59:54,527 INFO L794 eck$LassoCheckResult]: Stem: 3688#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3668#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 3669#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 3715#fibonacciENTRY ~n := #in~n; 3736#L17 assume !(~n < 1); 3735#L19 assume !(1 == ~n); 3731#L22 call #t~ret7 := fibonacci(~n - 1);< 3733#fibonacciENTRY ~n := #in~n; 3734#L17 assume !(~n < 1); 3730#L19 assume !(1 == ~n); 3720#L22 call #t~ret7 := fibonacci(~n - 1);< 3727#fibonacciENTRY ~n := #in~n; 3728#L17 assume !(~n < 1); 3732#L19 assume !(1 == ~n); 3719#L22 call #t~ret7 := fibonacci(~n - 1);< 3727#fibonacciENTRY ~n := #in~n; 3729#L17 assume !(~n < 1); 3718#L19 assume 1 == ~n;#res := 1; 3721#fibonacciFINAL assume true; 4017#fibonacciEXIT >#31#return; 3773#L22-1 call #t~ret8 := fibonacci(~n - 2);< 3775#fibonacciENTRY ~n := #in~n; 3867#L17 assume !(~n < 1); 3865#L19 assume !(1 == ~n); 3857#L22 call #t~ret7 := fibonacci(~n - 1);< 3858#fibonacciENTRY ~n := #in~n; 3880#L17 assume !(~n < 1); 3869#L19 assume !(1 == ~n); 3870#L22 call #t~ret7 := fibonacci(~n - 1);< 3886#fibonacciENTRY [2020-10-20 07:59:54,527 INFO L796 eck$LassoCheckResult]: Loop: 3886#fibonacciENTRY ~n := #in~n; 3982#L17 assume !(~n < 1); 3980#L19 assume !(1 == ~n); 3883#L22 call #t~ret7 := fibonacci(~n - 1);< 3886#fibonacciENTRY [2020-10-20 07:59:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1062437397, now seen corresponding path program 1 times [2020-10-20 07:59:54,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:54,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631223121] [2020-10-20 07:59:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:54,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-20 07:59:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 07:59:54,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631223121] [2020-10-20 07:59:54,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385534410] [2020-10-20 07:59:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:59:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:54,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 07:59:54,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 07:59:54,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:59:54,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 07:59:54,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314436978] [2020-10-20 07:59:54,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:59:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 2 times [2020-10-20 07:59:54,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:54,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883960150] [2020-10-20 07:59:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:54,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:54,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:54,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:54,854 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:54,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:54,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:54,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:54,854 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:59:54,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:54,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:54,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:54,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration5_Loop [2020-10-20 07:59:54,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:54,855 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:54,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:54,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:54,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:54,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:54,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:54,927 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:54,927 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:54,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:54,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:59:54,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:59:54,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:54,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:54,964 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:54,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:59:54,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:59:55,067 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:59:55,069 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:55,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:55,069 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:55,070 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:55,070 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:59:55,070 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:55,070 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:55,070 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:55,070 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration5_Loop [2020-10-20 07:59:55,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:55,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:55,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:55,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:55,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:55,130 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:55,130 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:55,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:55,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:55,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:55,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:55,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:55,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:55,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:55,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:55,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:55,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:55,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:55,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:55,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:55,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:55,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:55,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:55,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:59:55,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:59:55,178 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:59:55,179 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:55,185 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:59:55,185 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:59:55,185 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:59:55,185 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:55,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:59:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:55,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 07:59:55,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:55,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:59:55,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:55,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-20 07:59:55,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 460 states and 691 transitions. cyclomatic complexity: 241 Second operand 5 states. [2020-10-20 07:59:55,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 460 states and 691 transitions. cyclomatic complexity: 241. Second operand 5 states. Result 470 states and 701 transitions. Complement of second has 13 states. [2020-10-20 07:59:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:59:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-20 07:59:55,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2020-10-20 07:59:55,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:55,501 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:59:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:55,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 07:59:55,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:55,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:59:55,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:55,630 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-20 07:59:55,630 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 460 states and 691 transitions. cyclomatic complexity: 241 Second operand 5 states. [2020-10-20 07:59:55,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 460 states and 691 transitions. cyclomatic complexity: 241. Second operand 5 states. Result 470 states and 701 transitions. Complement of second has 13 states. [2020-10-20 07:59:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:59:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-20 07:59:55,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2020-10-20 07:59:55,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:55,729 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:59:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:55,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 07:59:55,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:55,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:59:55,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:55,862 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-20 07:59:55,863 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 460 states and 691 transitions. cyclomatic complexity: 241 Second operand 5 states. [2020-10-20 07:59:55,968 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 460 states and 691 transitions. cyclomatic complexity: 241. Second operand 5 states. Result 621 states and 875 transitions. Complement of second has 14 states. [2020-10-20 07:59:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:59:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-20 07:59:55,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2020-10-20 07:59:55,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:55,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2020-10-20 07:59:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2020-10-20 07:59:55,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:55,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 875 transitions. [2020-10-20 07:59:55,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:56,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 524 states and 766 transitions. [2020-10-20 07:59:56,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2020-10-20 07:59:56,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2020-10-20 07:59:56,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 766 transitions. [2020-10-20 07:59:56,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:56,012 INFO L691 BuchiCegarLoop]: Abstraction has 524 states and 766 transitions. [2020-10-20 07:59:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 766 transitions. [2020-10-20 07:59:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 494. [2020-10-20 07:59:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-10-20 07:59:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 730 transitions. [2020-10-20 07:59:56,042 INFO L714 BuchiCegarLoop]: Abstraction has 494 states and 730 transitions. [2020-10-20 07:59:56,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:59:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 07:59:56,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-20 07:59:56,045 INFO L87 Difference]: Start difference. First operand 494 states and 730 transitions. Second operand 12 states. [2020-10-20 07:59:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:59:56,273 INFO L93 Difference]: Finished difference Result 549 states and 824 transitions. [2020-10-20 07:59:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 07:59:56,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 824 transitions. [2020-10-20 07:59:56,283 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:56,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 546 states and 816 transitions. [2020-10-20 07:59:56,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2020-10-20 07:59:56,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2020-10-20 07:59:56,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 816 transitions. [2020-10-20 07:59:56,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:56,295 INFO L691 BuchiCegarLoop]: Abstraction has 546 states and 816 transitions. [2020-10-20 07:59:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 816 transitions. [2020-10-20 07:59:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 515. [2020-10-20 07:59:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-10-20 07:59:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 770 transitions. [2020-10-20 07:59:56,318 INFO L714 BuchiCegarLoop]: Abstraction has 515 states and 770 transitions. [2020-10-20 07:59:56,318 INFO L594 BuchiCegarLoop]: Abstraction has 515 states and 770 transitions. [2020-10-20 07:59:56,318 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:59:56,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 770 transitions. [2020-10-20 07:59:56,324 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:56,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:56,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:56,326 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:56,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:59:56,326 INFO L794 eck$LassoCheckResult]: Stem: 7229#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7213#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 7214#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 7241#fibonacciENTRY ~n := #in~n; 7242#L17 assume !(~n < 1); 7279#L19 assume !(1 == ~n); 7275#L22 call #t~ret7 := fibonacci(~n - 1);< 7278#fibonacciENTRY ~n := #in~n; 7277#L17 assume !(~n < 1); 7276#L19 assume !(1 == ~n); 7273#L22 call #t~ret7 := fibonacci(~n - 1);< 7272#fibonacciENTRY ~n := #in~n; 7274#L17 assume !(~n < 1); 7291#L19 assume !(1 == ~n); 7283#L22 call #t~ret7 := fibonacci(~n - 1);< 7288#fibonacciENTRY ~n := #in~n; 7320#L17 assume !(~n < 1); 7314#L19 assume !(1 == ~n); 7282#L22 call #t~ret7 := fibonacci(~n - 1);< 7288#fibonacciENTRY ~n := #in~n; 7321#L17 assume !(~n < 1); 7379#L19 assume 1 == ~n;#res := 1; 7377#fibonacciFINAL assume true; 7376#fibonacciEXIT >#31#return; 7345#L22-1 call #t~ret8 := fibonacci(~n - 2);< 7349#fibonacciENTRY ~n := #in~n; 7622#L17 assume !(~n < 1); 7618#L19 assume !(1 == ~n); 7619#L22 call #t~ret7 := fibonacci(~n - 1);< 7630#fibonacciENTRY ~n := #in~n; 7718#L17 assume !(~n < 1); 7717#L19 assume !(1 == ~n); 7259#L22 call #t~ret7 := fibonacci(~n - 1);< 7263#fibonacciENTRY ~n := #in~n; 7264#L17 assume !(~n < 1); 7721#L19 assume !(1 == ~n); 7260#L22 [2020-10-20 07:59:56,339 INFO L796 eck$LassoCheckResult]: Loop: 7260#L22 call #t~ret7 := fibonacci(~n - 1);< 7263#fibonacciENTRY ~n := #in~n; 7264#L17 assume !(~n < 1); 7721#L19 assume !(1 == ~n); 7260#L22 [2020-10-20 07:59:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash -331346849, now seen corresponding path program 2 times [2020-10-20 07:59:56,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:56,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000348436] [2020-10-20 07:59:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:56,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-20 07:59:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 07:59:56,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000348436] [2020-10-20 07:59:56,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569279473] [2020-10-20 07:59:56,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:59:56,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:59:56,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:59:56,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 07:59:56,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 07:59:56,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:59:56,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-10-20 07:59:56,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762835008] [2020-10-20 07:59:56,583 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:59:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 3 times [2020-10-20 07:59:56,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:56,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350400221] [2020-10-20 07:59:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:59:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:56,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:59:56,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:59:56,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:59:56,652 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:56,652 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:56,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:56,653 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:56,653 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:59:56,653 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:56,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:56,653 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:56,653 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2020-10-20 07:59:56,653 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:56,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:56,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:56,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:56,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:56,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:56,765 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:56,766 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:56,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:59:56,770 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:56,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:59:56,826 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:58,824 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:59:58,828 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:59:58,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:59:58,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:59:58,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:59:58,829 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:59:58,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:58,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:59:58,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:59:58,829 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2020-10-20 07:59:58,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:59:58,830 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:59:58,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:58,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:58,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:58,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:59:58,906 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:59:58,906 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:59:58,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:59:58,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:59:58,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:59:58,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:59:58,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:59:58,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:59:58,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:59:58,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:59:58,926 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:59:58,930 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:59:58,931 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-10-20 07:59:58,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:59:58,934 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:59:58,934 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:59:58,935 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-10-20 07:59:58,957 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:59:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:59,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 07:59:59,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:59,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:59:59,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:59,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 07:59:59,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 515 states and 770 transitions. cyclomatic complexity: 265 Second operand 6 states. [2020-10-20 07:59:59,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 515 states and 770 transitions. cyclomatic complexity: 265. Second operand 6 states. Result 527 states and 783 transitions. Complement of second has 18 states. [2020-10-20 07:59:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:59:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-20 07:59:59,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 36 letters. Loop has 4 letters. [2020-10-20 07:59:59,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:59,185 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:59:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:59,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 07:59:59,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:59:59,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:59:59,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:59:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:59:59,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 07:59:59,341 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 515 states and 770 transitions. cyclomatic complexity: 265 Second operand 6 states. [2020-10-20 07:59:59,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 515 states and 770 transitions. cyclomatic complexity: 265. Second operand 6 states. Result 757 states and 1105 transitions. Complement of second has 22 states. [2020-10-20 07:59:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:59:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:59:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-10-20 07:59:59,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 36 letters. Loop has 4 letters. [2020-10-20 07:59:59,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:59,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 40 letters. Loop has 4 letters. [2020-10-20 07:59:59,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:59,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 36 letters. Loop has 8 letters. [2020-10-20 07:59:59,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:59:59,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 1105 transitions. [2020-10-20 07:59:59,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:59,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 693 states and 1036 transitions. [2020-10-20 07:59:59,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2020-10-20 07:59:59,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2020-10-20 07:59:59,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 693 states and 1036 transitions. [2020-10-20 07:59:59,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:59,523 INFO L691 BuchiCegarLoop]: Abstraction has 693 states and 1036 transitions. [2020-10-20 07:59:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states and 1036 transitions. [2020-10-20 07:59:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 680. [2020-10-20 07:59:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-10-20 07:59:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1019 transitions. [2020-10-20 07:59:59,576 INFO L714 BuchiCegarLoop]: Abstraction has 680 states and 1019 transitions. [2020-10-20 07:59:59,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:59:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 07:59:59,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-10-20 07:59:59,577 INFO L87 Difference]: Start difference. First operand 680 states and 1019 transitions. Second operand 14 states. [2020-10-20 07:59:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:59:59,883 INFO L93 Difference]: Finished difference Result 743 states and 1113 transitions. [2020-10-20 07:59:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 07:59:59,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 743 states and 1113 transitions. [2020-10-20 07:59:59,898 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:59,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 743 states to 733 states and 1098 transitions. [2020-10-20 07:59:59,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2020-10-20 07:59:59,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2020-10-20 07:59:59,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 733 states and 1098 transitions. [2020-10-20 07:59:59,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:59:59,919 INFO L691 BuchiCegarLoop]: Abstraction has 733 states and 1098 transitions. [2020-10-20 07:59:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states and 1098 transitions. [2020-10-20 07:59:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 720. [2020-10-20 07:59:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2020-10-20 07:59:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1073 transitions. [2020-10-20 07:59:59,976 INFO L714 BuchiCegarLoop]: Abstraction has 720 states and 1073 transitions. [2020-10-20 07:59:59,976 INFO L594 BuchiCegarLoop]: Abstraction has 720 states and 1073 transitions. [2020-10-20 07:59:59,976 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:59:59,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 720 states and 1073 transitions. [2020-10-20 07:59:59,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 07:59:59,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:59:59,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:59:59,992 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:59:59,993 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:59:59,993 INFO L794 eck$LassoCheckResult]: Stem: 10903#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10880#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 10881#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 10927#fibonacciENTRY ~n := #in~n; 10999#L17 assume !(~n < 1); 10997#L19 assume !(1 == ~n); 10994#L22 call #t~ret7 := fibonacci(~n - 1);< 10995#fibonacciENTRY ~n := #in~n; 11011#L17 assume !(~n < 1); 11009#L19 assume !(1 == ~n); 11006#L22 call #t~ret7 := fibonacci(~n - 1);< 11007#fibonacciENTRY ~n := #in~n; 11020#L17 assume !(~n < 1); 11019#L19 assume !(1 == ~n); 11002#L22 call #t~ret7 := fibonacci(~n - 1);< 11018#fibonacciENTRY ~n := #in~n; 11046#L17 assume !(~n < 1); 11038#L19 assume !(1 == ~n); 11026#L22 call #t~ret7 := fibonacci(~n - 1);< 11036#fibonacciENTRY ~n := #in~n; 11088#L17 assume !(~n < 1); 11081#L19 assume !(1 == ~n); 11023#L22 call #t~ret7 := fibonacci(~n - 1);< 11071#fibonacciENTRY ~n := #in~n; 11097#L17 assume !(~n < 1); 11096#L19 assume 1 == ~n;#res := 1; 11095#fibonacciFINAL assume true; 11093#fibonacciEXIT >#31#return; 11083#L22-1 call #t~ret8 := fibonacci(~n - 2);< 11086#fibonacciENTRY ~n := #in~n; 11091#L17 assume ~n < 1;#res := 0; 11089#fibonacciFINAL assume true; 11082#fibonacciEXIT >#33#return; 11080#L22-2 #res := #t~ret7 + #t~ret8;havoc #t~ret8;havoc #t~ret7; 11070#fibonacciFINAL assume true; 11035#fibonacciEXIT >#31#return; 11014#L22-1 call #t~ret8 := fibonacci(~n - 2);< 11017#fibonacciENTRY ~n := #in~n; 11132#L17 assume !(~n < 1); 11078#L19 assume !(1 == ~n); 11075#L22 call #t~ret7 := fibonacci(~n - 1);< 11076#fibonacciENTRY ~n := #in~n; 11392#L17 assume !(~n < 1); 11390#L19 assume !(1 == ~n); 11374#L22 call #t~ret7 := fibonacci(~n - 1);< 11384#fibonacciENTRY ~n := #in~n; 11411#L17 assume !(~n < 1); 11423#L19 assume !(1 == ~n); 11375#L22 [2020-10-20 07:59:59,993 INFO L796 eck$LassoCheckResult]: Loop: 11375#L22 call #t~ret7 := fibonacci(~n - 1);< 11384#fibonacciENTRY ~n := #in~n; 11411#L17 assume !(~n < 1); 11423#L19 assume !(1 == ~n); 11375#L22 [2020-10-20 07:59:59,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:59:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1097579499, now seen corresponding path program 2 times [2020-10-20 07:59:59,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:59:59,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814897061] [2020-10-20 07:59:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:00:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:00,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-20 08:00:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:00,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 08:00:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:00,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 08:00:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 08:00:00,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814897061] [2020-10-20 08:00:00,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251033828] [2020-10-20 08:00:00,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:00:00,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:00:00,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:00:00,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 08:00:00,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 08:00:00,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:00:00,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2020-10-20 08:00:00,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660311057] [2020-10-20 08:00:00,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:00:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 4 times [2020-10-20 08:00:00,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:00:00,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417190335] [2020-10-20 08:00:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:00:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:00:00,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:00:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:00:00,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:00:00,391 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:00:00,436 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:00:00,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:00:00,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:00:00,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:00:00,437 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:00:00,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:00,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:00:00,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:00:00,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2020-10-20 08:00:00,438 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:00:00,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:00:00,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:00,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:00,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:00,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:00,557 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:00:00,557 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:00,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:00,565 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:00,570 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:00:00,570 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:00,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:00,615 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:00,620 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:00:00,620 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret7=0} Honda state: {fibonacci_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:00,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:00,661 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:00,666 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:00:00,666 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret8=0} Honda state: {fibonacci_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:00,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:00,694 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:00,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:00:00,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:00:01,870 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:00:01,874 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:00:01,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:00:01,874 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:00:01,874 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:00:01,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:00:01,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:01,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:00:01,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:00:01,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2020-10-20 08:00:01,875 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:00:01,875 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:00:01,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:01,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:01,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:01,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:01,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:00:01,957 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:01,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:01,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:01,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:01,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:01,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:01,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:01,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:01,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:01,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:02,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:02,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:02,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:02,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:02,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:02,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:02,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:02,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:02,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:02,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:02,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:02,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:02,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:02,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:02,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:02,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:02,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:02,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:00:02,055 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 08:00:02,055 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:02,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:00:02,065 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:00:02,065 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:00:02,065 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:02,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:00:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:02,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 08:00:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:02,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:02,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:02,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:02,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:02,271 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:02,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 720 states and 1073 transitions. cyclomatic complexity: 366 Second operand 6 states. [2020-10-20 08:00:02,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 720 states and 1073 transitions. cyclomatic complexity: 366. Second operand 6 states. Result 739 states and 1093 transitions. Complement of second has 18 states. [2020-10-20 08:00:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-20 08:00:02,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2020-10-20 08:00:02,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:02,363 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:00:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:02,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 08:00:02,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:02,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:02,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:02,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:02,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:02,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:02,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 720 states and 1073 transitions. cyclomatic complexity: 366 Second operand 6 states. [2020-10-20 08:00:02,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 720 states and 1073 transitions. cyclomatic complexity: 366. Second operand 6 states. Result 920 states and 1304 transitions. Complement of second has 22 states. [2020-10-20 08:00:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-10-20 08:00:02,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2020-10-20 08:00:02,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:02,704 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:00:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:02,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 08:00:02,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:02,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:02,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:02,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:02,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:02,865 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:02,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 720 states and 1073 transitions. cyclomatic complexity: 366 Second operand 6 states. [2020-10-20 08:00:02,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 720 states and 1073 transitions. cyclomatic complexity: 366. Second operand 6 states. Result 967 states and 1393 transitions. Complement of second has 27 states. [2020-10-20 08:00:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-10-20 08:00:02,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2020-10-20 08:00:02,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:02,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2020-10-20 08:00:02,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:02,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2020-10-20 08:00:02,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:02,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 967 states and 1393 transitions. [2020-10-20 08:00:03,003 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 08:00:03,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 967 states to 720 states and 1073 transitions. [2020-10-20 08:00:03,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2020-10-20 08:00:03,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2020-10-20 08:00:03,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 1073 transitions. [2020-10-20 08:00:03,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:00:03,028 INFO L691 BuchiCegarLoop]: Abstraction has 720 states and 1073 transitions. [2020-10-20 08:00:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 1073 transitions. [2020-10-20 08:00:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2020-10-20 08:00:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2020-10-20 08:00:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1073 transitions. [2020-10-20 08:00:03,056 INFO L714 BuchiCegarLoop]: Abstraction has 720 states and 1073 transitions. [2020-10-20 08:00:03,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:00:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 08:00:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-10-20 08:00:03,057 INFO L87 Difference]: Start difference. First operand 720 states and 1073 transitions. Second operand 15 states. [2020-10-20 08:00:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:00:03,477 INFO L93 Difference]: Finished difference Result 785 states and 1155 transitions. [2020-10-20 08:00:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 08:00:03,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1155 transitions. [2020-10-20 08:00:03,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 08:00:03,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1155 transitions. [2020-10-20 08:00:03,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2020-10-20 08:00:03,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2020-10-20 08:00:03,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1155 transitions. [2020-10-20 08:00:03,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:00:03,530 INFO L691 BuchiCegarLoop]: Abstraction has 785 states and 1155 transitions. [2020-10-20 08:00:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1155 transitions. [2020-10-20 08:00:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 744. [2020-10-20 08:00:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-10-20 08:00:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1109 transitions. [2020-10-20 08:00:03,560 INFO L714 BuchiCegarLoop]: Abstraction has 744 states and 1109 transitions. [2020-10-20 08:00:03,560 INFO L594 BuchiCegarLoop]: Abstraction has 744 states and 1109 transitions. [2020-10-20 08:00:03,560 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:00:03,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 744 states and 1109 transitions. [2020-10-20 08:00:03,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 08:00:03,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:00:03,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:00:03,573 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 08:00:03,574 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:00:03,574 INFO L794 eck$LassoCheckResult]: Stem: 16523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16506#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 16507#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 16545#fibonacciENTRY ~n := #in~n; 16626#L17 assume !(~n < 1); 16625#L19 assume !(1 == ~n); 16621#L22 call #t~ret7 := fibonacci(~n - 1);< 16624#fibonacciENTRY ~n := #in~n; 16623#L17 assume !(~n < 1); 16622#L19 assume !(1 == ~n); 16617#L22 call #t~ret7 := fibonacci(~n - 1);< 16620#fibonacciENTRY ~n := #in~n; 16619#L17 assume !(~n < 1); 16618#L19 assume !(1 == ~n); 16610#L22 call #t~ret7 := fibonacci(~n - 1);< 16616#fibonacciENTRY ~n := #in~n; 16614#L17 assume !(~n < 1); 16612#L19 assume !(1 == ~n); 16597#L22 call #t~ret7 := fibonacci(~n - 1);< 16602#fibonacciENTRY ~n := #in~n; 16608#L17 assume !(~n < 1); 16606#L19 assume !(1 == ~n); 16598#L22 call #t~ret7 := fibonacci(~n - 1);< 16602#fibonacciENTRY ~n := #in~n; 16609#L17 assume !(~n < 1); 16607#L19 assume 1 == ~n;#res := 1; 16604#fibonacciFINAL assume true; 16596#fibonacciEXIT >#31#return; 16595#L22-1 call #t~ret8 := fibonacci(~n - 2);< 16711#fibonacciENTRY ~n := #in~n; 16737#L17 assume !(~n < 1); 16736#L19 assume !(1 == ~n); 16592#L22 call #t~ret7 := fibonacci(~n - 1);< 16600#fibonacciENTRY ~n := #in~n; 16615#L17 assume !(~n < 1); 17249#L19 assume !(1 == ~n); 17141#L22 call #t~ret7 := fibonacci(~n - 1);< 17168#fibonacciENTRY ~n := #in~n; 17237#L17 assume !(~n < 1); 17236#L19 assume 1 == ~n;#res := 1; 17234#fibonacciFINAL assume true; 17166#fibonacciEXIT >#31#return; 16890#L22-1 call #t~ret8 := fibonacci(~n - 2);< 16891#fibonacciENTRY ~n := #in~n; 17231#L17 assume ~n < 1;#res := 0; 17169#fibonacciFINAL assume true; 17156#fibonacciEXIT >#33#return; 16796#L22-2 #res := #t~ret7 + #t~ret8;havoc #t~ret8;havoc #t~ret7; 16793#fibonacciFINAL assume true; 16741#fibonacciEXIT >#31#return; 16707#L22-1 call #t~ret8 := fibonacci(~n - 2);< 16739#fibonacciENTRY ~n := #in~n; 16805#L17 assume !(~n < 1); 16803#L19 assume !(1 == ~n); 16745#L22 call #t~ret7 := fibonacci(~n - 1);< 16747#fibonacciENTRY ~n := #in~n; 16810#L17 assume !(~n < 1); 17058#L19 assume !(1 == ~n); 16838#L22 call #t~ret7 := fibonacci(~n - 1);< 16846#fibonacciENTRY ~n := #in~n; 16997#L17 assume !(~n < 1); 16996#L19 assume !(1 == ~n); 16839#L22 [2020-10-20 08:00:03,575 INFO L796 eck$LassoCheckResult]: Loop: 16839#L22 call #t~ret7 := fibonacci(~n - 1);< 16846#fibonacciENTRY ~n := #in~n; 16997#L17 assume !(~n < 1); 16996#L19 assume !(1 == ~n); 16839#L22 [2020-10-20 08:00:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -717787987, now seen corresponding path program 3 times [2020-10-20 08:00:03,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:00:03,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173882575] [2020-10-20 08:00:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:00:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:03,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-20 08:00:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:03,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-20 08:00:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:03,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 08:00:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:03,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 08:00:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 114 proven. 121 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-10-20 08:00:03,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173882575] [2020-10-20 08:00:03,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387086080] [2020-10-20 08:00:03,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:00:03,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-10-20 08:00:03,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:00:03,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 08:00:03,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 141 proven. 19 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-10-20 08:00:04,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:00:04,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2020-10-20 08:00:04,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941004504] [2020-10-20 08:00:04,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:00:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 5 times [2020-10-20 08:00:04,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:00:04,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914806750] [2020-10-20 08:00:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:00:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:00:04,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:00:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:00:04,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:00:04,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:00:04,114 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:00:04,114 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:00:04,114 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:00:04,114 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:00:04,115 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:00:04,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:04,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:00:04,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:00:04,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2020-10-20 08:00:04,115 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:00:04,115 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:00:04,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:04,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:04,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:04,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:04,203 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:00:04,203 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:04,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:04,218 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:04,225 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:00:04,225 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:04,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:04,274 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:04,279 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:00:04,279 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret8=0} Honda state: {fibonacci_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:04,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:04,320 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:04,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:00:04,375 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,728 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:00:13,730 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:00:13,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:00:13,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:00:13,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:00:13,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:00:13,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:00:13,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:00:13,730 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2020-10-20 08:00:13,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:00:13,731 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:00:13,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:13,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:13,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:13,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:13,802 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:00:13,802 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:13,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:13,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:13,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:13,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:13,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:13,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:13,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:13,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:13,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:13,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:13,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:13,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:13,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:13,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:13,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:13,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:00:13,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:13,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:13,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:13,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:13,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:13,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:13,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:13,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:13,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:13,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:13,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:13,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:13,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:13,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:13,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:13,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:00:13,923 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 08:00:13,923 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:13,949 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:00:13,950 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:00:13,950 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:00:13,950 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-10-20 08:00:13,972 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:00:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:14,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-20 08:00:14,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:14,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:14,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:14,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:14,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:14,145 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:14,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1109 transitions. cyclomatic complexity: 378 Second operand 6 states. [2020-10-20 08:00:14,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1109 transitions. cyclomatic complexity: 378. Second operand 6 states. Result 763 states and 1129 transitions. Complement of second has 18 states. [2020-10-20 08:00:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-20 08:00:14,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 62 letters. Loop has 4 letters. [2020-10-20 08:00:14,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:14,222 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:00:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:14,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-20 08:00:14,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:14,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:14,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:14,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:14,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:14,473 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:14,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1109 transitions. cyclomatic complexity: 378 Second operand 6 states. [2020-10-20 08:00:14,600 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1109 transitions. cyclomatic complexity: 378. Second operand 6 states. Result 944 states and 1340 transitions. Complement of second has 22 states. [2020-10-20 08:00:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-10-20 08:00:14,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 62 letters. Loop has 4 letters. [2020-10-20 08:00:14,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:14,602 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:00:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:14,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-20 08:00:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:14,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:14,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:14,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:14,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:14,765 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:14,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1109 transitions. cyclomatic complexity: 378 Second operand 6 states. [2020-10-20 08:00:14,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1109 transitions. cyclomatic complexity: 378. Second operand 6 states. Result 991 states and 1429 transitions. Complement of second has 27 states. [2020-10-20 08:00:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-10-20 08:00:14,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 62 letters. Loop has 4 letters. [2020-10-20 08:00:14,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:14,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 66 letters. Loop has 4 letters. [2020-10-20 08:00:14,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:14,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 62 letters. Loop has 8 letters. [2020-10-20 08:00:14,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:14,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 991 states and 1429 transitions. [2020-10-20 08:00:14,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 08:00:14,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 991 states to 744 states and 1109 transitions. [2020-10-20 08:00:14,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2020-10-20 08:00:14,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2020-10-20 08:00:14,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 1109 transitions. [2020-10-20 08:00:14,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:00:14,912 INFO L691 BuchiCegarLoop]: Abstraction has 744 states and 1109 transitions. [2020-10-20 08:00:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 1109 transitions. [2020-10-20 08:00:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2020-10-20 08:00:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-10-20 08:00:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1109 transitions. [2020-10-20 08:00:14,940 INFO L714 BuchiCegarLoop]: Abstraction has 744 states and 1109 transitions. [2020-10-20 08:00:14,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:00:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-20 08:00:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2020-10-20 08:00:14,941 INFO L87 Difference]: Start difference. First operand 744 states and 1109 transitions. Second operand 23 states. [2020-10-20 08:00:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:00:15,661 INFO L93 Difference]: Finished difference Result 456 states and 594 transitions. [2020-10-20 08:00:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-20 08:00:15,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 594 transitions. [2020-10-20 08:00:15,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 08:00:15,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 384 states and 511 transitions. [2020-10-20 08:00:15,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2020-10-20 08:00:15,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2020-10-20 08:00:15,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 384 states and 511 transitions. [2020-10-20 08:00:15,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:00:15,676 INFO L691 BuchiCegarLoop]: Abstraction has 384 states and 511 transitions. [2020-10-20 08:00:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states and 511 transitions. [2020-10-20 08:00:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 318. [2020-10-20 08:00:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-10-20 08:00:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 429 transitions. [2020-10-20 08:00:15,688 INFO L714 BuchiCegarLoop]: Abstraction has 318 states and 429 transitions. [2020-10-20 08:00:15,688 INFO L594 BuchiCegarLoop]: Abstraction has 318 states and 429 transitions. [2020-10-20 08:00:15,688 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:00:15,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 429 transitions. [2020-10-20 08:00:15,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 08:00:15,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:00:15,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:00:15,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 11, 10, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-10-20 08:00:15,696 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:00:15,697 INFO L794 eck$LassoCheckResult]: Stem: 22126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 22106#L-1 havoc main_#res;havoc main_#t~ret9, main_~x~0, main_~result~0;main_~x~0 := 9; 22107#L29 call main_#t~ret9 := fibonacci(main_~x~0);< 22148#fibonacciENTRY ~n := #in~n; 22235#L17 assume !(~n < 1); 22233#L19 assume !(1 == ~n); 22229#L22 call #t~ret7 := fibonacci(~n - 1);< 22230#fibonacciENTRY ~n := #in~n; 22264#L17 assume !(~n < 1); 22261#L19 assume !(1 == ~n); 22239#L22 call #t~ret7 := fibonacci(~n - 1);< 22242#fibonacciENTRY ~n := #in~n; 22254#L17 assume !(~n < 1); 22253#L19 assume !(1 == ~n); 22237#L22 call #t~ret7 := fibonacci(~n - 1);< 22240#fibonacciENTRY ~n := #in~n; 22259#L17 assume !(~n < 1); 22258#L19 assume !(1 == ~n); 22256#L22 call #t~ret7 := fibonacci(~n - 1);< 22257#fibonacciENTRY ~n := #in~n; 22379#L17 assume !(~n < 1); 22377#L19 assume !(1 == ~n); 22141#L22 call #t~ret7 := fibonacci(~n - 1);< 22140#fibonacciENTRY ~n := #in~n; 22143#L17 assume !(~n < 1); 22147#L19 assume !(1 == ~n); 22142#L22 call #t~ret7 := fibonacci(~n - 1);< 22140#fibonacciENTRY ~n := #in~n; 22143#L17 assume !(~n < 1); 22147#L19 assume !(1 == ~n); 22142#L22 call #t~ret7 := fibonacci(~n - 1);< 22140#fibonacciENTRY ~n := #in~n; 22143#L17 assume !(~n < 1); 22147#L19 assume !(1 == ~n); 22142#L22 call #t~ret7 := fibonacci(~n - 1);< 22376#fibonacciENTRY ~n := #in~n; 22414#L17 assume !(~n < 1); 22413#L19 assume 1 == ~n;#res := 1; 22412#fibonacciFINAL assume true; 22411#fibonacciEXIT >#31#return; 22408#L22-1 call #t~ret8 := fibonacci(~n - 2);< 22409#fibonacciENTRY ~n := #in~n; 22422#L17 assume ~n < 1;#res := 0; 22421#fibonacciFINAL assume true; 22407#fibonacciEXIT >#33#return; 22404#L22-2 #res := #t~ret7 + #t~ret8;havoc #t~ret8;havoc #t~ret7; 22402#fibonacciFINAL assume true; 22394#fibonacciEXIT >#31#return; 22137#L22-1 call #t~ret8 := fibonacci(~n - 2);< 22386#fibonacciENTRY ~n := #in~n; 22396#L17 assume !(~n < 1); 22389#L19 assume 1 == ~n;#res := 1; 22388#fibonacciFINAL assume true; 22383#fibonacciEXIT >#33#return; 22382#L22-2 #res := #t~ret7 + #t~ret8;havoc #t~ret8;havoc #t~ret7; 22381#fibonacciFINAL assume true; 22263#fibonacciEXIT >#31#return; 22139#L22-1 call #t~ret8 := fibonacci(~n - 2);< 22250#fibonacciENTRY ~n := #in~n; 22397#L17 assume !(~n < 1); 22390#L19 assume !(1 == ~n); 22109#L22 call #t~ret7 := fibonacci(~n - 1);< 22212#fibonacciENTRY ~n := #in~n; 22214#L17 assume !(~n < 1); 22200#L19 assume !(1 == ~n); 22169#L22 call #t~ret7 := fibonacci(~n - 1);< 22171#fibonacciENTRY ~n := #in~n; 22194#L17 assume !(~n < 1); 22190#L19 assume !(1 == ~n); 22167#L22 [2020-10-20 08:00:15,698 INFO L796 eck$LassoCheckResult]: Loop: 22167#L22 call #t~ret7 := fibonacci(~n - 1);< 22171#fibonacciENTRY ~n := #in~n; 22194#L17 assume !(~n < 1); 22190#L19 assume !(1 == ~n); 22167#L22 [2020-10-20 08:00:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1290699209, now seen corresponding path program 4 times [2020-10-20 08:00:15,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:00:15,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204687549] [2020-10-20 08:00:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:00:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:15,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-20 08:00:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:16,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 08:00:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:16,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 08:00:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:16,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 08:00:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:16,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-20 08:00:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 184 proven. 96 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-10-20 08:00:16,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204687549] [2020-10-20 08:00:16,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890030255] [2020-10-20 08:00:16,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:00:16,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:00:16,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:00:16,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 08:00:16,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 184 proven. 96 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-10-20 08:00:16,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:00:16,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 22 [2020-10-20 08:00:16,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478358806] [2020-10-20 08:00:16,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:00:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 6 times [2020-10-20 08:00:16,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:00:16,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460573026] [2020-10-20 08:00:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:00:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:00:16,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:00:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:00:16,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:00:16,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:00:16,261 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:00:16,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:00:16,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:00:16,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:00:16,262 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:00:16,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:16,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:00:16,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:00:16,263 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2020-10-20 08:00:16,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:00:16,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:00:16,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:16,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:16,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:16,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:16,338 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:00:16,338 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:16,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:16,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:00:16,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:00:16,346 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret8=0} Honda state: {fibonacci_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:16,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:00:16,372 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:16,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:00:16,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:00:25,712 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:00:25,715 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:00:25,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:00:25,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:00:25,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:00:25,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:00:25,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:25,716 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:00:25,716 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:00:25,716 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2020-10-20 08:00:25,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:00:25,716 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:00:25,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:25,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:25,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:25,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:00:25,779 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:00:25,780 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:25,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:25,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:25,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:25,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:25,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:25,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:25,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:25,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:25,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:25,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:00:25,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:00:25,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:00:25,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:00:25,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:00:25,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:00:25,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:00:25,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:00:25,818 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:00:25,827 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:00:25,827 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:00:25,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:00:25,830 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:00:25,830 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:00:25,830 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-10-20 08:00:25,853 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:00:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:25,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 08:00:25,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:25,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:25,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:25,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:25,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:26,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:26,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:26,043 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:26,043 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 318 states and 429 transitions. cyclomatic complexity: 115 Second operand 6 states. [2020-10-20 08:00:26,108 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 318 states and 429 transitions. cyclomatic complexity: 115. Second operand 6 states. Result 337 states and 449 transitions. Complement of second has 18 states. [2020-10-20 08:00:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-20 08:00:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 69 letters. Loop has 4 letters. [2020-10-20 08:00:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:26,110 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:00:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:26,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 08:00:26,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:26,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:26,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:26,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:26,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:26,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 318 states and 429 transitions. cyclomatic complexity: 115 Second operand 6 states. [2020-10-20 08:00:26,407 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 318 states and 429 transitions. cyclomatic complexity: 115. Second operand 6 states. Result 343 states and 455 transitions. Complement of second has 17 states. [2020-10-20 08:00:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-10-20 08:00:26,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 69 letters. Loop has 4 letters. [2020-10-20 08:00:26,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:26,411 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:00:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:00:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:26,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 08:00:26,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:26,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:00:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:00:26,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:00:26,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:00:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:00:26,619 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 08:00:26,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 318 states and 429 transitions. cyclomatic complexity: 115 Second operand 6 states. [2020-10-20 08:00:26,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 318 states and 429 transitions. cyclomatic complexity: 115. Second operand 6 states. Result 424 states and 559 transitions. Complement of second has 27 states. [2020-10-20 08:00:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 08:00:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:00:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-10-20 08:00:26,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2020-10-20 08:00:26,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:26,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 73 letters. Loop has 4 letters. [2020-10-20 08:00:26,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:26,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 8 letters. [2020-10-20 08:00:26,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:00:26,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 559 transitions. [2020-10-20 08:00:26,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 08:00:26,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 326 states and 439 transitions. [2020-10-20 08:00:26,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-10-20 08:00:26,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2020-10-20 08:00:26,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 439 transitions. [2020-10-20 08:00:26,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:00:26,734 INFO L691 BuchiCegarLoop]: Abstraction has 326 states and 439 transitions. [2020-10-20 08:00:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 439 transitions. [2020-10-20 08:00:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 318. [2020-10-20 08:00:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-10-20 08:00:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 429 transitions. [2020-10-20 08:00:26,748 INFO L714 BuchiCegarLoop]: Abstraction has 318 states and 429 transitions. [2020-10-20 08:00:26,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:00:26,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 08:00:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2020-10-20 08:00:26,751 INFO L87 Difference]: Start difference. First operand 318 states and 429 transitions. Second operand 22 states. [2020-10-20 08:00:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:00:27,182 INFO L93 Difference]: Finished difference Result 401 states and 498 transitions. [2020-10-20 08:00:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-20 08:00:27,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 498 transitions. [2020-10-20 08:00:27,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:00:27,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 0 states and 0 transitions. [2020-10-20 08:00:27,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:00:27,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:00:27,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:00:27,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:00:27,186 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:00:27,187 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:00:27,187 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:00:27,187 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:00:27,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:00:27,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:00:27,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:00:27,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:00:27 BoogieIcfgContainer [2020-10-20 08:00:27,195 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:00:27,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:00:27,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:00:27,196 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:00:27,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:59:45" (3/4) ... [2020-10-20 08:00:27,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:00:27,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:00:27,203 INFO L168 Benchmark]: Toolchain (without parser) took 42135.84 ms. Allocated memory was 39.8 MB in the beginning and 136.3 MB in the end (delta: 96.5 MB). Free memory was 17.5 MB in the beginning and 63.9 MB in the end (delta: -46.4 MB). Peak memory consumption was 50.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,203 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 38.8 MB. Free memory was 21.5 MB in the beginning and 21.5 MB in the end (delta: 53.5 kB). Peak memory consumption was 53.5 kB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.51 ms. Allocated memory was 39.8 MB in the beginning and 47.2 MB in the end (delta: 7.3 MB). Free memory was 16.6 MB in the beginning and 29.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 47.2 MB. Free memory was 29.2 MB in the beginning and 27.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,211 INFO L168 Benchmark]: Boogie Preprocessor took 22.16 ms. Allocated memory is still 47.2 MB. Free memory was 27.8 MB in the beginning and 26.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,211 INFO L168 Benchmark]: RCFGBuilder took 353.27 ms. Allocated memory was 47.2 MB in the beginning and 48.2 MB in the end (delta: 1.0 MB). Free memory was 26.5 MB in the beginning and 27.4 MB in the end (delta: -953.8 kB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,212 INFO L168 Benchmark]: BuchiAutomizer took 41324.64 ms. Allocated memory was 48.2 MB in the beginning and 136.3 MB in the end (delta: 88.1 MB). Free memory was 27.2 MB in the beginning and 65.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 49.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:00:27,212 INFO L168 Benchmark]: Witness Printer took 4.34 ms. Allocated memory is still 136.3 MB. Free memory is still 63.9 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:00:27,219 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 38.8 MB. Free memory was 21.5 MB in the beginning and 21.5 MB in the end (delta: 53.5 kB). Peak memory consumption was 53.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 375.51 ms. Allocated memory was 39.8 MB in the beginning and 47.2 MB in the end (delta: 7.3 MB). Free memory was 16.6 MB in the beginning and 29.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 47.2 MB. Free memory was 29.2 MB in the beginning and 27.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 22.16 ms. Allocated memory is still 47.2 MB. Free memory was 27.8 MB in the beginning and 26.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 353.27 ms. Allocated memory was 47.2 MB in the beginning and 48.2 MB in the end (delta: 1.0 MB). Free memory was 26.5 MB in the beginning and 27.4 MB in the end (delta: -953.8 kB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 41324.64 ms. Allocated memory was 48.2 MB in the beginning and 136.3 MB in the end (delta: 88.1 MB). Free memory was 27.2 MB in the beginning and 65.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 49.6 MB. Max. memory is 14.3 GB. * Witness Printer took 4.34 ms. Allocated memory is still 136.3 MB. Free memory is still 63.9 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 3 deterministic, 5 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 9 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.2s and 10 iterations. TraceHistogramMax:14. Analysis of lassos took 30.8s. Construction of modules took 2.2s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 356 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 744 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 354 SDtfs, 837 SDslu, 658 SDs, 0 SdLazy, 2121 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf90 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 24.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...