./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.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-simple/fibo_2calls_8-2.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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44:04,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:44:04,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:44:04,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:44:04,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:44:04,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:44:04,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:44:04,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:44:04,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:44:04,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:44:04,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:44:04,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:44:04,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:44:04,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:44:04,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:44:04,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:44:04,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:44:04,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:44:04,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:44:04,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:44:04,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:44:04,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:44:04,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:44:04,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:44:04,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:44:04,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:44:04,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:44:04,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:44:04,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:44:04,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:44:04,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:44:04,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:44:04,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:44:04,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:44:04,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:44:04,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:44:04,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:44:04,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:44:04,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:44:04,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:44:04,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:44:04,379 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:44:04,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:44:04,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:44:04,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:44:04,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:44:04,417 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:44:04,417 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:44:04,417 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:44:04,418 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:44:04,418 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:44:04,418 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:44:04,419 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:44:04,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:44:04,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:44:04,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:44:04,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:44:04,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:44:04,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:44:04,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:44:04,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:44:04,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:44:04,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:44:04,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:44:04,423 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:44:04,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:44:04,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:44:04,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:44:04,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:44:04,425 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:44:04,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:44:04,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:44:04,426 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:44:04,428 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:44:04,429 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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2019-11-28 03:44:04,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:44:04,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:44:04,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:44:04,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:44:04,784 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:44:04,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-28 03:44:04,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049d61377/f8889f90b4244dc3bcec323e3f31311d/FLAG9a8f5f7e0 [2019-11-28 03:44:05,268 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:44:05,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-28 03:44:05,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049d61377/f8889f90b4244dc3bcec323e3f31311d/FLAG9a8f5f7e0 [2019-11-28 03:44:05,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049d61377/f8889f90b4244dc3bcec323e3f31311d [2019-11-28 03:44:05,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:44:05,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:44:05,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:44:05,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:44:05,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:44:05,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:05,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e42cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05, skipping insertion in model container [2019-11-28 03:44:05,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:05,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:44:05,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:44:05,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:44:05,952 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:44:05,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:44:05,992 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:44:05,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05 WrapperNode [2019-11-28 03:44:05,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:44:05,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:44:05,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:44:05,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:44:06,007 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:44:05" (1/1) ... [2019-11-28 03:44:06,014 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:44:05" (1/1) ... [2019-11-28 03:44:06,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:44:06,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:44:06,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:44:06,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:44:06,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... [2019-11-28 03:44:06,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:44:06,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:44:06,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:44:06,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:44:06,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:06,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:44:06,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:44:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 03:44:06,219 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 03:44:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 03:44:06,220 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 03:44:06,423 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:44:06,424 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 03:44:06,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:06 BoogieIcfgContainer [2019-11-28 03:44:06,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:44:06,426 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:44:06,426 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:44:06,430 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:44:06,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:44:06,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:44:05" (1/3) ... [2019-11-28 03:44:06,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1270f59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:44:06, skipping insertion in model container [2019-11-28 03:44:06,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:44:06,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:05" (2/3) ... [2019-11-28 03:44:06,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1270f59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:44:06, skipping insertion in model container [2019-11-28 03:44:06,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:44:06,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:06" (3/3) ... [2019-11-28 03:44:06,436 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-2.c [2019-11-28 03:44:06,503 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:44:06,504 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:44:06,504 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:44:06,505 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:44:06,507 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:44:06,507 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:44:06,507 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:44:06,508 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:44:06,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 03:44:06,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:44:06,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:06,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:06,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:44:06,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:06,586 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:44:06,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 03:44:06,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:44:06,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:06,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:06,592 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:44:06,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:06,601 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-11-28 03:44:06,602 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2019-11-28 03:44:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-11-28 03:44:06,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:06,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659743366] [2019-11-28 03:44:06,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:06,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-11-28 03:44:06,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:06,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307841285] [2019-11-28 03:44:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:06,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-11-28 03:44:06,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:06,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068622031] [2019-11-28 03:44:06,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:06,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:07,011 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:07,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:07,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:07,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:07,013 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:44:07,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:07,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:07,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration1_Loop [2019-11-28 03:44:07,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:07,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:07,031 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:44:07,037 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:44:07,040 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:44:07,053 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:44:07,056 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:44:07,060 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:44:07,065 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:44:07,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:44:07,071 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:44:07,074 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:44:07,168 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:07,169 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:07,192 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,192 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,210 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,218 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,218 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,242 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:44:07,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,246 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,266 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:44:07,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,271 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,295 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 [2019-11-28 03:44:07,300 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,300 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,318 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:44:07,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,324 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,342 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,352 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:07,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,392 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:07,397 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:07,411 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 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 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:44:07,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:44:07,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:07,495 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:44:07,498 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:07,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:07,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:07,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:07,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:44:07,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:07,499 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:07,499 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration1_Loop [2019-11-28 03:44:07,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:07,499 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:07,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:44:07,509 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:44:07,512 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:44:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:44:07,519 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:44:07,523 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:44:07,525 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:44:07,527 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:44:07,534 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:44:07,554 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:44:07,646 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:07,655 INFO L489 LassoAnalysis]: Using template 'affine'. 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:44:07,665 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:44:07,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,682 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,700 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:44:07,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,714 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:44:07,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,720 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,726 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:44:07,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,736 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,744 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:44:07,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,752 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,767 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:44:07,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,776 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,791 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:44:07,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,799 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:07,816 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:44:07,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,820 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:44:07,822 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,842 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:44:07,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:07,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:07,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:07,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:07,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:07,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:07,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:07,851 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:44:07,857 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:44:07,857 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:07,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:44:07,863 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:44:07,863 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:44:07,864 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:44:07,869 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:44:07,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:07,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:44:07,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:07,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:07,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:44:08,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 03:44:08,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-11-28 03:44:08,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2019-11-28 03:44:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:44:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-28 03:44:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-28 03:44:08,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:08,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-28 03:44:08,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:08,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-28 03:44:08,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:08,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-11-28 03:44:08,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:44:08,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-11-28 03:44:08,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-28 03:44:08,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-28 03:44:08,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-28 03:44:08,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:08,489 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-28 03:44:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-28 03:44:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-11-28 03:44:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 03:44:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-28 03:44:08,548 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-28 03:44:08,548 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-28 03:44:08,548 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:44:08,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-28 03:44:08,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:44:08,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:08,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:08,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:08,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:08,557 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2019-11-28 03:44:08,558 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2019-11-28 03:44:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-11-28 03:44:08,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:08,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101582345] [2019-11-28 03:44:08,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:08,771 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:44:08,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101582345] [2019-11-28 03:44:08,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532012775] [2019-11-28 03:44:08,773 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:44:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:08,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:44:08,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:08,827 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:44:08,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:08,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 03:44:08,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388632320] [2019-11-28 03:44:08,833 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-11-28 03:44:08,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:08,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045048966] [2019-11-28 03:44:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:08,887 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:44:08,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045048966] [2019-11-28 03:44:08,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:44:08,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:44:08,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404795265] [2019-11-28 03:44:08,889 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:44:08,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:44:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:44:08,894 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-28 03:44:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:09,005 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-11-28 03:44:09,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:44:09,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-11-28 03:44:09,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:44:09,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-11-28 03:44:09,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-28 03:44:09,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-28 03:44:09,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-11-28 03:44:09,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:09,024 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-11-28 03:44:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-11-28 03:44:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-28 03:44:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 03:44:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-28 03:44:09,039 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-28 03:44:09,039 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-28 03:44:09,039 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:44:09,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-28 03:44:09,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 03:44:09,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:09,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:09,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:09,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:09,047 INFO L794 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 387#L37 call main_#t~ret4 := fibo1(main_~x~0);< 388#fibo1ENTRY ~n := #in~n; 410#L8 assume !(~n < 1); 428#L10 assume !(1 == ~n); 383#L13 call #t~ret0 := fibo2(~n - 1);< 402#fibo2ENTRY ~n := #in~n; 430#L18 assume !(~n < 1); 431#L20 assume !(1 == ~n); 381#L23 call #t~ret2 := fibo1(~n - 1);< 386#fibo1ENTRY ~n := #in~n; 412#L8 assume !(~n < 1); 389#L10 assume 1 == ~n;#res := 1; 390#fibo1FINAL assume true; 406#fibo1EXIT >#45#return; 397#L23-1 [2019-11-28 03:44:09,048 INFO L796 eck$LassoCheckResult]: Loop: 397#L23-1 call #t~ret3 := fibo1(~n - 2);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume !(1 == ~n); 379#L13 call #t~ret0 := fibo2(~n - 1);< 424#fibo2ENTRY ~n := #in~n; 429#L18 assume !(~n < 1); 420#L20 assume !(1 == ~n); 377#L23 call #t~ret2 := fibo1(~n - 1);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume 1 == ~n;#res := 1; 408#fibo1FINAL assume true; 421#fibo1EXIT >#45#return; 397#L23-1 [2019-11-28 03:44:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-11-28 03:44:09,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:09,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879576506] [2019-11-28 03:44:09,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:09,157 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:44:09,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879576506] [2019-11-28 03:44:09,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443708679] [2019-11-28 03:44:09,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:44:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:09,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:44:09,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:09,209 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:44:09,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:09,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 03:44:09,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804105403] [2019-11-28 03:44:09,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-11-28 03:44:09,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:09,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548889956] [2019-11-28 03:44:09,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:09,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:09,420 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:09,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:09,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:09,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:09,421 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:44:09,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:09,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:09,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:09,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration3_Loop [2019-11-28 03:44:09,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:09,422 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:09,423 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:44:09,425 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:44:09,427 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:44:09,434 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:44:09,436 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:44:09,440 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:44:09,443 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:44:09,445 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:44:09,447 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:44:09,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:09,513 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:09,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:09,524 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:09,534 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:09,535 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:09,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:09,544 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:09,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:09,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:09,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:09,557 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:09,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:44:09,571 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:10,486 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:44:10,488 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:10,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:10,489 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:10,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:10,489 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:44:10,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:10,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:10,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:10,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration3_Loop [2019-11-28 03:44:10,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:10,489 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:10,491 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:44:10,495 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:44:10,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:44:10,508 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:44:10,519 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:44:10,521 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:44:10,525 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:44:10,527 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:44:10,529 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:44:10,589 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:10,590 INFO L489 LassoAnalysis]: Using template 'affine'. 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:44:10,597 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:44:10,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:10,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:10,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:10,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:10,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:10,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:10,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:10,607 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 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:44:10,613 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:44:10,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:10,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:10,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:10,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:10,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:10,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:10,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:10,622 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:10,629 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:44:10,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:10,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:10,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:10,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:10,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:10,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:10,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:10,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:44:10,638 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:44:10,638 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:10,643 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:44:10,644 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:44:10,645 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:44:10,645 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-28 03:44:10,647 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:44:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:10,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:44:10,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:10,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 03:44:10,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:10,825 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:44:10,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-28 03:44:10,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-28 03:44:11,215 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2019-11-28 03:44:11,216 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:44:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 03:44:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-11-28 03:44:11,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-11-28 03:44:11,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:11,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-11-28 03:44:11,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:11,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-11-28 03:44:11,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:11,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-11-28 03:44:11,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:44:11,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-11-28 03:44:11,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-28 03:44:11,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-28 03:44:11,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-11-28 03:44:11,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:11,238 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-11-28 03:44:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-11-28 03:44:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-28 03:44:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 03:44:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-11-28 03:44:11,259 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-11-28 03:44:11,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:11,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:44:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:44:11,260 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-11-28 03:44:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:11,456 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-11-28 03:44:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:44:11,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-11-28 03:44:11,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:44:11,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-11-28 03:44:11,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-28 03:44:11,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-28 03:44:11,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-11-28 03:44:11,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:11,471 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-11-28 03:44:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-11-28 03:44:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-11-28 03:44:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-28 03:44:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-11-28 03:44:11,489 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-28 03:44:11,489 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-28 03:44:11,489 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:44:11,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-11-28 03:44:11,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:44:11,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:11,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:11,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 03:44:11,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 03:44:11,499 INFO L794 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1188#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1189#fibo1ENTRY ~n := #in~n; 1259#L8 assume !(~n < 1); 1257#L10 assume !(1 == ~n); 1180#L13 call #t~ret0 := fibo2(~n - 1);< 1200#fibo2ENTRY ~n := #in~n; 1218#L18 assume !(~n < 1); 1224#L20 assume !(1 == ~n); 1204#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume !(~n < 1); 1256#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1183#fibo2EXIT >#49#return; 1169#L13-1 call #t~ret1 := fibo2(~n - 2);< 1205#fibo2ENTRY ~n := #in~n; 1226#L18 assume !(~n < 1); 1227#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1253#L8 assume !(~n < 1); 1262#L10 assume 1 == ~n;#res := 1; 1263#fibo1FINAL assume true; 1258#fibo1EXIT >#45#return; 1242#L23-1 call #t~ret3 := fibo1(~n - 2);< 1187#fibo1ENTRY ~n := #in~n; 1252#L8 assume !(~n < 1); 1250#L10 assume !(1 == ~n); 1186#L13 call #t~ret0 := fibo2(~n - 1);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume ~n < 1;#res := 0; 1239#fibo2FINAL assume true; 1244#fibo2EXIT >#49#return; 1185#L13-1 call #t~ret1 := fibo2(~n - 2);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume !(~n < 1); 1233#L20 assume 1 == ~n;#res := 1; 1234#fibo2FINAL assume true; 1219#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-28 03:44:11,500 INFO L796 eck$LassoCheckResult]: Loop: 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-28 03:44:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-11-28 03:44:11,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:11,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118614652] [2019-11-28 03:44:11,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 89 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-28 03:44:11,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118614652] [2019-11-28 03:44:11,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967289260] [2019-11-28 03:44:11,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:11,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:44:11,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-28 03:44:11,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:11,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-28 03:44:11,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17877326] [2019-11-28 03:44:11,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-11-28 03:44:11,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:11,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469443180] [2019-11-28 03:44:11,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 03:44:12,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469443180] [2019-11-28 03:44:12,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007491000] [2019-11-28 03:44:12,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:44:12,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 03:44:12,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:44:12,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-11-28 03:44:12,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077776475] [2019-11-28 03:44:12,260 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:44:12,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:44:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 03:44:12,261 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-11-28 03:44:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:12,342 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-11-28 03:44:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:44:12,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-11-28 03:44:12,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:44:12,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-11-28 03:44:12,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-28 03:44:12,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-28 03:44:12,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-11-28 03:44:12,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:12,352 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-11-28 03:44:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-11-28 03:44:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-28 03:44:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 03:44:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-11-28 03:44:12,368 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-28 03:44:12,368 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-28 03:44:12,368 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:44:12,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-11-28 03:44:12,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:44:12,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:12,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:12,374 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 03:44:12,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 03:44:12,375 INFO L794 eck$LassoCheckResult]: Stem: 2260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 2232#L37 call main_#t~ret4 := fibo1(main_~x~0);< 2233#fibo1ENTRY ~n := #in~n; 2266#L8 assume !(~n < 1); 2231#L10 assume !(1 == ~n); 2217#L13 call #t~ret0 := fibo2(~n - 1);< 2245#fibo2ENTRY ~n := #in~n; 2351#L18 assume !(~n < 1); 2350#L20 assume !(1 == ~n); 2216#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume 1 == ~n;#res := 1; 2221#fibo2FINAL assume true; 2223#fibo2EXIT >#49#return; 2248#L13-1 call #t~ret1 := fibo2(~n - 2);< 2250#fibo2ENTRY ~n := #in~n; 2264#L18 assume !(~n < 1); 2268#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2259#L8 assume !(~n < 1); 2303#L10 assume 1 == ~n;#res := 1; 2301#fibo1FINAL assume true; 2300#fibo1EXIT >#45#return; 2229#L23-1 call #t~ret3 := fibo1(~n - 2);< 2227#fibo1ENTRY ~n := #in~n; 2293#L8 assume !(~n < 1); 2292#L10 assume !(1 == ~n); 2226#L13 call #t~ret0 := fibo2(~n - 1);< 2288#fibo2ENTRY ~n := #in~n; 2281#L18 assume !(~n < 1); 2277#L20 assume 1 == ~n;#res := 1; 2278#fibo2FINAL assume true; 2329#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-28 03:44:12,375 INFO L796 eck$LassoCheckResult]: Loop: 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-28 03:44:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-11-28 03:44:12,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:12,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088189533] [2019-11-28 03:44:12,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-28 03:44:12,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088189533] [2019-11-28 03:44:12,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794404968] [2019-11-28 03:44:12,800 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:12,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:44:12,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:44:12,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:44:12,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 03:44:12,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:12,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-11-28 03:44:12,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477460580] [2019-11-28 03:44:12,994 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-11-28 03:44:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:12,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192134463] [2019-11-28 03:44:12,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-28 03:44:13,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192134463] [2019-11-28 03:44:13,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297122243] [2019-11-28 03:44:13,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:44:13,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 03:44:13,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:13,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-28 03:44:13,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610546230] [2019-11-28 03:44:13,288 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:44:13,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:44:13,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:44:13,288 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-11-28 03:44:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:13,605 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-11-28 03:44:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 03:44:13,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-11-28 03:44:13,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-28 03:44:13,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-11-28 03:44:13,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-28 03:44:13,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-28 03:44:13,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-11-28 03:44:13,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:13,626 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-11-28 03:44:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-11-28 03:44:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-28 03:44:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 03:44:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-11-28 03:44:13,637 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-28 03:44:13,637 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-28 03:44:13,637 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:44:13,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-11-28 03:44:13,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-28 03:44:13,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:13,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:13,642 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:13,642 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:13,642 INFO L794 eck$LassoCheckResult]: Stem: 3324#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 3300#L37 call main_#t~ret4 := fibo1(main_~x~0);< 3301#fibo1ENTRY ~n := #in~n; 3338#L8 assume !(~n < 1); 3356#L10 assume !(1 == ~n); 3298#L13 call #t~ret0 := fibo2(~n - 1);< 3320#fibo2ENTRY ~n := #in~n; 3330#L18 assume !(~n < 1); 3334#L20 assume !(1 == ~n); 3297#L23 call #t~ret2 := fibo1(~n - 1);< 3299#fibo1ENTRY ~n := #in~n; 3327#L8 assume !(~n < 1); 3399#L10 assume !(1 == ~n); 3336#L13 call #t~ret0 := fibo2(~n - 1);< 3349#fibo2ENTRY ~n := #in~n; 3335#L18 assume !(~n < 1); 3337#L20 assume 1 == ~n;#res := 1; 3401#fibo2FINAL assume true; 3341#fibo2EXIT >#49#return; 3309#L13-1 call #t~ret1 := fibo2(~n - 2);< 3328#fibo2ENTRY ~n := #in~n; 3329#L18 assume ~n < 1;#res := 0; 3308#fibo2FINAL assume true; 3310#fibo2EXIT >#51#return; 3322#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3323#fibo1FINAL assume true; 3402#fibo1EXIT >#45#return; 3311#L23-1 call #t~ret3 := fibo1(~n - 2);< 3312#fibo1ENTRY ~n := #in~n; 3397#L8 assume !(~n < 1); 3395#L10 assume !(1 == ~n); 3293#L13 call #t~ret0 := fibo2(~n - 1);< 3381#fibo2ENTRY ~n := #in~n; 3398#L18 assume !(~n < 1); 3396#L20 assume !(1 == ~n); 3292#L23 [2019-11-28 03:44:13,642 INFO L796 eck$LassoCheckResult]: Loop: 3292#L23 call #t~ret2 := fibo1(~n - 1);< 3294#fibo1ENTRY ~n := #in~n; 3325#L8 assume !(~n < 1); 3332#L10 assume !(1 == ~n); 3296#L13 call #t~ret0 := fibo2(~n - 1);< 3319#fibo2ENTRY ~n := #in~n; 3384#L18 assume !(~n < 1); 3383#L20 assume !(1 == ~n); 3292#L23 [2019-11-28 03:44:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-11-28 03:44:13,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:13,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661817019] [2019-11-28 03:44:13,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:44:13,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661817019] [2019-11-28 03:44:13,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512619600] [2019-11-28 03:44:13,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:13,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:44:13,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:44:14,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:14,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-11-28 03:44:14,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66741968] [2019-11-28 03:44:14,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-11-28 03:44:14,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:14,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20188157] [2019-11-28 03:44:14,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:14,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:14,136 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:14,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:14,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:14,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:14,137 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:44:14,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:14,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:14,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration6_Loop [2019-11-28 03:44:14,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:14,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:14,140 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:44:14,143 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:44:14,144 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:44:14,146 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:44:14,148 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:44:14,150 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:44:14,152 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:44:14,161 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:44:14,163 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:44:14,214 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:14,214 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,226 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,230 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:14,230 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,240 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:14,246 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,256 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,260 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:14,260 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,272 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,275 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:14,276 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,282 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,286 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:14,286 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,295 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:14,299 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:14,299 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:14,307 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:14,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:44:14,323 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,312 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:44:15,314 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:15,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:15,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:15,315 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:15,315 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:44:15,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:15,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:15,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration6_Loop [2019-11-28 03:44:15,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:15,315 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:15,316 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:44:15,318 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:44:15,319 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:44:15,320 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:44:15,321 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:44:15,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:44:15,326 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:44:15,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:44:15,337 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:44:15,402 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:15,402 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:15,412 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:44:15,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:15,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,428 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:44:15,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:15,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:15,434 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:15,441 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:44:15,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:15,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,445 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:15,455 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:44:15,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:15,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:15,469 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:44:15,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:15,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,474 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:15,481 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:44:15,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:15,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,485 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) [2019-11-28 03:44:15,494 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:44:15,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:15,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:15,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:15,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:15,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:15,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:15,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:15,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:44:15,501 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:44:15,501 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 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:44:15,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:44:15,510 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:44:15,510 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:44:15,510 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-28 03:44:15,512 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:44:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:15,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:15,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:15,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:15,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:15,686 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:44:15,687 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:44:15,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-28 03:44:15,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 194 states and 238 transitions. Complement of second has 20 states. [2019-11-28 03:44:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:44:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-28 03:44:15,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-28 03:44:15,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:15,847 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:15,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:15,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:15,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:15,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:15,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:15,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:15,999 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:44:15,999 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:44:15,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-28 03:44:16,191 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 251 states and 297 transitions. Complement of second has 33 states. [2019-11-28 03:44:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:44:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-11-28 03:44:16,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-28 03:44:16,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:16,193 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:16,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:16,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:16,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:16,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:16,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:16,374 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:44:16,374 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:44:16,374 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Stream closed [2019-11-28 03:44:16,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 315 states and 394 transitions. Complement of second has 32 states. [2019-11-28 03:44:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:44:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-11-28 03:44:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-28 03:44:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:16,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-28 03:44:16,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:16,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-11-28 03:44:16,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:16,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-11-28 03:44:16,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-11-28 03:44:16,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-11-28 03:44:16,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-28 03:44:16,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-11-28 03:44:16,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-11-28 03:44:16,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:16,605 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-28 03:44:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-11-28 03:44:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-28 03:44:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 03:44:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-11-28 03:44:16,635 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-11-28 03:44:16,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:16,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 03:44:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-28 03:44:16,636 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-11-28 03:44:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:17,226 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-11-28 03:44:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 03:44:17,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-11-28 03:44:17,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 03:44:17,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-11-28 03:44:17,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-28 03:44:17,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-11-28 03:44:17,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-11-28 03:44:17,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:17,236 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-11-28 03:44:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-11-28 03:44:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-28 03:44:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 03:44:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-28 03:44:17,247 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-28 03:44:17,247 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-28 03:44:17,247 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:44:17,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-11-28 03:44:17,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 03:44:17,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:17,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:17,257 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:17,257 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:17,258 INFO L794 eck$LassoCheckResult]: Stem: 5261#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 5240#L37 call main_#t~ret4 := fibo1(main_~x~0);< 5246#fibo1ENTRY ~n := #in~n; 5299#L8 assume !(~n < 1); 5239#L10 assume !(1 == ~n); 5241#L13 call #t~ret0 := fibo2(~n - 1);< 5252#fibo2ENTRY ~n := #in~n; 5265#L18 assume !(~n < 1); 5273#L20 assume !(1 == ~n); 5294#L23 call #t~ret2 := fibo1(~n - 1);< 5296#fibo1ENTRY ~n := #in~n; 5290#L8 assume !(~n < 1); 5295#L10 assume !(1 == ~n); 5231#L13 call #t~ret0 := fibo2(~n - 1);< 5293#fibo2ENTRY ~n := #in~n; 5292#L18 assume !(~n < 1); 5291#L20 assume !(1 == ~n); 5250#L23 call #t~ret2 := fibo1(~n - 1);< 5289#fibo1ENTRY ~n := #in~n; 5284#L8 assume !(~n < 1); 5285#L10 assume !(1 == ~n); 5244#L13 call #t~ret0 := fibo2(~n - 1);< 5251#fibo2ENTRY ~n := #in~n; 5286#L18 assume !(~n < 1); 5267#L20 assume 1 == ~n;#res := 1; 5243#fibo2FINAL assume true; 5245#fibo2EXIT >#49#return; 5254#L13-1 call #t~ret1 := fibo2(~n - 2);< 5255#fibo2ENTRY ~n := #in~n; 5271#L18 assume ~n < 1;#res := 0; 5272#fibo2FINAL assume true; 5342#fibo2EXIT >#51#return; 5256#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5257#fibo1FINAL assume true; 5249#fibo1EXIT >#45#return; 5237#L23-1 call #t~ret3 := fibo1(~n - 2);< 5242#fibo1ENTRY ~n := #in~n; 5258#L8 assume ~n < 1;#res := 0; 5238#fibo1FINAL assume true; 5253#fibo1EXIT >#47#return; 5247#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-28 03:44:17,258 INFO L796 eck$LassoCheckResult]: Loop: 5281#L13-1 call #t~ret1 := fibo2(~n - 2);< 5302#fibo2ENTRY ~n := #in~n; 5279#L18 assume !(~n < 1); 5283#L20 assume !(1 == ~n); 5260#L23 call #t~ret2 := fibo1(~n - 1);< 5235#fibo1ENTRY ~n := #in~n; 5259#L8 assume !(~n < 1); 5266#L10 assume !(1 == ~n); 5234#L13 call #t~ret0 := fibo2(~n - 1);< 5298#fibo2ENTRY ~n := #in~n; 5297#L18 assume !(~n < 1); 5268#L20 assume !(1 == ~n); 5270#L23 call #t~ret2 := fibo1(~n - 1);< 5335#fibo1ENTRY ~n := #in~n; 5339#L8 assume !(~n < 1); 5337#L10 assume 1 == ~n;#res := 1; 5336#fibo1FINAL assume true; 5333#fibo1EXIT >#45#return; 5320#L23-1 call #t~ret3 := fibo1(~n - 2);< 5322#fibo1ENTRY ~n := #in~n; 5326#L8 assume ~n < 1;#res := 0; 5324#fibo1FINAL assume true; 5319#fibo1EXIT >#47#return; 5316#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-28 03:44:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-11-28 03:44:17,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:17,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541477991] [2019-11-28 03:44:17,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 03:44:17,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541477991] [2019-11-28 03:44:17,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062480275] [2019-11-28 03:44:17,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:17,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:44:17,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:44:17,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:17,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-11-28 03:44:17,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224124166] [2019-11-28 03:44:17,536 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-11-28 03:44:17,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:17,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999310572] [2019-11-28 03:44:17,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:17,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:17,803 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:17,803 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:17,803 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:17,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:17,804 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:44:17,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:17,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:17,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:17,804 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration7_Loop [2019-11-28 03:44:17,804 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:17,805 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:17,806 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:44:17,808 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:44:17,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:44:17,815 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:44:17,817 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:44:17,819 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:44:17,821 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:44:17,824 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:44:17,831 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:44:17,886 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:17,886 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:17,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:17,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:17,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:17,897 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:17,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:17,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:17,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:17,906 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:17,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:17,913 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:17,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:44:17,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:18,641 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:44:18,644 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:18,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:18,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:18,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:18,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:44:18,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:18,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:18,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:18,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration7_Loop [2019-11-28 03:44:18,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:18,645 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:18,647 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:44:18,649 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:44:18,650 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:44:18,657 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:44:18,659 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:44:18,661 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:44:18,663 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:44:18,665 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:44:18,668 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:44:18,716 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:18,717 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:18,727 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:44:18,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:18,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:18,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:18,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:18,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:18,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:18,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:18,733 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:18,740 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:44:18,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:18,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:18,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:18,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:18,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:18,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:18,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:18,745 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:18,750 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:44:18,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:18,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:18,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:18,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:18,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:18,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:18,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:18,755 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:44:18,758 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:44:18,758 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 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:44:18,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:44:18,763 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:44:18,763 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:44:18,763 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-28 03:44:18,765 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:44:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:18,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 03:44:18,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:18,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:18,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:18,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:18,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 03:44:18,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:44:19,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-28 03:44:19,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-28 03:44:19,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 364 states and 473 transitions. Complement of second has 40 states. [2019-11-28 03:44:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:44:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-11-28 03:44:19,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-28 03:44:19,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:19,433 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:19,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 03:44:19,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:19,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:19,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:19,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:19,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:19,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 03:44:19,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:44:19,631 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-28 03:44:19,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-28 03:44:19,930 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 242 states and 301 transitions. Complement of second has 26 states. [2019-11-28 03:44:19,930 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:44:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:44:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-11-28 03:44:19,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-28 03:44:19,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:19,931 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:19,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 03:44:19,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:20,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:20,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:20,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:20,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:20,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 03:44:20,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:44:20,125 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 8 loop predicates [2019-11-28 03:44:20,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-28 03:44:20,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 579 states and 748 transitions. Complement of second has 119 states. [2019-11-28 03:44:20,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:44:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-11-28 03:44:20,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-28 03:44:20,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:20,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-11-28 03:44:20,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:20,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-28 03:44:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:20,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-11-28 03:44:20,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-28 03:44:20,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-11-28 03:44:20,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-28 03:44:20,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-28 03:44:20,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-11-28 03:44:20,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:20,620 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-11-28 03:44:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-11-28 03:44:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-11-28 03:44:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-28 03:44:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-11-28 03:44:20,644 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-11-28 03:44:20,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 03:44:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-28 03:44:20,647 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-11-28 03:44:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:21,071 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-11-28 03:44:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 03:44:21,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-11-28 03:44:21,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:21,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-11-28 03:44:21,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-11-28 03:44:21,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-11-28 03:44:21,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-11-28 03:44:21,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:21,088 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-11-28 03:44:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-11-28 03:44:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-11-28 03:44:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-28 03:44:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-11-28 03:44:21,116 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-28 03:44:21,116 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-28 03:44:21,117 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:44:21,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-11-28 03:44:21,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:21,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:21,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:21,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:21,135 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 03:44:21,136 INFO L794 eck$LassoCheckResult]: Stem: 8604#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8567#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8568#fibo1ENTRY ~n := #in~n; 8646#L8 assume !(~n < 1); 8645#L10 assume !(1 == ~n); 8637#L13 call #t~ret0 := fibo2(~n - 1);< 8644#fibo2ENTRY ~n := #in~n; 8643#L18 assume !(~n < 1); 8642#L20 assume !(1 == ~n); 8639#L23 call #t~ret2 := fibo1(~n - 1);< 8641#fibo1ENTRY ~n := #in~n; 8640#L8 assume !(~n < 1); 8638#L10 assume !(1 == ~n); 8631#L13 call #t~ret0 := fibo2(~n - 1);< 8636#fibo2ENTRY ~n := #in~n; 8635#L18 assume !(~n < 1); 8633#L20 assume !(1 == ~n); 8577#L23 call #t~ret2 := fibo1(~n - 1);< 8627#fibo1ENTRY ~n := #in~n; 8628#L8 assume !(~n < 1); 8722#L10 assume !(1 == ~n); 8632#L13 call #t~ret0 := fibo2(~n - 1);< 8636#fibo2ENTRY ~n := #in~n; 8635#L18 assume !(~n < 1); 8633#L20 assume !(1 == ~n); 8577#L23 call #t~ret2 := fibo1(~n - 1);< 8627#fibo1ENTRY ~n := #in~n; 8625#L8 assume !(~n < 1); 8626#L10 assume !(1 == ~n); 8576#L13 call #t~ret0 := fibo2(~n - 1);< 8578#fibo2ENTRY ~n := #in~n; 8824#L18 assume !(~n < 1); 8823#L20 assume 1 == ~n;#res := 1; 8822#fibo2FINAL assume true; 8819#fibo2EXIT >#49#return; 8815#L13-1 call #t~ret1 := fibo2(~n - 2);< 8816#fibo2ENTRY ~n := #in~n; 8821#L18 assume ~n < 1;#res := 0; 8818#fibo2FINAL assume true; 8814#fibo2EXIT >#51#return; 8813#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8812#fibo1FINAL assume true; 8809#fibo1EXIT >#45#return; 8806#L23-1 call #t~ret3 := fibo1(~n - 2);< 8807#fibo1ENTRY ~n := #in~n; 8845#L8 assume ~n < 1;#res := 0; 8844#fibo1FINAL assume true; 8805#fibo1EXIT >#47#return; 8802#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8800#fibo2FINAL assume true; 8719#fibo2EXIT >#49#return; 8669#L13-1 [2019-11-28 03:44:21,137 INFO L796 eck$LassoCheckResult]: Loop: 8669#L13-1 call #t~ret1 := fibo2(~n - 2);< 8595#fibo2ENTRY ~n := #in~n; 8693#L18 assume !(~n < 1); 8689#L20 assume !(1 == ~n); 8594#L23 call #t~ret2 := fibo1(~n - 1);< 8671#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8749#fibo2ENTRY ~n := #in~n; 8792#L18 assume !(~n < 1); 8787#L20 assume !(1 == ~n); 8788#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8855#L8 assume !(~n < 1); 8854#L10 assume 1 == ~n;#res := 1; 8853#fibo1FINAL assume true; 8852#fibo1EXIT >#45#return; 8560#L23-1 call #t~ret3 := fibo1(~n - 2);< 8556#fibo1ENTRY ~n := #in~n; 8613#L8 assume ~n < 1;#res := 0; 8562#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8653#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8847#fibo2FINAL assume true; 8748#fibo2EXIT >#49#return; 8741#L13-1 call #t~ret1 := fibo2(~n - 2);< 8742#fibo2ENTRY ~n := #in~n; 8782#L18 assume ~n < 1;#res := 0; 8772#fibo2FINAL assume true; 8766#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8708#fibo1FINAL assume true; 8709#fibo1EXIT >#45#return; 8622#L23-1 call #t~ret3 := fibo1(~n - 2);< 8629#fibo1ENTRY ~n := #in~n; 8630#L8 assume !(~n < 1); 8620#L10 assume !(1 == ~n); 8624#L13 call #t~ret0 := fibo2(~n - 1);< 8698#fibo2ENTRY ~n := #in~n; 8692#L18 assume !(~n < 1); 8687#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8667#fibo1ENTRY ~n := #in~n; 8780#L8 assume !(~n < 1); 8777#L10 assume 1 == ~n;#res := 1; 8774#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8744#L23-1 call #t~ret3 := fibo1(~n - 2);< 8747#fibo1ENTRY ~n := #in~n; 8803#L8 assume ~n < 1;#res := 0; 8801#fibo1FINAL assume true; 8743#fibo1EXIT >#47#return; 8738#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8726#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8669#L13-1 [2019-11-28 03:44:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-11-28 03:44:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:21,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685704802] [2019-11-28 03:44:21,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 03:44:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685704802] [2019-11-28 03:44:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919089814] [2019-11-28 03:44:21,354 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:21,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:44:21,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:44:21,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:21,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 03:44:21,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:21,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-11-28 03:44:21,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990039666] [2019-11-28 03:44:21,445 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash -564433099, now seen corresponding path program 1 times [2019-11-28 03:44:21,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:21,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655483949] [2019-11-28 03:44:21,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 03:44:21,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655483949] [2019-11-28 03:44:21,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820451069] [2019-11-28 03:44:21,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:21,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:44:21,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 03:44:21,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:21,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-11-28 03:44:21,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87974357] [2019-11-28 03:44:21,701 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:44:21,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 03:44:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-28 03:44:21,702 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-11-28 03:44:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:22,309 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-11-28 03:44:22,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 03:44:22,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-11-28 03:44:22,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:22,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-11-28 03:44:22,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-11-28 03:44:22,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-11-28 03:44:22,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-11-28 03:44:22,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:22,325 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-11-28 03:44:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-11-28 03:44:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-11-28 03:44:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-28 03:44:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-11-28 03:44:22,343 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-28 03:44:22,343 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-28 03:44:22,344 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:44:22,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-11-28 03:44:22,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:22,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:22,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:22,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:22,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:22,352 INFO L794 eck$LassoCheckResult]: Stem: 10062#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10007#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10008#fibo1ENTRY ~n := #in~n; 10245#L8 assume !(~n < 1); 10233#L10 assume !(1 == ~n); 10234#L13 call #t~ret0 := fibo2(~n - 1);< 10248#fibo2ENTRY ~n := #in~n; 10247#L18 assume !(~n < 1); 10246#L20 assume !(1 == ~n); 10225#L23 call #t~ret2 := fibo1(~n - 1);< 10244#fibo1ENTRY ~n := #in~n; 10237#L8 assume !(~n < 1); 10238#L10 assume !(1 == ~n); 10005#L13 call #t~ret0 := fibo2(~n - 1);< 10226#fibo2ENTRY ~n := #in~n; 10364#L18 assume !(~n < 1); 10074#L20 assume !(1 == ~n); 10004#L23 call #t~ret2 := fibo1(~n - 1);< 10006#fibo1ENTRY ~n := #in~n; 10065#L8 assume !(~n < 1); 10012#L10 assume !(1 == ~n); 10001#L13 call #t~ret0 := fibo2(~n - 1);< 10224#fibo2ENTRY ~n := #in~n; 10243#L18 assume !(~n < 1); 10242#L20 assume !(1 == ~n); 10000#L23 call #t~ret2 := fibo1(~n - 1);< 10003#fibo1ENTRY ~n := #in~n; 10472#L8 assume !(~n < 1); 10468#L10 assume 1 == ~n;#res := 1; 10467#fibo1FINAL assume true; 10466#fibo1EXIT >#45#return; 10438#L23-1 call #t~ret3 := fibo1(~n - 2);< 10022#fibo1ENTRY ~n := #in~n; 10445#L8 assume !(~n < 1); 10441#L10 assume 1 == ~n;#res := 1; 10440#fibo1FINAL assume true; 10437#fibo1EXIT >#47#return; 10436#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10434#fibo2FINAL assume true; 10403#fibo2EXIT >#49#return; 10015#L13-1 call #t~ret1 := fibo2(~n - 2);< 10051#fibo2ENTRY ~n := #in~n; 10147#L18 assume !(~n < 1); 10150#L20 assume !(1 == ~n); 10040#L23 [2019-11-28 03:44:22,353 INFO L796 eck$LassoCheckResult]: Loop: 10040#L23 call #t~ret2 := fibo1(~n - 1);< 10114#fibo1ENTRY ~n := #in~n; 10110#L8 assume !(~n < 1); 10108#L10 assume !(1 == ~n); 10018#L13 call #t~ret0 := fibo2(~n - 1);< 10104#fibo2ENTRY ~n := #in~n; 10208#L18 assume !(~n < 1); 10207#L20 assume !(1 == ~n); 10163#L23 call #t~ret2 := fibo1(~n - 1);< 10167#fibo1ENTRY ~n := #in~n; 10179#L8 assume !(~n < 1); 10178#L10 assume 1 == ~n;#res := 1; 10171#fibo1FINAL assume true; 10161#fibo1EXIT >#45#return; 10045#L23-1 call #t~ret3 := fibo1(~n - 2);< 10026#fibo1ENTRY ~n := #in~n; 10210#L8 assume ~n < 1;#res := 0; 10044#fibo1FINAL assume true; 10047#fibo1EXIT >#47#return; 10029#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10017#fibo2FINAL assume true; 10020#fibo2EXIT >#49#return; 10050#L13-1 call #t~ret1 := fibo2(~n - 2);< 10051#fibo2ENTRY ~n := #in~n; 10147#L18 assume !(~n < 1); 10150#L20 assume !(1 == ~n); 10040#L23 [2019-11-28 03:44:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-11-28 03:44:22,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:22,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222279499] [2019-11-28 03:44:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:44:22,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222279499] [2019-11-28 03:44:22,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93313544] [2019-11-28 03:44:22,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:22,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:44:22,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:22,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-11-28 03:44:22,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268285485] [2019-11-28 03:44:22,760 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-11-28 03:44:22,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:22,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741556191] [2019-11-28 03:44:22,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:44:22,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741556191] [2019-11-28 03:44:22,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873745794] [2019-11-28 03:44:22,852 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 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:44:22,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:44:22,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:44:22,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:44:22,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:44:22,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:22,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-28 03:44:22,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141143852] [2019-11-28 03:44:22,913 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:44:22,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 03:44:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 03:44:22,914 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-11-28 03:44:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:23,172 INFO L93 Difference]: Finished difference Result 549 states and 744 transitions. [2019-11-28 03:44:23,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:44:23,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 744 transitions. [2019-11-28 03:44:23,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:23,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 524 states and 708 transitions. [2019-11-28 03:44:23,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2019-11-28 03:44:23,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-28 03:44:23,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 708 transitions. [2019-11-28 03:44:23,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:23,189 INFO L688 BuchiCegarLoop]: Abstraction has 524 states and 708 transitions. [2019-11-28 03:44:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 708 transitions. [2019-11-28 03:44:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2019-11-28 03:44:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-28 03:44:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2019-11-28 03:44:23,209 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-28 03:44:23,209 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-28 03:44:23,209 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:44:23,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 661 transitions. [2019-11-28 03:44:23,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:23,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:23,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:23,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:23,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:23,215 INFO L794 eck$LassoCheckResult]: Stem: 11414#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 11366#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11367#fibo1ENTRY ~n := #in~n; 11606#L8 assume !(~n < 1); 11602#L10 assume !(1 == ~n); 11595#L13 call #t~ret0 := fibo2(~n - 1);< 11596#fibo2ENTRY ~n := #in~n; 11626#L18 assume !(~n < 1); 11624#L20 assume !(1 == ~n); 11589#L23 call #t~ret2 := fibo1(~n - 1);< 11611#fibo1ENTRY ~n := #in~n; 11605#L8 assume !(~n < 1); 11601#L10 assume !(1 == ~n); 11588#L13 call #t~ret0 := fibo2(~n - 1);< 11590#fibo2ENTRY ~n := #in~n; 11771#L18 assume !(~n < 1); 11770#L20 assume !(1 == ~n); 11586#L23 call #t~ret2 := fibo1(~n - 1);< 11664#fibo1ENTRY ~n := #in~n; 11754#L8 assume !(~n < 1); 11751#L10 assume !(1 == ~n); 11580#L13 call #t~ret0 := fibo2(~n - 1);< 11587#fibo2ENTRY ~n := #in~n; 11677#L18 assume !(~n < 1); 11674#L20 assume !(1 == ~n); 11675#L23 call #t~ret2 := fibo1(~n - 1);< 11700#fibo1ENTRY ~n := #in~n; 11705#L8 assume !(~n < 1); 11703#L10 assume 1 == ~n;#res := 1; 11701#fibo1FINAL assume true; 11699#fibo1EXIT >#45#return; 11411#L23-1 call #t~ret3 := fibo1(~n - 2);< 11408#fibo1ENTRY ~n := #in~n; 11410#L8 assume !(~n < 1); 11708#L10 assume 1 == ~n;#res := 1; 11706#fibo1FINAL assume true; 11697#fibo1EXIT >#47#return; 11696#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11695#fibo2FINAL assume true; 11694#fibo2EXIT >#49#return; 11667#L13-1 call #t~ret1 := fibo2(~n - 2);< 11593#fibo2ENTRY ~n := #in~n; 11830#L18 assume ~n < 1;#res := 0; 11691#fibo2FINAL assume true; 11686#fibo2EXIT >#51#return; 11669#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11750#fibo1FINAL assume true; 11608#fibo1EXIT >#45#return; 11609#L23-1 call #t~ret3 := fibo1(~n - 2);< 11661#fibo1ENTRY ~n := #in~n; 11680#L8 assume !(~n < 1); 11679#L10 assume !(1 == ~n); 11575#L13 [2019-11-28 03:44:23,215 INFO L796 eck$LassoCheckResult]: Loop: 11575#L13 call #t~ret0 := fibo2(~n - 1);< 11582#fibo2ENTRY ~n := #in~n; 11620#L18 assume !(~n < 1); 11614#L20 assume !(1 == ~n); 11584#L23 call #t~ret2 := fibo1(~n - 1);< 11607#fibo1ENTRY ~n := #in~n; 11603#L8 assume !(~n < 1); 11599#L10 assume !(1 == ~n); 11576#L13 call #t~ret0 := fibo2(~n - 1);< 11585#fibo2ENTRY ~n := #in~n; 11622#L18 assume !(~n < 1); 11617#L20 assume !(1 == ~n); 11619#L23 call #t~ret2 := fibo1(~n - 1);< 11736#fibo1ENTRY ~n := #in~n; 11746#L8 assume !(~n < 1); 11744#L10 assume 1 == ~n;#res := 1; 11743#fibo1FINAL assume true; 11733#fibo1EXIT >#45#return; 11730#L23-1 call #t~ret3 := fibo1(~n - 2);< 11731#fibo1ENTRY ~n := #in~n; 11748#L8 assume ~n < 1;#res := 0; 11749#fibo1FINAL assume true; 11757#fibo1EXIT >#47#return; 11755#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11752#fibo2FINAL assume true; 11671#fibo2EXIT >#49#return; 11668#L13-1 call #t~ret1 := fibo2(~n - 2);< 11593#fibo2ENTRY ~n := #in~n; 11830#L18 assume ~n < 1;#res := 0; 11691#fibo2FINAL assume true; 11686#fibo2EXIT >#51#return; 11665#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11660#fibo1FINAL assume true; 11635#fibo1EXIT >#45#return; 11629#L23-1 call #t~ret3 := fibo1(~n - 2);< 11634#fibo1ENTRY ~n := #in~n; 11650#L8 assume !(~n < 1); 11648#L10 assume !(1 == ~n); 11575#L13 [2019-11-28 03:44:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:23,216 INFO L82 PathProgramCache]: Analyzing trace with hash 783666534, now seen corresponding path program 1 times [2019-11-28 03:44:23,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:23,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058274898] [2019-11-28 03:44:23,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 03:44:23,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058274898] [2019-11-28 03:44:23,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167161079] [2019-11-28 03:44:23,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:23,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:44:23,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:23,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-11-28 03:44:23,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629171011] [2019-11-28 03:44:23,526 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1056491202, now seen corresponding path program 2 times [2019-11-28 03:44:23,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:23,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840076795] [2019-11-28 03:44:23,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 03:44:23,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840076795] [2019-11-28 03:44:23,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355551904] [2019-11-28 03:44:23,608 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:23,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:44:23,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:44:23,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:44:23,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 03:44:23,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:23,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-28 03:44:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456230472] [2019-11-28 03:44:23,710 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:44:23,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:44:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:44:23,710 INFO L87 Difference]: Start difference. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 15 states. [2019-11-28 03:44:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:24,003 INFO L93 Difference]: Finished difference Result 518 states and 690 transitions. [2019-11-28 03:44:24,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 03:44:24,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 690 transitions. [2019-11-28 03:44:24,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:24,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 518 states and 690 transitions. [2019-11-28 03:44:24,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-11-28 03:44:24,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-11-28 03:44:24,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 690 transitions. [2019-11-28 03:44:24,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:24,032 INFO L688 BuchiCegarLoop]: Abstraction has 518 states and 690 transitions. [2019-11-28 03:44:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 690 transitions. [2019-11-28 03:44:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2019-11-28 03:44:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-28 03:44:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 650 transitions. [2019-11-28 03:44:24,049 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-28 03:44:24,049 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-28 03:44:24,049 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:44:24,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 650 transitions. [2019-11-28 03:44:24,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 03:44:24,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:24,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:24,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:24,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 03:44:24,055 INFO L794 eck$LassoCheckResult]: Stem: 12856#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 12827#L37 call main_#t~ret4 := fibo1(main_~x~0);< 12828#fibo1ENTRY ~n := #in~n; 12953#L8 assume !(~n < 1); 12952#L10 assume !(1 == ~n); 12948#L13 call #t~ret0 := fibo2(~n - 1);< 12951#fibo2ENTRY ~n := #in~n; 12950#L18 assume !(~n < 1); 12949#L20 assume !(1 == ~n); 12944#L23 call #t~ret2 := fibo1(~n - 1);< 12947#fibo1ENTRY ~n := #in~n; 12946#L8 assume !(~n < 1); 12945#L10 assume !(1 == ~n); 12940#L13 call #t~ret0 := fibo2(~n - 1);< 12943#fibo2ENTRY ~n := #in~n; 12942#L18 assume !(~n < 1); 12941#L20 assume !(1 == ~n); 12935#L23 call #t~ret2 := fibo1(~n - 1);< 12939#fibo1ENTRY ~n := #in~n; 12934#L8 assume !(~n < 1); 12936#L10 assume !(1 == ~n); 12923#L13 call #t~ret0 := fibo2(~n - 1);< 12928#fibo2ENTRY ~n := #in~n; 12927#L18 assume !(~n < 1); 12925#L20 assume !(1 == ~n); 12926#L23 call #t~ret2 := fibo1(~n - 1);< 13249#fibo1ENTRY ~n := #in~n; 13254#L8 assume !(~n < 1); 13252#L10 assume 1 == ~n;#res := 1; 13250#fibo1FINAL assume true; 13248#fibo1EXIT >#45#return; 12801#L23-1 call #t~ret3 := fibo1(~n - 2);< 13186#fibo1ENTRY ~n := #in~n; 13238#L8 assume !(~n < 1); 12800#L10 assume 1 == ~n;#res := 1; 12803#fibo1FINAL assume true; 12842#fibo1EXIT >#47#return; 13185#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13209#fibo2FINAL assume true; 13208#fibo2EXIT >#49#return; 13203#L13-1 call #t~ret1 := fibo2(~n - 2);< 13206#fibo2ENTRY ~n := #in~n; 13232#L18 assume !(~n < 1); 13230#L20 assume 1 == ~n;#res := 1; 13227#fibo2FINAL assume true; 13202#fibo2EXIT >#51#return; 13200#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13198#fibo1FINAL assume true; 13179#fibo1EXIT >#45#return; 12873#L23-1 call #t~ret3 := fibo1(~n - 2);< 13184#fibo1ENTRY ~n := #in~n; 12879#L8 assume !(~n < 1); 12872#L10 assume !(1 == ~n); 12811#L13 [2019-11-28 03:44:24,055 INFO L796 eck$LassoCheckResult]: Loop: 12811#L13 call #t~ret0 := fibo2(~n - 1);< 12914#fibo2ENTRY ~n := #in~n; 12915#L18 assume !(~n < 1); 12901#L20 assume !(1 == ~n); 12805#L23 call #t~ret2 := fibo1(~n - 1);< 12799#fibo1ENTRY ~n := #in~n; 13125#L8 assume !(~n < 1); 12804#L10 assume !(1 == ~n); 12796#L13 call #t~ret0 := fibo2(~n - 1);< 13145#fibo2ENTRY ~n := #in~n; 13138#L18 assume !(~n < 1); 13136#L20 assume !(1 == ~n); 12798#L23 call #t~ret2 := fibo1(~n - 1);< 12799#fibo1ENTRY ~n := #in~n; 13125#L8 assume !(~n < 1); 12804#L10 assume !(1 == ~n); 12796#L13 call #t~ret0 := fibo2(~n - 1);< 13145#fibo2ENTRY ~n := #in~n; 13138#L18 assume !(~n < 1); 13136#L20 assume 1 == ~n;#res := 1; 13137#fibo2FINAL assume true; 13225#fibo2EXIT >#49#return; 13223#L13-1 call #t~ret1 := fibo2(~n - 2);< 13224#fibo2ENTRY ~n := #in~n; 13246#L18 assume ~n < 1;#res := 0; 13233#fibo2FINAL assume true; 13222#fibo2EXIT >#51#return; 13219#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13217#fibo1FINAL assume true; 13215#fibo1EXIT >#45#return; 13213#L23-1 call #t~ret3 := fibo1(~n - 2);< 13214#fibo1ENTRY ~n := #in~n; 13247#L8 assume !(~n < 1); 13220#L10 assume 1 == ~n;#res := 1; 13218#fibo1FINAL assume true; 13212#fibo1EXIT >#47#return; 13211#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13210#fibo2FINAL assume true; 13165#fibo2EXIT >#49#return; 12812#L13-1 call #t~ret1 := fibo2(~n - 2);< 12848#fibo2ENTRY ~n := #in~n; 13201#L18 assume !(~n < 1); 13199#L20 assume !(1 == ~n); 12832#L23 call #t~ret2 := fibo1(~n - 1);< 12933#fibo1ENTRY ~n := #in~n; 13265#L8 assume !(~n < 1); 13264#L10 assume 1 == ~n;#res := 1; 13263#fibo1FINAL assume true; 13258#fibo1EXIT >#45#return; 12806#L23-1 call #t~ret3 := fibo1(~n - 2);< 12814#fibo1ENTRY ~n := #in~n; 13244#L8 assume ~n < 1;#res := 0; 13243#fibo1FINAL assume true; 13242#fibo1EXIT >#47#return; 13241#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 13240#fibo2FINAL assume true; 13228#fibo2EXIT >#51#return; 13167#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13279#fibo1FINAL assume true; 13276#fibo1EXIT >#45#return; 12833#L23-1 call #t~ret3 := fibo1(~n - 2);< 13163#fibo1ENTRY ~n := #in~n; 13164#L8 assume !(~n < 1); 13221#L10 assume !(1 == ~n); 12811#L13 [2019-11-28 03:44:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1614825140, now seen corresponding path program 1 times [2019-11-28 03:44:24,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:24,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413505322] [2019-11-28 03:44:24,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 03:44:24,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413505322] [2019-11-28 03:44:24,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853559322] [2019-11-28 03:44:24,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:24,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:44:24,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:44:24,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:24,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2019-11-28 03:44:24,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98502792] [2019-11-28 03:44:24,358 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:24,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:24,358 INFO L82 PathProgramCache]: Analyzing trace with hash 41147773, now seen corresponding path program 1 times [2019-11-28 03:44:24,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:24,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010515780] [2019-11-28 03:44:24,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:24,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:25,086 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:25,086 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:25,086 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:25,086 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:25,086 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:44:25,086 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:25,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:25,087 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:25,087 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration11_Loop [2019-11-28 03:44:25,087 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:25,087 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:25,088 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:44:25,090 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:44:25,091 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:44:25,092 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:44:25,093 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:44:25,103 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:44:25,105 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:44:25,106 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:44:25,108 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:44:25,182 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:25,182 INFO L404 LassoAnalysis]: Checking for nontermination... 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:44:25,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:25,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:25,190 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:25,190 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:25,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:25,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:25,202 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:25,202 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:25,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:25,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:25,209 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:25,210 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:25,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:25,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:44:25,218 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:25,218 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:25,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:25,229 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:25,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:44:25,237 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,779 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:44:26,781 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:26,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:26,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:26,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:26,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:44:26,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,782 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:26,782 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:26,782 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration11_Loop [2019-11-28 03:44:26,782 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:26,782 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:26,783 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:44:26,784 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:44:26,785 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:44:26,789 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:44:26,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:44:26,803 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:44:26,805 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:44:26,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:44:26,810 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:44:26,880 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:26,881 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,885 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:44:26,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:26,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:26,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:26,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:26,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:26,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:26,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:26,889 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,899 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:44:26,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:26,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:26,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:26,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:26,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:26,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:26,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:26,903 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,909 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:44:26,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:26,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:26,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:26,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:26,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:26,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:26,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:26,913 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,919 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:44:26,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:26,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:26,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:26,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:26,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:26,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:26,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:26,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:44:26,926 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:44:26,926 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:26,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:44:26,932 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:44:26,933 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:44:26,933 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-28 03:44:26,934 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:44:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:27,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:44:27,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:27,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:27,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 03:44:27,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 03:44:27,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2019-11-28 03:44:27,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 14 states. [2019-11-28 03:44:27,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 14 states. Result 1735 states and 2279 transitions. Complement of second has 65 states. [2019-11-28 03:44:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 03:44:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2019-11-28 03:44:27,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 53 letters. Loop has 64 letters. [2019-11-28 03:44:27,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:27,962 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:28,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:44:28,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:28,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:28,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:28,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:28,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:28,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 03:44:28,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 03:44:28,276 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2019-11-28 03:44:28,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 14 states. [2019-11-28 03:44:29,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 14 states. Result 1771 states and 2327 transitions. Complement of second has 69 states. [2019-11-28 03:44:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 03:44:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-28 03:44:29,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 53 letters. Loop has 64 letters. [2019-11-28 03:44:29,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:29,049 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:29,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:44:29,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:29,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:29,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:29,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:29,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:29,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 03:44:29,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 03:44:29,373 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 12 loop predicates [2019-11-28 03:44:29,374 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 14 states. [2019-11-28 03:44:30,104 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 14 states. Result 3836 states and 4969 transitions. Complement of second has 185 states. [2019-11-28 03:44:30,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 03:44:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2019-11-28 03:44:30,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 53 letters. Loop has 64 letters. [2019-11-28 03:44:30,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:30,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 117 letters. Loop has 64 letters. [2019-11-28 03:44:30,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:30,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 53 letters. Loop has 128 letters. [2019-11-28 03:44:30,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:30,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3836 states and 4969 transitions. [2019-11-28 03:44:30,169 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2019-11-28 03:44:30,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3836 states to 2394 states and 3166 transitions. [2019-11-28 03:44:30,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 496 [2019-11-28 03:44:30,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 504 [2019-11-28 03:44:30,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2394 states and 3166 transitions. [2019-11-28 03:44:30,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:30,211 INFO L688 BuchiCegarLoop]: Abstraction has 2394 states and 3166 transitions. [2019-11-28 03:44:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states and 3166 transitions. [2019-11-28 03:44:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2096. [2019-11-28 03:44:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-11-28 03:44:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2660 transitions. [2019-11-28 03:44:30,288 INFO L711 BuchiCegarLoop]: Abstraction has 2096 states and 2660 transitions. [2019-11-28 03:44:30,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 03:44:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-28 03:44:30,289 INFO L87 Difference]: Start difference. First operand 2096 states and 2660 transitions. Second operand 22 states. [2019-11-28 03:44:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:30,879 INFO L93 Difference]: Finished difference Result 2246 states and 2863 transitions. [2019-11-28 03:44:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 03:44:30,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2246 states and 2863 transitions. [2019-11-28 03:44:30,904 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-28 03:44:30,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2246 states to 2189 states and 2806 transitions. [2019-11-28 03:44:30,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2019-11-28 03:44:30,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2019-11-28 03:44:30,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2189 states and 2806 transitions. [2019-11-28 03:44:30,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:30,933 INFO L688 BuchiCegarLoop]: Abstraction has 2189 states and 2806 transitions. [2019-11-28 03:44:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states and 2806 transitions. [2019-11-28 03:44:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2063. [2019-11-28 03:44:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-28 03:44:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2598 transitions. [2019-11-28 03:44:31,043 INFO L711 BuchiCegarLoop]: Abstraction has 2063 states and 2598 transitions. [2019-11-28 03:44:31,043 INFO L591 BuchiCegarLoop]: Abstraction has 2063 states and 2598 transitions. [2019-11-28 03:44:31,044 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:44:31,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2063 states and 2598 transitions. [2019-11-28 03:44:31,055 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-28 03:44:31,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:44:31,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:44:31,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:31,059 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:44:31,060 INFO L794 eck$LassoCheckResult]: Stem: 26785#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 26750#L37 call main_#t~ret4 := fibo1(main_~x~0);< 26751#fibo1ENTRY ~n := #in~n; 26851#L8 assume !(~n < 1); 26850#L10 assume !(1 == ~n); 26845#L13 call #t~ret0 := fibo2(~n - 1);< 26848#fibo2ENTRY ~n := #in~n; 26847#L18 assume !(~n < 1); 26846#L20 assume !(1 == ~n); 26841#L23 call #t~ret2 := fibo1(~n - 1);< 26844#fibo1ENTRY ~n := #in~n; 26843#L8 assume !(~n < 1); 26842#L10 assume !(1 == ~n); 26837#L13 call #t~ret0 := fibo2(~n - 1);< 26840#fibo2ENTRY ~n := #in~n; 26839#L18 assume !(~n < 1); 26838#L20 assume !(1 == ~n); 26834#L23 call #t~ret2 := fibo1(~n - 1);< 26836#fibo1ENTRY ~n := #in~n; 26829#L8 assume !(~n < 1); 26835#L10 assume !(1 == ~n); 26830#L13 call #t~ret0 := fibo2(~n - 1);< 26833#fibo2ENTRY ~n := #in~n; 26832#L18 assume !(~n < 1); 26831#L20 assume !(1 == ~n); 26810#L23 call #t~ret2 := fibo1(~n - 1);< 26828#fibo1ENTRY ~n := #in~n; 26809#L8 assume !(~n < 1); 26811#L10 assume !(1 == ~n); 27617#L13 call #t~ret0 := fibo2(~n - 1);< 27618#fibo2ENTRY ~n := #in~n; 27626#L18 assume !(~n < 1); 27625#L20 assume 1 == ~n;#res := 1; 27624#fibo2FINAL assume true; 27616#fibo2EXIT >#49#return; 27613#L13-1 call #t~ret1 := fibo2(~n - 2);< 27614#fibo2ENTRY ~n := #in~n; 27619#L18 assume ~n < 1;#res := 0; 27615#fibo2FINAL assume true; 27612#fibo2EXIT >#51#return; 27611#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 27609#fibo1FINAL assume true; 27606#fibo1EXIT >#45#return; 27598#L23-1 call #t~ret3 := fibo1(~n - 2);< 27599#fibo1ENTRY ~n := #in~n; 27610#L8 assume !(~n < 1); 27608#L10 assume 1 == ~n;#res := 1; 27605#fibo1FINAL assume true; 27597#fibo1EXIT >#47#return; 27592#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 27589#fibo2FINAL assume true; 27576#fibo2EXIT >#49#return; 27544#L13-1 call #t~ret1 := fibo2(~n - 2);< 27562#fibo2ENTRY ~n := #in~n; 27555#L18 assume !(~n < 1); 27547#L20 assume !(1 == ~n); 27521#L23 call #t~ret2 := fibo1(~n - 1);< 27539#fibo1ENTRY ~n := #in~n; 27535#L8 assume !(~n < 1); 27524#L10 assume !(1 == ~n); 27506#L13 call #t~ret0 := fibo2(~n - 1);< 27507#fibo2ENTRY ~n := #in~n; 27518#L18 assume !(~n < 1); 27515#L20 assume !(1 == ~n); 27516#L23 call #t~ret2 := fibo1(~n - 1);< 27719#fibo1ENTRY ~n := #in~n; 27717#L8 assume !(~n < 1); 27714#L10 assume !(1 == ~n); 26734#L13 [2019-11-28 03:44:31,060 INFO L796 eck$LassoCheckResult]: Loop: 26734#L13 call #t~ret0 := fibo2(~n - 1);< 27710#fibo2ENTRY ~n := #in~n; 27718#L18 assume !(~n < 1); 27715#L20 assume !(1 == ~n); 27708#L23 call #t~ret2 := fibo1(~n - 1);< 27719#fibo1ENTRY ~n := #in~n; 27717#L8 assume !(~n < 1); 27714#L10 assume !(1 == ~n); 26734#L13 [2019-11-28 03:44:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash 902409038, now seen corresponding path program 3 times [2019-11-28 03:44:31,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:31,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205707929] [2019-11-28 03:44:31,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 91 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 03:44:31,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205707929] [2019-11-28 03:44:31,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069641899] [2019-11-28 03:44:31,308 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:44:31,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 03:44:31,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:44:31,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:44:31,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 87 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-28 03:44:31,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:44:31,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2019-11-28 03:44:31,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015524357] [2019-11-28 03:44:31,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:44:31,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:31,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 3 times [2019-11-28 03:44:31,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:44:31,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179830778] [2019-11-28 03:44:31,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:44:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:44:31,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:44:31,631 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:31,631 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:31,631 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:31,631 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:31,632 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:44:31,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:31,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:31,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:31,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration12_Loop [2019-11-28 03:44:31,632 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:31,632 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44: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:44: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:44:31,640 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:44:31,643 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:44:31,645 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:44:31,658 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:44:31,661 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:44:31,663 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:44:31,666 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:44:31,743 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:31,743 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:31,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:31,757 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:31,760 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:31,761 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:31,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:31,769 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:31,773 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:31,774 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:31,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:31,781 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:31,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:31,785 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:31,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:31,796 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:31,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:44:31,800 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:31,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:44:31,810 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 86 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:31,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:44:31,826 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,653 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:44:34,655 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:44:34,655 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:44:34,655 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:44:34,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:44:34,656 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:44:34,656 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,656 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:44:34,656 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:44:34,656 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration12_Loop [2019-11-28 03:44:34,656 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:44:34,656 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:44:34,657 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:44:34,662 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:44:34,663 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:44:34,664 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:44:34,666 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:44:34,679 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:44:34,681 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:44:34,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:44:34,690 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:44:34,752 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:44:34,753 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,758 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:44:34,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:34,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:34,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:34,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:34,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:34,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:34,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:34,766 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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,771 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:44:34,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:34,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:34,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:34,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:34,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:34,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:34,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:34,775 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 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,781 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:44:34,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:34,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:34,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:34,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:34,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:34,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:34,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:34,784 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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,791 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:44:34,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:34,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:34,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:34,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:34,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:34,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:34,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:34,795 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,800 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:44:34,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:44:34,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:44:34,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:44:34,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:44:34,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:44:34,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:44:34,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:44:34,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:44:34,813 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:44:34,813 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:44:34,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:44:34,822 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:44:34,822 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:44:34,822 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:44:34,824 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:44:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:34,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 03:44:34,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:34,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:34,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:34,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:34,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:34,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:35,007 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:44:35,007 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:44:35,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549 Second operand 8 states. [2019-11-28 03:44:35,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549. Second operand 8 states. Result 2132 states and 2669 transitions. Complement of second has 19 states. [2019-11-28 03:44:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:44:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-28 03:44:35,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-28 03:44:35,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:35,165 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:35,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 03:44:35,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:35,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:35,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:35,368 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:44:35,368 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:44:35,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549 Second operand 8 states. [2019-11-28 03:44:35,528 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549. Second operand 8 states. Result 2138 states and 2675 transitions. Complement of second has 27 states. [2019-11-28 03:44:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:44:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2019-11-28 03:44:35,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-28 03:44:35,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:35,530 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:44:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:44:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:35,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 03:44:35,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:44:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:44:35,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:44:35,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:44:35,701 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:44:35,702 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:44:35,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549 Second operand 8 states. [2019-11-28 03:44:35,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549. Second operand 8 states. Result 2872 states and 3553 transitions. Complement of second has 33 states. [2019-11-28 03:44:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:44:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:44:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2019-11-28 03:44:35,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-28 03:44:35,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:35,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 76 letters. Loop has 8 letters. [2019-11-28 03:44:35,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:35,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 68 letters. Loop has 16 letters. [2019-11-28 03:44:35,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:44:35,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2872 states and 3553 transitions. [2019-11-28 03:44:35,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-28 03:44:35,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2872 states to 2220 states and 2790 transitions. [2019-11-28 03:44:35,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2019-11-28 03:44:35,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-11-28 03:44:35,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2220 states and 2790 transitions. [2019-11-28 03:44:35,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:44:35,896 INFO L688 BuchiCegarLoop]: Abstraction has 2220 states and 2790 transitions. [2019-11-28 03:44:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states and 2790 transitions. [2019-11-28 03:44:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2106. [2019-11-28 03:44:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-11-28 03:44:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2623 transitions. [2019-11-28 03:44:35,951 INFO L711 BuchiCegarLoop]: Abstraction has 2106 states and 2623 transitions. [2019-11-28 03:44:35,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:44:35,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 03:44:35,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-11-28 03:44:35,952 INFO L87 Difference]: Start difference. First operand 2106 states and 2623 transitions. Second operand 25 states. [2019-11-28 03:44:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:44:36,572 INFO L93 Difference]: Finished difference Result 1632 states and 1924 transitions. [2019-11-28 03:44:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 03:44:36,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1632 states and 1924 transitions. [2019-11-28 03:44:36,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:44:36,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1632 states to 0 states and 0 transitions. [2019-11-28 03:44:36,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:44:36,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:44:36,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:44:36,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:44:36,590 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:44:36,590 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:44:36,590 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:44:36,590 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:44:36,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:44:36,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:44:36,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:44:36,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:44:36 BoogieIcfgContainer [2019-11-28 03:44:36,599 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:44:36,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:44:36,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:44:36,601 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:44:36,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:06" (3/4) ... [2019-11-28 03:44:36,609 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:44:36,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:44:36,611 INFO L168 Benchmark]: Toolchain (without parser) took 30913.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.8 MB). Free memory was 961.7 MB in the beginning and 861.4 MB in the end (delta: 100.3 MB). Peak memory consumption was 507.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:44:36,612 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:44:36,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.25 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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:44:36,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:44:36,613 INFO L168 Benchmark]: Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:44:36,618 INFO L168 Benchmark]: RCFGBuilder took 277.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:44:36,619 INFO L168 Benchmark]: BuchiAutomizer took 30172.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 861.4 MB in the end (delta: 271.4 MB). Peak memory consumption was 521.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:44:36,619 INFO L168 Benchmark]: Witness Printer took 8.90 ms. Allocated memory is still 1.4 GB. Free memory is still 861.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:44:36,622 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.25 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 133.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 277.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30172.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 861.4 MB in the end (delta: 271.4 MB). Peak memory consumption was 521.5 MB. Max. memory is 11.5 GB. * Witness Printer took 8.90 ms. Allocated memory is still 1.4 GB. Free memory is still 861.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (11 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function n and consists of 15 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 11 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.1s and 13 iterations. TraceHistogramMax:8. Analysis of lassos took 16.5s. Construction of modules took 4.6s. Büchi inclusion checks took 7.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 776 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 2063 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 55/126 HoareTripleCheckerStatistics: 544 SDtfs, 1326 SDslu, 2052 SDs, 0 SdLazy, 5179 SolverSat, 862 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI6 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf99 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp80 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...