./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive/Fibonacci02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e40a98558d0111ea95f3ee60a44cc14c7768182 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:43:18,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:43:18,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:43:18,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:43:18,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:43:18,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:43:18,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:43:18,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:43:18,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:43:18,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:43:18,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:43:18,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:43:18,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:43:18,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:43:18,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:43:18,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:43:18,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:43:18,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:43:18,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:43:18,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:43:18,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:43:18,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:43:18,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:43:18,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:43:18,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:43:18,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:43:18,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:43:18,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:43:18,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:43:18,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:43:18,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:43:18,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:43:18,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:43:18,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:43:18,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:43:18,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:43:18,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:43:18,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:43:18,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:43:18,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:43:18,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:43:18,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:43:18,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:43:18,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:43:18,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:43:18,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:43:18,328 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:43:18,328 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:43:18,328 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:43:18,328 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:43:18,329 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:43:18,329 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:43:18,329 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:43:18,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:43:18,330 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:43:18,330 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:43:18,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:43:18,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:43:18,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:43:18,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:43:18,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:43:18,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:43:18,332 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:43:18,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:43:18,332 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:43:18,332 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:43:18,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:43:18,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:43:18,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:43:18,333 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:43:18,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:43:18,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:43:18,334 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:43:18,335 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:43:18,335 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2019-11-28 03:43:18,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:43:18,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:43:18,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:43:18,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:43:18,683 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:43:18,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 03:43:18,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ba76c45/6545921fb36c4bfbab4875e2a77f23f2/FLAGafe923a2a [2019-11-28 03:43:19,187 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:43:19,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 03:43:19,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ba76c45/6545921fb36c4bfbab4875e2a77f23f2/FLAGafe923a2a [2019-11-28 03:43:19,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ba76c45/6545921fb36c4bfbab4875e2a77f23f2 [2019-11-28 03:43:19,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:43:19,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:43:19,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:43:19,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:43:19,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:43:19,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab6639b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19, skipping insertion in model container [2019-11-28 03:43:19,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:43:19,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:43:19,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:43:19,807 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:43:19,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:43:19,831 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:43:19,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19 WrapperNode [2019-11-28 03:43:19,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:43:19,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:43:19,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:43:19,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:43:19,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:43:19,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:43:19,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:43:19,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:43:19,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... [2019-11-28 03:43:19,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:43:19,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:43:19,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:43:19,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:43:19,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 03:43:19,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 03:43:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:43:19,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:43:20,154 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:43:20,154 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 03:43:20,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:20 BoogieIcfgContainer [2019-11-28 03:43:20,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:43:20,156 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:43:20,157 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:43:20,160 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:43:20,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:43:20,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:43:19" (1/3) ... [2019-11-28 03:43:20,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38ff21f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:43:20, skipping insertion in model container [2019-11-28 03:43:20,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:43:20,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:19" (2/3) ... [2019-11-28 03:43:20,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38ff21f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:43:20, skipping insertion in model container [2019-11-28 03:43:20,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:43:20,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:20" (3/3) ... [2019-11-28 03:43:20,165 INFO L371 chiAutomizerObserver]: Analyzing ICFG Fibonacci02.c [2019-11-28 03:43:20,217 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:43:20,218 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:43:20,218 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:43:20,218 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:43:20,218 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:43:20,218 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:43:20,218 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:43:20,219 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:43:20,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 03:43:20,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:43:20,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:20,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:20,286 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:43:20,287 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:43:20,287 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:43:20,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 03:43:20,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:43:20,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:20,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:20,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:43:20,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:43:20,303 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6#L27true call main_#t~ret2 := fibonacci(main_~x~0);< 16#fibonacciENTRYtrue [2019-11-28 03:43:20,304 INFO L796 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2019-11-28 03:43:20,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:20,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2019-11-28 03:43:20,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:20,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362061059] [2019-11-28 03:43:20,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:20,450 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2019-11-28 03:43:20,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:20,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391915356] [2019-11-28 03:43:20,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:20,467 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2019-11-28 03:43:20,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:20,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053252578] [2019-11-28 03:43:20,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:20,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:20,659 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:20,660 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:20,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:20,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:20,661 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:20,662 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:20,662 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:20,662 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:20,662 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2019-11-28 03:43:20,662 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:20,663 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:20,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:20,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:20,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:20,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:20,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:20,810 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:20,811 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:20,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:20,821 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:20,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:20,836 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 [2019-11-28 03:43:20,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:20,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:20,850 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:20,850 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:20,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:20,863 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 [2019-11-28 03:43:20,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:20,869 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:20,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:20,883 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:20,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:20,889 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) [2019-11-28 03:43:20,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:20,904 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:20,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:20,927 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:20,990 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:20,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:20,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:20,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:20,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:20,993 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:20,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:20,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:20,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:20,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration1_Loop [2019-11-28 03:43:20,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:20,994 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:20,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:21,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:21,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:21,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:21,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:21,117 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:21,123 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:21,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:21,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:21,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:21,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:21,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:21,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:21,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:21,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:21,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:21,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:21,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:21,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:21,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:21,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:21,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:21,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:21,180 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 [2019-11-28 03:43:21,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:21,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:21,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:21,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:21,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:21,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:21,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:21,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:21,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:21,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:21,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:21,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:21,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:21,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:21,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:21,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:21,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:21,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:21,244 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 [2019-11-28 03:43:21,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:21,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:21,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:21,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:21,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:21,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:21,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:21,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:21,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:21,274 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:43:21,274 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:21,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:21,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:21,285 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:21,286 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2019-11-28 03:43:21,291 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:43:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:43:21,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:21,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:21,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:43:21,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-11-28 03:43:21,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2019-11-28 03:43:21,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:43:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 03:43:21,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 03:43:21,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:21,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 03:43:21,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:21,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-28 03:43:21,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:21,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-28 03:43:21,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:43:21,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2019-11-28 03:43:21,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:43:21,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:43:21,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-28 03:43:21,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:21,601 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 03:43:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-28 03:43:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-28 03:43:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:43:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-28 03:43:21,633 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 03:43:21,634 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-28 03:43:21,634 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:43:21,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-28 03:43:21,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:43:21,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:21,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:21,637 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:21,638 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:21,638 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 120#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 128#fibonacciENTRY ~n := #in~n; 125#L15 assume !(~n < 1); 126#L17 assume !(1 == ~n); 118#L20 call #t~ret0 := fibonacci(~n - 1);< 119#fibonacciENTRY ~n := #in~n; 122#L15 assume ~n < 1;#res := 0; 123#fibonacciFINAL assume true; 121#fibonacciEXIT >#28#return; 116#L20-1 [2019-11-28 03:43:21,638 INFO L796 eck$LassoCheckResult]: Loop: 116#L20-1 call #t~ret1 := fibonacci(~n - 2);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume !(~n < 1); 131#L17 assume !(1 == ~n); 115#L20 call #t~ret0 := fibonacci(~n - 1);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume ~n < 1;#res := 0; 130#fibonacciFINAL assume true; 132#fibonacciEXIT >#28#return; 116#L20-1 [2019-11-28 03:43:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2019-11-28 03:43:21,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:21,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489265805] [2019-11-28 03:43:21,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:21,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489265805] [2019-11-28 03:43:21,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469681061] [2019-11-28 03:43:21,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:43:21,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:21,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:21,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:43:21,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66802806] [2019-11-28 03:43:21,816 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2019-11-28 03:43:21,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:21,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010708066] [2019-11-28 03:43:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:43:21,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010708066] [2019-11-28 03:43:21,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:43:21,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:43:21,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491881881] [2019-11-28 03:43:21,902 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:43:21,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:43:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:43:21,908 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 03:43:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:22,008 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-28 03:43:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:43:22,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-28 03:43:22,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:43:22,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-28 03:43:22,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 03:43:22,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 03:43:22,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-28 03:43:22,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:22,014 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:43:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-28 03:43:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 03:43:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:43:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-28 03:43:22,019 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:43:22,019 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:43:22,019 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:43:22,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-28 03:43:22,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:43:22,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:22,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:22,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:22,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 03:43:22,027 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 219#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 228#fibonacciENTRY ~n := #in~n; 225#L15 assume !(~n < 1); 226#L17 assume !(1 == ~n); 218#L20 call #t~ret0 := fibonacci(~n - 1);< 220#fibonacciENTRY ~n := #in~n; 223#L15 assume !(~n < 1); 224#L17 assume 1 == ~n;#res := 1; 229#fibonacciFINAL assume true; 235#fibonacciEXIT >#28#return; 216#L20-1 [2019-11-28 03:43:22,027 INFO L796 eck$LassoCheckResult]: Loop: 216#L20-1 call #t~ret1 := fibonacci(~n - 2);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume !(1 == ~n); 215#L20 call #t~ret0 := fibonacci(~n - 1);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume !(1 == ~n); 215#L20 call #t~ret0 := fibonacci(~n - 1);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume !(~n < 1); 232#L17 assume 1 == ~n;#res := 1; 233#fibonacciFINAL assume true; 234#fibonacciEXIT >#28#return; 216#L20-1 call #t~ret1 := fibonacci(~n - 2);< 217#fibonacciENTRY ~n := #in~n; 236#L15 assume ~n < 1;#res := 0; 237#fibonacciFINAL assume true; 221#fibonacciEXIT >#30#return; 222#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 230#fibonacciFINAL assume true; 231#fibonacciEXIT >#28#return; 216#L20-1 [2019-11-28 03:43:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2019-11-28 03:43:22,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:22,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880242346] [2019-11-28 03:43:22,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:22,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880242346] [2019-11-28 03:43:22,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825363946] [2019-11-28 03:43:22,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:22,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:43:22,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:22,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:22,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:43:22,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386152782] [2019-11-28 03:43:22,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash 476609746, now seen corresponding path program 1 times [2019-11-28 03:43:22,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:22,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323187304] [2019-11-28 03:43:22,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:22,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:22,476 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:22,476 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:22,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:22,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:22,477 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:22,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:22,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:22,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:22,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2019-11-28 03:43:22,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:22,478 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:22,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:22,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:22,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:22,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:22,559 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:22,559 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:22,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:22,567 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:22,573 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:22,573 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=1} Honda state: {fibonacci_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:22,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:22,589 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:22,600 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:22,600 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:22,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:22,613 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:22,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:22,634 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:23,789 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:23,792 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:23,792 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:23,792 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:23,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:23,792 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:23,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:23,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:23,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:23,793 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration3_Loop [2019-11-28 03:43:23,793 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:23,793 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:23,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:23,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:23,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:23,864 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:23,864 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:23,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:23,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:23,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:23,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:23,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:23,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:23,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:23,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:23,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:23,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:23,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:23,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:23,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:23,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:23,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:23,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:23,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:23,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:23,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:43:23,912 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:23,918 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:23,918 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:23,918 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:23,919 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 03:43:23,922 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:23,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:43:23,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:43:24,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:43:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:43:24,137 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 03:43:24,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 03:43:24,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 134 states and 182 transitions. Complement of second has 36 states. [2019-11-28 03:43:24,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:43:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-28 03:43:24,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 11 letters. Loop has 22 letters. [2019-11-28 03:43:24,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:24,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 33 letters. Loop has 22 letters. [2019-11-28 03:43:24,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:24,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 11 letters. Loop has 44 letters. [2019-11-28 03:43:24,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:24,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-28 03:43:24,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:43:24,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-28 03:43:24,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-28 03:43:24,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 03:43:24,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-28 03:43:24,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:24,419 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-28 03:43:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-28 03:43:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-28 03:43:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 03:43:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-28 03:43:24,436 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-28 03:43:24,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:24,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:43:24,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:43:24,437 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-28 03:43:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:24,540 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-28 03:43:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:43:24,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-28 03:43:24,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:43:24,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-28 03:43:24,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-28 03:43:24,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 03:43:24,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-28 03:43:24,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:24,552 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-28 03:43:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-28 03:43:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-28 03:43:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 03:43:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-28 03:43:24,565 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 03:43:24,565 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 03:43:24,565 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:43:24,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-28 03:43:24,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:43:24,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:24,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:24,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:24,571 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-28 03:43:24,571 INFO L794 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 795#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 803#fibonacciENTRY ~n := #in~n; 844#L15 assume !(~n < 1); 843#L17 assume !(1 == ~n); 794#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 800#L15 assume !(~n < 1); 802#L17 assume !(1 == ~n); 801#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 800#L15 assume !(~n < 1); 802#L17 assume !(1 == ~n); 801#L20 call #t~ret0 := fibonacci(~n - 1);< 796#fibonacciENTRY ~n := #in~n; 810#L15 assume !(~n < 1); 842#L17 assume 1 == ~n;#res := 1; 841#fibonacciFINAL assume true; 840#fibonacciEXIT >#28#return; 813#L20-1 call #t~ret1 := fibonacci(~n - 2);< 838#fibonacciENTRY ~n := #in~n; 872#L15 assume ~n < 1;#res := 0; 871#fibonacciFINAL assume true; 870#fibonacciEXIT >#30#return; 869#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 866#fibonacciFINAL assume true; 863#fibonacciEXIT >#28#return; 791#L20-1 [2019-11-28 03:43:24,571 INFO L796 eck$LassoCheckResult]: Loop: 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume 1 == ~n;#res := 1; 860#fibonacciFINAL assume true; 861#fibonacciEXIT >#28#return; 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume !(1 == ~n); 790#L20 call #t~ret0 := fibonacci(~n - 1);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume !(~n < 1); 847#L17 assume 1 == ~n;#res := 1; 860#fibonacciFINAL assume true; 861#fibonacciEXIT >#28#return; 791#L20-1 call #t~ret1 := fibonacci(~n - 2);< 793#fibonacciENTRY ~n := #in~n; 845#L15 assume ~n < 1;#res := 0; 846#fibonacciFINAL assume true; 868#fibonacciEXIT >#30#return; 862#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 865#fibonacciFINAL assume true; 864#fibonacciEXIT >#30#return; 862#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 865#fibonacciFINAL assume true; 864#fibonacciEXIT >#28#return; 791#L20-1 [2019-11-28 03:43:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2019-11-28 03:43:24,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:24,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419440351] [2019-11-28 03:43:24,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:24,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419440351] [2019-11-28 03:43:24,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402705018] [2019-11-28 03:43:24,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:43:24,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:24,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:24,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 03:43:24,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93002819] [2019-11-28 03:43:24,759 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1986955448, now seen corresponding path program 2 times [2019-11-28 03:43:24,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:24,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065418804] [2019-11-28 03:43:24,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 03:43:24,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065418804] [2019-11-28 03:43:24,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739204418] [2019-11-28 03:43:24,891 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:24,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:43:24,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:24,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:43:24,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 03:43:24,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:24,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 03:43:24,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233199325] [2019-11-28 03:43:24,970 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:43:24,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 03:43:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:43:24,971 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-28 03:43:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:25,280 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-11-28 03:43:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:43:25,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-11-28 03:43:25,285 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 03:43:25,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-11-28 03:43:25,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-28 03:43:25,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-28 03:43:25,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-11-28 03:43:25,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:25,291 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 03:43:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-11-28 03:43:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 03:43:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 03:43:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-28 03:43:25,303 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 03:43:25,303 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 03:43:25,303 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:43:25,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-11-28 03:43:25,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 03:43:25,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:25,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:25,308 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:25,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 4, 4, 4, 4, 3, 3, 2, 2] [2019-11-28 03:43:25,309 INFO L794 eck$LassoCheckResult]: Stem: 1300#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 1301#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 1308#fibonacciENTRY ~n := #in~n; 1349#L15 assume !(~n < 1); 1313#L17 assume !(1 == ~n); 1298#L20 call #t~ret0 := fibonacci(~n - 1);< 1310#fibonacciENTRY ~n := #in~n; 1306#L15 assume !(~n < 1); 1307#L17 assume !(1 == ~n); 1297#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1347#L15 assume !(~n < 1); 1345#L17 assume !(1 == ~n); 1340#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1347#L15 assume !(~n < 1); 1345#L17 assume !(1 == ~n); 1340#L20 call #t~ret0 := fibonacci(~n - 1);< 1299#fibonacciENTRY ~n := #in~n; 1348#L15 assume !(~n < 1); 1346#L17 assume 1 == ~n;#res := 1; 1344#fibonacciFINAL assume true; 1343#fibonacciEXIT >#28#return; 1323#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1341#fibonacciENTRY ~n := #in~n; 1391#L15 assume ~n < 1;#res := 0; 1390#fibonacciFINAL assume true; 1389#fibonacciEXIT >#30#return; 1387#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1386#fibonacciFINAL assume true; 1382#fibonacciEXIT >#28#return; 1353#L20-1 [2019-11-28 03:43:25,309 INFO L796 eck$LassoCheckResult]: Loop: 1353#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume 1 == ~n;#res := 1; 1312#fibonacciFINAL assume true; 1393#fibonacciEXIT >#28#return; 1294#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1296#fibonacciENTRY ~n := #in~n; 1350#L15 assume ~n < 1;#res := 0; 1351#fibonacciFINAL assume true; 1394#fibonacciEXIT >#30#return; 1377#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1392#fibonacciFINAL assume true; 1381#fibonacciEXIT >#28#return; 1353#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume !(1 == ~n); 1356#L20 call #t~ret0 := fibonacci(~n - 1);< 1352#fibonacciENTRY ~n := #in~n; 1357#L15 assume !(~n < 1); 1385#L17 assume 1 == ~n;#res := 1; 1312#fibonacciFINAL assume true; 1393#fibonacciEXIT >#28#return; 1294#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1296#fibonacciENTRY ~n := #in~n; 1350#L15 assume ~n < 1;#res := 0; 1351#fibonacciFINAL assume true; 1394#fibonacciEXIT >#30#return; 1377#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1392#fibonacciFINAL assume true; 1381#fibonacciEXIT >#30#return; 1379#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1384#fibonacciFINAL assume true; 1378#fibonacciEXIT >#28#return; 1353#L20-1 [2019-11-28 03:43:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:25,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2008361138, now seen corresponding path program 2 times [2019-11-28 03:43:25,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:25,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517229973] [2019-11-28 03:43:25,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:25,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517229973] [2019-11-28 03:43:25,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135121949] [2019-11-28 03:43:25,450 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:25,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:43:25,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:25,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 03:43:25,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:25,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:25,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 03:43:25,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062814894] [2019-11-28 03:43:25,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1980387862, now seen corresponding path program 3 times [2019-11-28 03:43:25,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:25,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959989327] [2019-11-28 03:43:25,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-28 03:43:25,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959989327] [2019-11-28 03:43:25,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028428651] [2019-11-28 03:43:25,724 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:25,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 03:43:25,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:25,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:43:25,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 49 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 03:43:25,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:25,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2019-11-28 03:43:25,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564140157] [2019-11-28 03:43:25,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:43:25,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 03:43:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-28 03:43:25,829 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 14 states. [2019-11-28 03:43:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:26,110 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2019-11-28 03:43:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 03:43:26,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 171 transitions. [2019-11-28 03:43:26,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 03:43:26,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 125 states and 169 transitions. [2019-11-28 03:43:26,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-28 03:43:26,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-28 03:43:26,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 169 transitions. [2019-11-28 03:43:26,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:26,120 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-28 03:43:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 169 transitions. [2019-11-28 03:43:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-28 03:43:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 03:43:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2019-11-28 03:43:26,133 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-28 03:43:26,133 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-28 03:43:26,133 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:43:26,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 169 transitions. [2019-11-28 03:43:26,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 03:43:26,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:26,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:26,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:26,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 03:43:26,138 INFO L794 eck$LassoCheckResult]: Stem: 1935#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 1921#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 1936#fibonacciENTRY ~n := #in~n; 1933#L15 assume !(~n < 1); 1934#L17 assume !(1 == ~n); 1920#L20 call #t~ret0 := fibonacci(~n - 1);< 1922#fibonacciENTRY ~n := #in~n; 1940#L15 assume !(~n < 1); 1948#L17 assume !(1 == ~n); 1949#L20 call #t~ret0 := fibonacci(~n - 1);< 1990#fibonacciENTRY ~n := #in~n; 1989#L15 assume !(~n < 1); 1988#L17 assume !(1 == ~n); 1975#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1987#L15 assume !(~n < 1); 1986#L17 assume !(1 == ~n); 1976#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1987#L15 assume !(~n < 1); 1986#L17 assume !(1 == ~n); 1976#L20 call #t~ret0 := fibonacci(~n - 1);< 1981#fibonacciENTRY ~n := #in~n; 1985#L15 assume !(~n < 1); 1984#L17 assume 1 == ~n;#res := 1; 1982#fibonacciFINAL assume true; 1980#fibonacciEXIT >#28#return; 1955#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1977#fibonacciENTRY ~n := #in~n; 2028#L15 assume ~n < 1;#res := 0; 2026#fibonacciFINAL assume true; 2025#fibonacciEXIT >#30#return; 2024#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2023#fibonacciFINAL assume true; 2017#fibonacciEXIT >#28#return; 1944#L20-1 [2019-11-28 03:43:26,138 INFO L796 eck$LassoCheckResult]: Loop: 1944#L20-1 call #t~ret1 := fibonacci(~n - 2);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume !(1 == ~n); 1945#L20 call #t~ret0 := fibonacci(~n - 1);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume !(1 == ~n); 1945#L20 call #t~ret0 := fibonacci(~n - 1);< 2021#fibonacciENTRY ~n := #in~n; 2040#L15 assume !(~n < 1); 1941#L17 assume 1 == ~n;#res := 1; 1947#fibonacciFINAL assume true; 2012#fibonacciEXIT >#28#return; 1917#L20-1 call #t~ret1 := fibonacci(~n - 2);< 1919#fibonacciENTRY ~n := #in~n; 2035#L15 assume ~n < 1;#res := 0; 2036#fibonacciFINAL assume true; 2030#fibonacciEXIT >#30#return; 2013#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2027#fibonacciFINAL assume true; 2018#fibonacciEXIT >#28#return; 1944#L20-1 [2019-11-28 03:43:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 463907735, now seen corresponding path program 3 times [2019-11-28 03:43:26,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:26,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140747712] [2019-11-28 03:43:26,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:26,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140747712] [2019-11-28 03:43:26,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796795741] [2019-11-28 03:43:26,311 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:26,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 03:43:26,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:26,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:43:26,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:26,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:26,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-11-28 03:43:26,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493696417] [2019-11-28 03:43:26,392 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 476609746, now seen corresponding path program 4 times [2019-11-28 03:43:26,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:26,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249091047] [2019-11-28 03:43:26,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:26,405 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:26,614 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:26,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:26,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:26,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:26,614 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:26,615 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:26,615 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:26,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:26,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2019-11-28 03:43:26,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:26,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:26,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:26,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:26,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:26,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:26,681 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:26,681 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:26,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:26,690 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:26,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:26,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:27,523 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:27,525 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:27,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:27,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:27,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:27,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:27,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:27,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:27,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:27,527 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration6_Loop [2019-11-28 03:43:27,527 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:27,527 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:27,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:27,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:27,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:27,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:27,592 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:27,592 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:27,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:27,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:27,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:27,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:27,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:27,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:27,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:27,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:27,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:27,609 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:43:27,610 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:27,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:27,615 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:27,616 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:27,616 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 03:43:27,618 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:43:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:27,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:43:27,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:27,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:27,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:27,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:43:27,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:43:27,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 03:43:27,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-28 03:43:28,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 194 states and 261 transitions. Complement of second has 33 states. [2019-11-28 03:43:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:43:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-28 03:43:28,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-28 03:43:28,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:28,080 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:28,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:43:28,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:28,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:28,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:28,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:43:28,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:43:28,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 03:43:28,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-28 03:43:28,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 319 states and 430 transitions. Complement of second has 25 states. [2019-11-28 03:43:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:43:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-28 03:43:28,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-28 03:43:28,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:28,440 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:28,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:43:28,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:28,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:28,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:43:28,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:43:28,608 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-28 03:43:28,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50 Second operand 8 states. [2019-11-28 03:43:28,902 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 169 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 1094 states and 1539 transitions. Complement of second has 130 states. [2019-11-28 03:43:28,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:43:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-28 03:43:28,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 35 letters. Loop has 22 letters. [2019-11-28 03:43:28,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:28,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 57 letters. Loop has 22 letters. [2019-11-28 03:43:28,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:28,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 35 letters. Loop has 44 letters. [2019-11-28 03:43:28,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:28,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1094 states and 1539 transitions. [2019-11-28 03:43:28,930 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-28 03:43:28,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1094 states to 618 states and 954 transitions. [2019-11-28 03:43:28,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2019-11-28 03:43:28,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2019-11-28 03:43:28,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 954 transitions. [2019-11-28 03:43:28,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:28,949 INFO L688 BuchiCegarLoop]: Abstraction has 618 states and 954 transitions. [2019-11-28 03:43:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 954 transitions. [2019-11-28 03:43:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 494. [2019-11-28 03:43:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-28 03:43:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-11-28 03:43:28,989 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-28 03:43:28,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:28,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:43:28,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:43:28,990 INFO L87 Difference]: Start difference. First operand 494 states and 746 transitions. Second operand 16 states. [2019-11-28 03:43:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:29,299 INFO L93 Difference]: Finished difference Result 567 states and 846 transitions. [2019-11-28 03:43:29,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 03:43:29,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 846 transitions. [2019-11-28 03:43:29,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:29,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 561 states and 837 transitions. [2019-11-28 03:43:29,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2019-11-28 03:43:29,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2019-11-28 03:43:29,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 837 transitions. [2019-11-28 03:43:29,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:29,322 INFO L688 BuchiCegarLoop]: Abstraction has 561 states and 837 transitions. [2019-11-28 03:43:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 837 transitions. [2019-11-28 03:43:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 534. [2019-11-28 03:43:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-28 03:43:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 805 transitions. [2019-11-28 03:43:29,347 INFO L711 BuchiCegarLoop]: Abstraction has 534 states and 805 transitions. [2019-11-28 03:43:29,347 INFO L591 BuchiCegarLoop]: Abstraction has 534 states and 805 transitions. [2019-11-28 03:43:29,347 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:43:29,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 534 states and 805 transitions. [2019-11-28 03:43:29,351 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:29,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:29,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:29,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:29,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:43:29,354 INFO L794 eck$LassoCheckResult]: Stem: 5645#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 5646#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 5647#fibonacciENTRY ~n := #in~n; 5648#L15 assume !(~n < 1); 5711#L17 assume !(1 == ~n); 5707#L20 call #t~ret0 := fibonacci(~n - 1);< 5710#fibonacciENTRY ~n := #in~n; 5709#L15 assume !(~n < 1); 5708#L17 assume !(1 == ~n); 5703#L20 call #t~ret0 := fibonacci(~n - 1);< 5706#fibonacciENTRY ~n := #in~n; 5705#L15 assume !(~n < 1); 5704#L17 assume !(1 == ~n); 5699#L20 call #t~ret0 := fibonacci(~n - 1);< 5701#fibonacciENTRY ~n := #in~n; 5702#L15 assume !(~n < 1); 5698#L17 assume !(1 == ~n); 5652#L20 call #t~ret0 := fibonacci(~n - 1);< 5695#fibonacciENTRY ~n := #in~n; 5697#L15 assume !(~n < 1); 5700#L17 assume !(1 == ~n); 5651#L20 call #t~ret0 := fibonacci(~n - 1);< 5695#fibonacciENTRY ~n := #in~n; 5696#L15 assume !(~n < 1); 5650#L17 assume 1 == ~n;#res := 1; 5653#fibonacciFINAL assume true; 6047#fibonacciEXIT >#28#return; 5636#L20-1 call #t~ret1 := fibonacci(~n - 2);< 5899#fibonacciENTRY ~n := #in~n; 5935#L15 assume !(~n < 1); 5927#L17 assume !(1 == ~n); 5928#L20 call #t~ret0 := fibonacci(~n - 1);< 5937#fibonacciENTRY ~n := #in~n; 6049#L15 assume !(~n < 1); 5939#L17 assume !(1 == ~n); 5940#L20 call #t~ret0 := fibonacci(~n - 1);< 5957#fibonacciENTRY [2019-11-28 03:43:29,354 INFO L796 eck$LassoCheckResult]: Loop: 5957#fibonacciENTRY ~n := #in~n; 5970#L15 assume !(~n < 1); 5967#L17 assume !(1 == ~n); 5955#L20 call #t~ret0 := fibonacci(~n - 1);< 5957#fibonacciENTRY [2019-11-28 03:43:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:29,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2028848867, now seen corresponding path program 1 times [2019-11-28 03:43:29,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:29,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752912406] [2019-11-28 03:43:29,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:29,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752912406] [2019-11-28 03:43:29,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361458060] [2019-11-28 03:43:29,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:29,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:43:29,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 46 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:43:29,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:29,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 22 [2019-11-28 03:43:29,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905230125] [2019-11-28 03:43:29,635 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:29,635 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2019-11-28 03:43:29,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:29,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179409253] [2019-11-28 03:43:29,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:29,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:29,671 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:29,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:29,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:29,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:29,671 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:29,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,672 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:29,672 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:29,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2019-11-28 03:43:29,672 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:29,672 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:29,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,731 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:29,732 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:29,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:29,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:29,741 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:29,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:29,750 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:29,750 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:29,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:29,758 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:29,758 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:29,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:29,765 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:29,766 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:29,771 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:29,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:29,784 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:29,790 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:29,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:29,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:29,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:29,791 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:29,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:29,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:29,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration7_Loop [2019-11-28 03:43:29,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:29,791 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:29,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:29,854 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:29,854 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:29,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:29,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:29,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:29,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:29,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:29,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:29,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:29,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:29,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:29,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:29,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:29,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:29,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:29,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:29,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:29,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:29,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:29,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:29,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:29,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:29,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:29,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:29,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:29,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:29,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:29,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:29,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:29,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:29,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:29,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:29,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:29,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,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 [2019-11-28 03:43:29,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:29,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:29,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:29,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:29,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:29,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:29,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:29,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:29,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:43:29,920 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:29,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:29,925 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:29,925 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:29,925 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:43:29,928 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:43:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:30,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 03:43:30,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:30,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:30,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:30,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 03:43:30,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-28 03:43:30,118 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 550 states and 821 transitions. Complement of second has 13 states. [2019-11-28 03:43:30,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:43:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 03:43:30,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 03:43:30,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:30,120 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:30,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 03:43:30,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:30,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:30,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:30,229 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 03:43:30,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [2019-11-28 03:43:30,318 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 550 states and 821 transitions. Complement of second has 13 states. [2019-11-28 03:43:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:43:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 03:43:30,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 03:43:30,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:30,320 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:30,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 03:43:30,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:30,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:30,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:30,459 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 03:43:30,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281 Second operand 5 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:43:30,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 534 states and 805 transitions. cyclomatic complexity: 281. Second operand 5 states. Result 701 states and 990 transitions. Complement of second has 14 states. [2019-11-28 03:43:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:43:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 03:43:30,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 03:43:30,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:30,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 40 letters. Loop has 4 letters. [2019-11-28 03:43:30,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:30,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 8 letters. [2019-11-28 03:43:30,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:30,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 701 states and 990 transitions. [2019-11-28 03:43:30,582 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:30,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 701 states to 588 states and 865 transitions. [2019-11-28 03:43:30,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2019-11-28 03:43:30,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2019-11-28 03:43:30,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 588 states and 865 transitions. [2019-11-28 03:43:30,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:30,594 INFO L688 BuchiCegarLoop]: Abstraction has 588 states and 865 transitions. [2019-11-28 03:43:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states and 865 transitions. [2019-11-28 03:43:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 558. [2019-11-28 03:43:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-28 03:43:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 829 transitions. [2019-11-28 03:43:30,614 INFO L711 BuchiCegarLoop]: Abstraction has 558 states and 829 transitions. [2019-11-28 03:43:30,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 03:43:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-28 03:43:30,616 INFO L87 Difference]: Start difference. First operand 558 states and 829 transitions. Second operand 22 states. [2019-11-28 03:43:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:31,123 INFO L93 Difference]: Finished difference Result 650 states and 972 transitions. [2019-11-28 03:43:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 03:43:31,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 972 transitions. [2019-11-28 03:43:31,133 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:31,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 635 states and 951 transitions. [2019-11-28 03:43:31,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-28 03:43:31,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-28 03:43:31,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 951 transitions. [2019-11-28 03:43:31,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:31,146 INFO L688 BuchiCegarLoop]: Abstraction has 635 states and 951 transitions. [2019-11-28 03:43:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 951 transitions. [2019-11-28 03:43:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 590. [2019-11-28 03:43:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-28 03:43:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 881 transitions. [2019-11-28 03:43:31,169 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 881 transitions. [2019-11-28 03:43:31,169 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 881 transitions. [2019-11-28 03:43:31,169 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:43:31,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 881 transitions. [2019-11-28 03:43:31,173 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:31,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:31,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:31,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 8, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:31,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:43:31,175 INFO L794 eck$LassoCheckResult]: Stem: 9768#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 9769#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 9770#fibonacciENTRY ~n := #in~n; 9856#L15 assume !(~n < 1); 9855#L17 assume !(1 == ~n); 9831#L20 call #t~ret0 := fibonacci(~n - 1);< 9832#fibonacciENTRY ~n := #in~n; 9839#L15 assume !(~n < 1); 9836#L17 assume !(1 == ~n); 9834#L20 call #t~ret0 := fibonacci(~n - 1);< 9850#fibonacciENTRY ~n := #in~n; 9854#L15 assume !(~n < 1); 9853#L17 assume !(1 == ~n); 9845#L20 call #t~ret0 := fibonacci(~n - 1);< 9852#fibonacciENTRY ~n := #in~n; 9876#L15 assume !(~n < 1); 9874#L17 assume !(1 == ~n); 9841#L20 call #t~ret0 := fibonacci(~n - 1);< 9849#fibonacciENTRY ~n := #in~n; 9912#L15 assume !(~n < 1); 9910#L17 assume !(1 == ~n); 9866#L20 call #t~ret0 := fibonacci(~n - 1);< 9879#fibonacciENTRY ~n := #in~n; 9986#L15 assume !(~n < 1); 9985#L17 assume !(1 == ~n); 9863#L20 call #t~ret0 := fibonacci(~n - 1);< 9879#fibonacciENTRY ~n := #in~n; 10011#L15 assume !(~n < 1); 10068#L17 assume 1 == ~n;#res := 1; 10067#fibonacciFINAL assume true; 10066#fibonacciEXIT >#28#return; 9772#L20-1 call #t~ret1 := fibonacci(~n - 2);< 9984#fibonacciENTRY ~n := #in~n; 10248#L15 assume !(~n < 1); 10240#L17 assume !(1 == ~n); 10241#L20 call #t~ret0 := fibonacci(~n - 1);< 10250#fibonacciENTRY ~n := #in~n; 10267#L15 assume !(~n < 1); 10264#L17 assume !(1 == ~n); 9803#L20 call #t~ret0 := fibonacci(~n - 1);< 9805#fibonacciENTRY ~n := #in~n; 9806#L15 assume !(~n < 1); 10278#L17 assume !(1 == ~n); 9801#L20 [2019-11-28 03:43:31,176 INFO L796 eck$LassoCheckResult]: Loop: 9801#L20 call #t~ret0 := fibonacci(~n - 1);< 9805#fibonacciENTRY ~n := #in~n; 9806#L15 assume !(~n < 1); 10278#L17 assume !(1 == ~n); 9801#L20 [2019-11-28 03:43:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1567609232, now seen corresponding path program 2 times [2019-11-28 03:43:31,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:31,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296348550] [2019-11-28 03:43:31,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:31,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296348550] [2019-11-28 03:43:31,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537097527] [2019-11-28 03:43:31,501 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:31,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:43:31,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:31,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:43:31,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 75 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 03:43:31,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:31,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 26 [2019-11-28 03:43:31,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953843622] [2019-11-28 03:43:31,579 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2019-11-28 03:43:31,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:31,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339348040] [2019-11-28 03:43:31,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:31,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:31,631 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:31,631 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:31,631 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:31,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:31,632 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:31,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:31,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:31,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:31,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2019-11-28 03:43:31,633 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:31,633 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:31,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:31,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:31,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:31,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:31,699 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:31,699 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:31,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:31,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:31,710 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:31,710 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:31,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:31,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:31,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:31,719 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:31,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:31,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:31,727 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:31,727 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:31,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:31,734 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:31,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:31,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:32,607 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:32,609 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:32,609 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:32,609 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:32,609 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:32,609 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:32,609 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:32,610 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:32,610 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:32,610 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration8_Loop [2019-11-28 03:43:32,610 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:32,610 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:32,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:32,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:32,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:32,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:32,674 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:32,674 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:32,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:32,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:32,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:32,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:32,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:32,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:32,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:32,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:32,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:32,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:32,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:32,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:32,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:32,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:32,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:32,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:32,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:32,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:32,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:32,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:32,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:32,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:32,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:32,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:32,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:32,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:32,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:32,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:32,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:32,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:32,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:32,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:32,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:32,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:32,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:32,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:32,744 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:43:32,744 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:32,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:32,754 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:32,755 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:32,755 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:32,756 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:43:32,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:32,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:43:32,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:32,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:32,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:32,877 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:32,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301 Second operand 6 states. [2019-11-28 03:43:32,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301. Second operand 6 states. Result 608 states and 900 transitions. Complement of second has 18 states. [2019-11-28 03:43:32,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-28 03:43:32,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-28 03:43:32,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:32,946 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:33,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:43:33,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:33,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:33,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:33,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:33,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301 Second operand 6 states. [2019-11-28 03:43:33,171 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 590 states and 881 transitions. cyclomatic complexity: 301. Second operand 6 states. Result 838 states and 1222 transitions. Complement of second has 22 states. [2019-11-28 03:43:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-28 03:43:33,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-28 03:43:33,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:33,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2019-11-28 03:43:33,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:33,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-28 03:43:33,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:33,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 838 states and 1222 transitions. [2019-11-28 03:43:33,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:33,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 838 states to 768 states and 1147 transitions. [2019-11-28 03:43:33,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2019-11-28 03:43:33,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-11-28 03:43:33,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 768 states and 1147 transitions. [2019-11-28 03:43:33,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:33,214 INFO L688 BuchiCegarLoop]: Abstraction has 768 states and 1147 transitions. [2019-11-28 03:43:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states and 1147 transitions. [2019-11-28 03:43:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 755. [2019-11-28 03:43:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-28 03:43:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1130 transitions. [2019-11-28 03:43:33,248 INFO L711 BuchiCegarLoop]: Abstraction has 755 states and 1130 transitions. [2019-11-28 03:43:33,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:33,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 03:43:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-11-28 03:43:33,253 INFO L87 Difference]: Start difference. First operand 755 states and 1130 transitions. Second operand 26 states. [2019-11-28 03:43:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:33,722 INFO L93 Difference]: Finished difference Result 855 states and 1274 transitions. [2019-11-28 03:43:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 03:43:33,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 855 states and 1274 transitions. [2019-11-28 03:43:33,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:33,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 855 states to 838 states and 1248 transitions. [2019-11-28 03:43:33,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2019-11-28 03:43:33,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2019-11-28 03:43:33,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1248 transitions. [2019-11-28 03:43:33,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:33,746 INFO L688 BuchiCegarLoop]: Abstraction has 838 states and 1248 transitions. [2019-11-28 03:43:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1248 transitions. [2019-11-28 03:43:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 813. [2019-11-28 03:43:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-28 03:43:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1193 transitions. [2019-11-28 03:43:33,772 INFO L711 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 03:43:33,772 INFO L591 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 03:43:33,772 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:43:33,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 813 states and 1193 transitions. [2019-11-28 03:43:33,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:33,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:33,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:33,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 10, 9, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:33,780 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:43:33,780 INFO L794 eck$LassoCheckResult]: Stem: 13937#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 13938#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 13947#fibonacciENTRY ~n := #in~n; 14064#L15 assume !(~n < 1); 14060#L17 assume !(1 == ~n); 14042#L20 call #t~ret0 := fibonacci(~n - 1);< 14053#fibonacciENTRY ~n := #in~n; 14423#L15 assume !(~n < 1); 14342#L17 assume !(1 == ~n); 14044#L20 call #t~ret0 := fibonacci(~n - 1);< 14045#fibonacciENTRY ~n := #in~n; 14147#L15 assume !(~n < 1); 14146#L17 assume !(1 == ~n); 14143#L20 call #t~ret0 := fibonacci(~n - 1);< 14145#fibonacciENTRY ~n := #in~n; 14268#L15 assume !(~n < 1); 14266#L17 assume !(1 == ~n); 14258#L20 call #t~ret0 := fibonacci(~n - 1);< 14265#fibonacciENTRY ~n := #in~n; 14263#L15 assume !(~n < 1); 14261#L17 assume !(1 == ~n); 14163#L20 call #t~ret0 := fibonacci(~n - 1);< 14259#fibonacciENTRY ~n := #in~n; 14348#L15 assume !(~n < 1); 14347#L17 assume !(1 == ~n); 14276#L20 call #t~ret0 := fibonacci(~n - 1);< 14345#fibonacciENTRY ~n := #in~n; 14372#L15 assume !(~n < 1); 14371#L17 assume !(1 == ~n); 14277#L20 call #t~ret0 := fibonacci(~n - 1);< 14370#fibonacciENTRY ~n := #in~n; 14427#L15 assume !(~n < 1); 14426#L17 assume 1 == ~n;#res := 1; 14425#fibonacciFINAL assume true; 14424#fibonacciEXIT >#28#return; 14414#L20-1 call #t~ret1 := fibonacci(~n - 2);< 14417#fibonacciENTRY ~n := #in~n; 14420#L15 assume ~n < 1;#res := 0; 14418#fibonacciFINAL assume true; 14413#fibonacciEXIT >#30#return; 14411#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14410#fibonacciFINAL assume true; 14344#fibonacciEXIT >#28#return; 14270#L20-1 call #t~ret1 := fibonacci(~n - 2);< 14281#fibonacciENTRY ~n := #in~n; 14361#L15 assume !(~n < 1); 14368#L17 assume !(1 == ~n); 14048#L20 call #t~ret0 := fibonacci(~n - 1);< 14359#fibonacciENTRY ~n := #in~n; 14393#L15 assume !(~n < 1); 14392#L17 assume !(1 == ~n); 14029#L20 call #t~ret0 := fibonacci(~n - 1);< 14035#fibonacciENTRY ~n := #in~n; 14098#L15 assume !(~n < 1); 14097#L17 assume !(1 == ~n); 14032#L20 [2019-11-28 03:43:33,780 INFO L796 eck$LassoCheckResult]: Loop: 14032#L20 call #t~ret0 := fibonacci(~n - 1);< 14035#fibonacciENTRY ~n := #in~n; 14098#L15 assume !(~n < 1); 14097#L17 assume !(1 == ~n); 14032#L20 [2019-11-28 03:43:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 439095810, now seen corresponding path program 4 times [2019-11-28 03:43:33,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:33,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998886944] [2019-11-28 03:43:33,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 20 proven. 205 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:43:34,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998886944] [2019-11-28 03:43:34,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281514866] [2019-11-28 03:43:34,127 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:34,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:43:34,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:34,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 03:43:34,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 95 proven. 120 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 03:43:34,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:34,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 28 [2019-11-28 03:43:34,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251284728] [2019-11-28 03:43:34,216 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2019-11-28 03:43:34,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:34,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104562149] [2019-11-28 03:43:34,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:34,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:34,273 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:34,273 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:34,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:34,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:34,273 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:34,274 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:34,274 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:34,274 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:34,274 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2019-11-28 03:43:34,274 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:34,274 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:34,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:34,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:34,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:34,359 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:34,359 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:34,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:34,367 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:34,372 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:34,373 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:34,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:34,382 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:34,386 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:34,386 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:34,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:34,395 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:34,400 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:34,401 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:34,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:34,411 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 60 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:43:34,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:34,427 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:35,445 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:35,447 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:35,447 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:35,447 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:35,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:35,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:35,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:35,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:35,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:35,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration9_Loop [2019-11-28 03:43:35,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:35,448 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:35,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:35,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:35,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:35,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:35,518 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:35,519 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:35,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:35,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:35,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:35,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:35,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:35,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:35,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:35,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:35,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:35,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:35,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:35,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:35,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:35,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:35,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:35,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:35,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:35,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:35,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:35,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:35,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:35,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:35,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:35,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:35,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:35,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:35,557 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:35,560 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:43:35,561 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:35,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:35,564 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:35,565 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:35,565 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 03:43:35,566 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:43:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:35,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 03:43:35,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:35,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:35,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:35,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:35,708 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:35,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-28 03:43:35,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 838 states and 1219 transitions. Complement of second has 18 states. [2019-11-28 03:43:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-28 03:43:35,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-28 03:43:35,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:35,777 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:35,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 03:43:35,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:35,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:35,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:35,976 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:35,976 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-28 03:43:36,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 1019 states and 1430 transitions. Complement of second has 22 states. [2019-11-28 03:43:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-28 03:43:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-28 03:43:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:36,158 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:36,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 03:43:36,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:36,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:36,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:36,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:36,294 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:36,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393 Second operand 6 states. [2019-11-28 03:43:36,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 813 states and 1193 transitions. cyclomatic complexity: 393. Second operand 6 states. Result 1102 states and 1565 transitions. Complement of second has 27 states. [2019-11-28 03:43:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 03:43:36,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-28 03:43:36,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:36,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 03:43:36,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:36,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 8 letters. [2019-11-28 03:43:36,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:36,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 1565 transitions. [2019-11-28 03:43:36,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-28 03:43:36,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 813 states and 1193 transitions. [2019-11-28 03:43:36,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-28 03:43:36,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2019-11-28 03:43:36,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 813 states and 1193 transitions. [2019-11-28 03:43:36,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:36,414 INFO L688 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 03:43:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states and 1193 transitions. [2019-11-28 03:43:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2019-11-28 03:43:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-28 03:43:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1193 transitions. [2019-11-28 03:43:36,440 INFO L711 BuchiCegarLoop]: Abstraction has 813 states and 1193 transitions. [2019-11-28 03:43:36,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:36,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 03:43:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-11-28 03:43:36,441 INFO L87 Difference]: Start difference. First operand 813 states and 1193 transitions. Second operand 28 states. [2019-11-28 03:43:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:36,905 INFO L93 Difference]: Finished difference Result 387 states and 486 transitions. [2019-11-28 03:43:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 03:43:36,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 486 transitions. [2019-11-28 03:43:36,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 03:43:36,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 353 states and 450 transitions. [2019-11-28 03:43:36,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-28 03:43:36,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-11-28 03:43:36,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 450 transitions. [2019-11-28 03:43:36,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:36,917 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 450 transitions. [2019-11-28 03:43:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 450 transitions. [2019-11-28 03:43:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 328. [2019-11-28 03:43:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 03:43:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 419 transitions. [2019-11-28 03:43:36,931 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-28 03:43:36,931 INFO L591 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-28 03:43:36,931 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:43:36,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 419 transitions. [2019-11-28 03:43:36,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 03:43:36,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:43:36,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:43:36,941 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 11, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:43:36,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:43:36,942 INFO L794 eck$LassoCheckResult]: Stem: 19787#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 19788#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 19789#fibonacciENTRY ~n := #in~n; 19847#L15 assume !(~n < 1); 19846#L17 assume !(1 == ~n); 19842#L20 call #t~ret0 := fibonacci(~n - 1);< 19845#fibonacciENTRY ~n := #in~n; 19844#L15 assume !(~n < 1); 19843#L17 assume !(1 == ~n); 19838#L20 call #t~ret0 := fibonacci(~n - 1);< 19841#fibonacciENTRY ~n := #in~n; 19840#L15 assume !(~n < 1); 19839#L17 assume !(1 == ~n); 19834#L20 call #t~ret0 := fibonacci(~n - 1);< 19837#fibonacciENTRY ~n := #in~n; 19836#L15 assume !(~n < 1); 19835#L17 assume !(1 == ~n); 19830#L20 call #t~ret0 := fibonacci(~n - 1);< 19833#fibonacciENTRY ~n := #in~n; 19832#L15 assume !(~n < 1); 19831#L17 assume !(1 == ~n); 19826#L20 call #t~ret0 := fibonacci(~n - 1);< 19829#fibonacciENTRY ~n := #in~n; 19828#L15 assume !(~n < 1); 19827#L17 assume !(1 == ~n); 19820#L20 call #t~ret0 := fibonacci(~n - 1);< 19822#fibonacciENTRY ~n := #in~n; 19825#L15 assume !(~n < 1); 19824#L17 assume !(1 == ~n); 19819#L20 call #t~ret0 := fibonacci(~n - 1);< 19822#fibonacciENTRY ~n := #in~n; 19825#L15 assume !(~n < 1); 19824#L17 assume !(1 == ~n); 19819#L20 call #t~ret0 := fibonacci(~n - 1);< 19821#fibonacciENTRY ~n := #in~n; 20030#L15 assume !(~n < 1); 20029#L17 assume 1 == ~n;#res := 1; 20028#fibonacciFINAL assume true; 20025#fibonacciEXIT >#28#return; 20022#L20-1 call #t~ret1 := fibonacci(~n - 2);< 20024#fibonacciENTRY ~n := #in~n; 20039#L15 assume ~n < 1;#res := 0; 20036#fibonacciFINAL assume true; 20021#fibonacciEXIT >#30#return; 20020#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 20019#fibonacciFINAL assume true; 20013#fibonacciEXIT >#28#return; 19926#L20-1 call #t~ret1 := fibonacci(~n - 2);< 19929#fibonacciENTRY ~n := #in~n; 20016#L15 assume !(~n < 1); 20014#L17 assume !(1 == ~n); 20015#L20 call #t~ret0 := fibonacci(~n - 1);< 20052#fibonacciENTRY ~n := #in~n; 20063#L15 assume !(~n < 1); 20077#L17 assume !(1 == ~n); 19813#L20 call #t~ret0 := fibonacci(~n - 1);< 19817#fibonacciENTRY ~n := #in~n; 19818#L15 assume !(~n < 1); 20089#L17 assume !(1 == ~n); 19810#L20 [2019-11-28 03:43:36,942 INFO L796 eck$LassoCheckResult]: Loop: 19810#L20 call #t~ret0 := fibonacci(~n - 1);< 19817#fibonacciENTRY ~n := #in~n; 19818#L15 assume !(~n < 1); 20089#L17 assume !(1 == ~n); 19810#L20 [2019-11-28 03:43:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1106126005, now seen corresponding path program 5 times [2019-11-28 03:43:36,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:36,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895933469] [2019-11-28 03:43:36,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 195 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 03:43:37,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895933469] [2019-11-28 03:43:37,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533302486] [2019-11-28 03:43:37,189 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:43:37,225 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 03:43:37,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:43:37,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:43:37,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 142 proven. 11 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-28 03:43:37,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:43:37,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 25 [2019-11-28 03:43:37,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36143368] [2019-11-28 03:43:37,279 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:43:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 5 times [2019-11-28 03:43:37,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:43:37,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407636045] [2019-11-28 03:43:37,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:43:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:43:37,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:43:37,321 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:37,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:37,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:37,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:37,322 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:43:37,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:37,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:37,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:37,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration10_Loop [2019-11-28 03:43:37,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:37,323 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:37,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:37,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:37,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:37,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:37,378 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:37,379 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:37,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:37,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:37,387 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:37,387 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:37,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:37,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:37,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:43:37,397 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:37,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:43:37,403 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:37,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:43:37,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:43:46,857 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:43:46,860 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:43:46,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:43:46,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:43:46,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:43:46,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:43:46,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:46,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:43:46,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:43:46,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci02.c_Iteration10_Loop [2019-11-28 03:43:46,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:43:46,861 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:43:46,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:46,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:46,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:46,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:43:46,915 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:43:46,916 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:46,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:46,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:46,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:46,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:46,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:46,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:46,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:46,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:46,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:46,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:46,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:46,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:46,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:46,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:46,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:46,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:46,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:46,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:46,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:43:46,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:43:46,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:43:46,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:43:46,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:43:46,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:43:46,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:43:46,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:43:46,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:43:46,946 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:43:46,946 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:43:46,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:43:46,954 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:43:46,954 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:43:46,955 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2019-11-28 03:43:46,956 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:43:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:47,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 03:43:47,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:47,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:47,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:47,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:47,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:47,124 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:47,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-28 03:43:47,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 350 states and 442 transitions. Complement of second has 18 states. [2019-11-28 03:43:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-28 03:43:47,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 03:43:47,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:47,188 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:47,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 03:43:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:47,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:47,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:47,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:47,367 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-28 03:43:47,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-28 03:43:47,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 356 states and 448 transitions. Complement of second has 17 states. [2019-11-28 03:43:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-28 03:43:47,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 03:43:47,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:47,451 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:43:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:43:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:47,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 03:43:47,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:47,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:47,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:43:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:43:47,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:43:47,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:43:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:43:47,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 4 loop predicates [2019-11-28 03:43:47,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95 Second operand 6 states. [2019-11-28 03:43:47,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 419 transitions. cyclomatic complexity: 95. Second operand 6 states. Result 455 states and 575 transitions. Complement of second has 27 states. [2019-11-28 03:43:47,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:43:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:43:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 03:43:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 4 letters. [2019-11-28 03:43:47,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:47,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 63 letters. Loop has 4 letters. [2019-11-28 03:43:47,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:47,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 59 letters. Loop has 8 letters. [2019-11-28 03:43:47,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:43:47,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 575 transitions. [2019-11-28 03:43:47,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 03:43:47,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 336 states and 429 transitions. [2019-11-28 03:43:47,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2019-11-28 03:43:47,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 03:43:47,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 429 transitions. [2019-11-28 03:43:47,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:43:47,662 INFO L688 BuchiCegarLoop]: Abstraction has 336 states and 429 transitions. [2019-11-28 03:43:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 429 transitions. [2019-11-28 03:43:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 328. [2019-11-28 03:43:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 03:43:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 419 transitions. [2019-11-28 03:43:47,671 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 419 transitions. [2019-11-28 03:43:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:43:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 03:43:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2019-11-28 03:43:47,672 INFO L87 Difference]: Start difference. First operand 328 states and 419 transitions. Second operand 25 states. [2019-11-28 03:43:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:43:48,258 INFO L93 Difference]: Finished difference Result 426 states and 559 transitions. [2019-11-28 03:43:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 03:43:48,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 559 transitions. [2019-11-28 03:43:48,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:43:48,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 0 states and 0 transitions. [2019-11-28 03:43:48,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:43:48,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:43:48,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:43:48,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:43:48,265 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:43:48,265 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:43:48,265 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:43:48,265 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:43:48,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:43:48,265 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:43:48,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:43:48,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:43:48 BoogieIcfgContainer [2019-11-28 03:43:48,276 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:43:48,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:43:48,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:43:48,280 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:43:48,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:20" (3/4) ... [2019-11-28 03:43:48,286 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:43:48,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:43:48,291 INFO L168 Benchmark]: Toolchain (without parser) took 28695.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -226.9 MB). Peak memory consumption was 131.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:43:48,292 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:43:48,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.97 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:43:48,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:43:48,298 INFO L168 Benchmark]: Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:43:48,299 INFO L168 Benchmark]: RCFGBuilder took 215.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:43:48,300 INFO L168 Benchmark]: BuchiAutomizer took 28119.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.3 MB). Peak memory consumption was 158.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:43:48,300 INFO L168 Benchmark]: Witness Printer took 6.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:43:48,305 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.97 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28119.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.3 MB). Peak memory consumption was 158.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (9 trivial, 3 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 9 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 9 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.0s and 11 iterations. TraceHistogramMax:13. Analysis of lassos took 19.5s. Construction of modules took 2.4s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 328 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 813 states and ocurred in iteration 8. Nontrivial modules had stage [2, 1, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/46 HoareTripleCheckerStatistics: 324 SDtfs, 913 SDslu, 818 SDs, 0 SdLazy, 2689 SolverSat, 728 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI3 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...