./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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-1.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 cd6d4490a7412402195d3193de0347508566f7c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:16:26,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:16:26,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:16:26,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:16:26,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:16:26,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:16:26,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:16:26,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:16:26,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:16:26,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:16:26,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:16:26,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:16:26,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:16:26,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:16:26,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:16:26,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:16:26,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:16:26,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:16:26,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:16:26,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:16:26,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:16:26,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:16:26,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:16:26,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:16:26,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:16:26,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:16:26,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:16:26,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:16:26,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:16:26,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:16:26,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:16:26,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:16:26,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:16:26,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:16:26,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:16:26,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:16:26,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:16:26,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:16:26,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:16:26,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:16:26,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:16:26,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:16:26,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:16:26,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:16:26,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:16:26,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:16:26,291 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:16:26,291 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:16:26,291 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:16:26,292 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:16:26,292 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:16:26,292 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:16:26,292 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:16:26,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:16:26,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:16:26,293 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:16:26,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:16:26,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:16:26,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:16:26,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:16:26,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:16:26,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:16:26,297 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:16:26,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:16:26,297 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:16:26,298 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:16:26,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:16:26,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:16:26,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:16:26,299 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:16:26,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:16:26,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:16:26,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:16:26,299 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:16:26,301 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:16:26,301 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 -> cd6d4490a7412402195d3193de0347508566f7c8 [2019-11-28 21:16:26,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:16:26,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:16:26,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:16:26,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:16:26,640 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:16:26,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-28 21:16:26,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3811eb56b/a096d94f11cf493c900880509152012b/FLAG026c4ffbc [2019-11-28 21:16:27,106 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:16:27,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-28 21:16:27,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3811eb56b/a096d94f11cf493c900880509152012b/FLAG026c4ffbc [2019-11-28 21:16:27,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3811eb56b/a096d94f11cf493c900880509152012b [2019-11-28 21:16:27,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:16:27,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:16:27,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:16:27,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:16:27,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:16:27,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7f4e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27, skipping insertion in model container [2019-11-28 21:16:27,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:16:27,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:16:27,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:16:27,746 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:16:27,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:16:27,771 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:16:27,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27 WrapperNode [2019-11-28 21:16:27,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:16:27,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:16:27,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:16:27,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:16:27,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:16:27,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:16:27,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:16:27,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:16:27,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (1/1) ... [2019-11-28 21:16:27,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:16:27,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:16:27,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:16:27,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:16:27,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (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 21:16:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:16:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:16:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 21:16:27,927 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 21:16:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 21:16:27,927 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 21:16:28,101 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:16:28,102 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 21:16:28,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:16:28 BoogieIcfgContainer [2019-11-28 21:16:28,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:16:28,105 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:16:28,105 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:16:28,109 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:16:28,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:16:28,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:16:27" (1/3) ... [2019-11-28 21:16:28,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ff5cea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:16:28, skipping insertion in model container [2019-11-28 21:16:28,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:16:28,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:16:27" (2/3) ... [2019-11-28 21:16:28,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ff5cea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:16:28, skipping insertion in model container [2019-11-28 21:16:28,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:16:28,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:16:28" (3/3) ... [2019-11-28 21:16:28,133 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-1.c [2019-11-28 21:16:28,203 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:16:28,203 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:16:28,204 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:16:28,204 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:16:28,204 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:16:28,204 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:16:28,204 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:16:28,204 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:16:28,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 21:16:28,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 21:16:28,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:28,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:28,255 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:16:28,255 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:28,255 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:16:28,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 21:16:28,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 21:16:28,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:28,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:28,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:16:28,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:28,266 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 21:16:28,267 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 21:16:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-11-28 21:16:28,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379949554] [2019-11-28 21:16:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:28,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-11-28 21:16:28,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:28,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133933585] [2019-11-28 21:16:28,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:28,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-11-28 21:16:28,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:28,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850233574] [2019-11-28 21:16:28,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:28,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:28,714 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:28,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:28,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:28,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:28,716 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:16:28,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:28,717 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:28,717 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:28,717 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-28 21:16:28,717 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:28,718 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:28,740 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 21:16:28,747 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 21:16:28,753 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 21:16:28,756 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 21:16:28,760 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 21:16:28,766 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 21:16:28,772 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 21:16:28,776 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 21:16:28,779 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 21:16:28,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 21:16:28,884 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:28,885 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 21:16:28,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:28,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:28,905 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:28,906 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:28,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:28,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:28,932 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:28,932 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:28,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:28,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:28,950 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:28,950 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 21:16:28,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:28,969 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 21:16:28,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:28,974 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 21:16:28,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:28,994 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 21:16:29,001 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:29,001 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 21:16:29,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:29,010 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 21:16:29,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:29,015 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 21:16:29,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:29,032 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 21:16:29,041 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:29,041 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) [2019-11-28 21:16:29,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:29,060 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,065 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:29,065 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:29,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:29,080 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:29,081 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:29,100 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:16:29,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:29,191 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:29,194 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:29,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:29,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:29,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:29,195 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:29,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:29,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:29,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-28 21:16:29,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:29,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:29,198 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 21:16:29,201 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 21:16:29,205 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 21:16:29,208 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 21:16:29,212 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 21:16:29,215 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 21:16:29,217 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 21:16:29,220 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 21:16:29,222 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 21:16:29,232 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 21:16:29,297 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:29,303 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) [2019-11-28 21:16:29,322 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 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:29,332 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 21:16:29,348 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 21:16:29,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,352 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 21:16:29,354 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) [2019-11-28 21:16:29,369 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 21:16:29,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,376 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) [2019-11-28 21:16:29,387 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 21:16:29,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,396 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) [2019-11-28 21:16:29,407 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 21:16:29,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,416 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 21:16:29,429 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 21:16:29,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:29,437 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 21:16:29,448 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 21:16:29,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:29,455 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:29,463 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 21:16:29,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:29,469 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 21:16:29,487 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 21:16:29,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:29,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:29,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:29,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:29,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:29,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:29,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:29,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:29,504 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:16:29,504 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 21:16:29,517 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:29,518 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:29,518 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:29,519 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-11-28 21:16:29,527 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:16:29,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:29,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:16:29,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:29,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:16:29,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:29,698 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 21:16:29,715 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 21:16:29,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-11-28 21:16:29,962 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 21:16:29,962 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 21:16:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:16:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-28 21:16:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-28 21:16:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-28 21:16:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-28 21:16:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:29,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-11-28 21:16:29,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 21:16:29,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-11-28 21:16:29,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-28 21:16:29,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-28 21:16:29,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-28 21:16:29,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:29,996 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-28 21:16:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-28 21:16:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-11-28 21:16:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 21:16:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-28 21:16:30,039 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-28 21:16:30,039 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-28 21:16:30,040 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:16:30,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-28 21:16:30,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 21:16:30,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:30,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:30,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:30,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:30,044 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 21:16:30,044 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 21:16:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-11-28 21:16:30,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:30,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109293667] [2019-11-28 21:16:30,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,222 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 21:16:30,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109293667] [2019-11-28 21:16:30,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455039189] [2019-11-28 21:16:30,225 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 21:16:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:16:30,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:30,280 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 21:16:30,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:30,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 21:16:30,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991274533] [2019-11-28 21:16:30,289 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-11-28 21:16:30,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:30,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020000494] [2019-11-28 21:16:30,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,371 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 21:16:30,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020000494] [2019-11-28 21:16:30,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:16:30,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:16:30,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578510161] [2019-11-28 21:16:30,375 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:30,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:30,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 21:16:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 21:16:30,382 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-28 21:16:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:30,481 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-11-28 21:16:30,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 21:16:30,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-11-28 21:16:30,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 21:16:30,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-11-28 21:16:30,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-28 21:16:30,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-28 21:16:30,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-11-28 21:16:30,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:30,496 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-11-28 21:16:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-11-28 21:16:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-28 21:16:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 21:16:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-28 21:16:30,516 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-28 21:16:30,516 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-28 21:16:30,517 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:16:30,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-28 21:16:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 21:16:30,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:30,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:30,523 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:30,523 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:30,524 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 21:16:30,524 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 21:16:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-11-28 21:16:30,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:30,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539384685] [2019-11-28 21:16:30,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,635 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 21:16:30,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539384685] [2019-11-28 21:16:30,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094969709] [2019-11-28 21:16:30,636 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 21:16:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:30,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:16:30,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:30,686 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 21:16:30,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:30,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 21:16:30,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169526231] [2019-11-28 21:16:30,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:30,688 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-11-28 21:16:30,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:30,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653323201] [2019-11-28 21:16:30,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:30,701 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:30,887 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:30,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:30,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:30,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:30,887 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:16:30,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:30,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:30,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:30,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-28 21:16:30,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:30,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:30,890 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 21:16:30,892 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 21:16:30,896 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 21:16:30,904 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 21:16:30,907 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 21:16:30,912 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 21:16:30,916 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 21:16:30,918 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 21:16:30,920 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 21:16:30,982 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:30,985 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 21:16:30,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:30,990 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 21:16:30,999 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:30,999 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 21:16:31,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:31,009 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 21:16:31,012 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:31,013 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 21:16:31,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:31,021 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 21:16:31,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:16:31,033 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 21:16:31,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:31,917 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:31,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:31,918 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:31,918 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:31,918 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:31,918 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:31,918 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:31,918 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:31,918 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-28 21:16:31,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:31,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:31,920 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 21:16:31,925 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 21:16:31,927 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 21:16:31,934 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 21:16:31,936 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 21:16:31,938 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 21:16:31,942 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 21:16:31,944 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 21:16:31,946 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 21:16:32,018 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:32,020 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) [2019-11-28 21:16:32,025 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 21:16:32,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:32,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:32,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:32,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:32,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:32,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:32,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:32,031 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) [2019-11-28 21:16:32,038 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 21:16:32,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:32,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:32,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:32,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:32,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:32,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:32,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:32,044 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 21:16:32,054 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 21:16:32,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:32,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:32,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:32,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:32,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:32,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:32,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:32,066 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:32,071 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:16:32,071 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) [2019-11-28 21:16:32,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:32,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:32,076 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:32,076 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-28 21:16:32,078 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:32,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:16:32,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:32,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 21:16:32,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:32,249 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 21:16:32,250 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 21:16:32,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-28 21:16:32,584 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 21:16:32,585 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 21:16:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 21:16:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-11-28 21:16:32,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-11-28 21:16:32,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:32,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-11-28 21:16:32,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:32,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-11-28 21:16:32,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:32,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-11-28 21:16:32,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:16:32,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-11-28 21:16:32,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-28 21:16:32,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-28 21:16:32,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-11-28 21:16:32,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:32,607 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-11-28 21:16:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-11-28 21:16:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-28 21:16:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 21:16:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-11-28 21:16:32,625 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-11-28 21:16:32,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 21:16:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 21:16:32,626 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-11-28 21:16:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:32,810 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-11-28 21:16:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 21:16:32,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-11-28 21:16:32,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:16:32,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-11-28 21:16:32,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-28 21:16:32,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-28 21:16:32,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-11-28 21:16:32,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:32,822 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-11-28 21:16:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-11-28 21:16:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-11-28 21:16:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-28 21:16:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-11-28 21:16:32,840 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-28 21:16:32,840 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-28 21:16:32,840 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:16:32,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-11-28 21:16:32,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:16:32,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:32,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:32,848 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 21:16:32,848 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 21:16:32,849 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 21:16:32,849 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 21:16:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-11-28 21:16:32,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:32,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493473682] [2019-11-28 21:16:32,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,143 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 21:16:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493473682] [2019-11-28 21:16:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377679823] [2019-11-28 21:16:33,144 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 21:16:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:16:33,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:33,263 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 21:16:33,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:33,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-28 21:16:33,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185863531] [2019-11-28 21:16:33,265 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-11-28 21:16:33,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:33,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784797409] [2019-11-28 21:16:33,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,422 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 21:16:33,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784797409] [2019-11-28 21:16:33,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131366269] [2019-11-28 21:16:33,423 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 21:16:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:16:33,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:33,542 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 21:16:33,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 21:16:33,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-11-28 21:16:33,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806074588] [2019-11-28 21:16:33,544 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:33,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:33,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 21:16:33,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 21:16:33,546 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-11-28 21:16:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:33,609 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-11-28 21:16:33,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 21:16:33,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-11-28 21:16:33,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:16:33,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-11-28 21:16:33,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-28 21:16:33,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-28 21:16:33,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-11-28 21:16:33,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:33,618 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-11-28 21:16:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-11-28 21:16:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-28 21:16:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 21:16:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-11-28 21:16:33,648 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-28 21:16:33,648 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-28 21:16:33,648 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:16:33,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-11-28 21:16:33,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:16:33,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:33,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:33,658 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 21:16:33,659 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 21:16:33,660 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 21:16:33,661 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 21:16:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-11-28 21:16:33,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:33,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743299499] [2019-11-28 21:16:33,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,076 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 21:16:34,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743299499] [2019-11-28 21:16:34,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445906020] [2019-11-28 21:16:34,078 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 21:16:34,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:16:34,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:16:34,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:16:34,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:34,235 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 21:16:34,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:34,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-11-28 21:16:34,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884777841] [2019-11-28 21:16:34,237 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-11-28 21:16:34,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:34,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617765725] [2019-11-28 21:16:34,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,385 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 21:16:34,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617765725] [2019-11-28 21:16:34,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043885779] [2019-11-28 21:16:34,386 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 21:16:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,415 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:16:34,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:34,488 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 21:16:34,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:34,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-28 21:16:34,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630431117] [2019-11-28 21:16:34,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:34,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 21:16:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 21:16:34,490 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-11-28 21:16:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:34,752 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-11-28 21:16:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:16:34,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-11-28 21:16:34,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-28 21:16:34,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-11-28 21:16:34,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-28 21:16:34,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-28 21:16:34,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-11-28 21:16:34,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:34,759 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-11-28 21:16:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-11-28 21:16:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-28 21:16:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 21:16:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-11-28 21:16:34,767 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-28 21:16:34,767 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-28 21:16:34,768 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:16:34,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-11-28 21:16:34,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-28 21:16:34,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:34,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:34,770 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 21:16:34,770 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:34,771 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 21:16:34,771 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 21:16:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-11-28 21:16:34,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:34,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635107298] [2019-11-28 21:16:34,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:34,968 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 21:16:34,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635107298] [2019-11-28 21:16:34,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425716035] [2019-11-28 21:16:34,969 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 21:16:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:35,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:16:35,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:35,110 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 21:16:35,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:35,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-11-28 21:16:35,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747018391] [2019-11-28 21:16:35,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-11-28 21:16:35,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:35,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330324721] [2019-11-28 21:16:35,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:35,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:35,381 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:35,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:35,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:35,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:35,382 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:16:35,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:35,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:35,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-28 21:16:35,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:35,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:35,385 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 21:16:35,391 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 21:16:35,393 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 21:16:35,395 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 21:16:35,397 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 21:16:35,399 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 21:16:35,400 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 21:16:35,407 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 21:16:35,409 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 21:16:35,457 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:35,457 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 21:16:35,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:35,466 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:35,466 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:35,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:35,476 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:35,476 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:35,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:35,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:35,485 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) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:35,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:35,497 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:35,497 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) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:35,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:35,505 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:35,506 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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:35,512 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:35,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:35,515 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 21:16:35,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:35,520 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) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:35,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:16:35,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:36,472 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:36,476 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:36,476 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:36,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:36,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:36,476 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:36,476 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:36,476 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:36,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:36,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-28 21:16:36,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:36,477 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:36,478 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 21:16:36,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:16:36,482 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 21:16:36,483 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 21:16:36,489 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 21:16:36,490 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 21:16:36,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 21:16:36,500 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 21:16:36,501 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 21:16:36,554 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:36,555 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) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:36,563 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 21:16:36,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:36,567 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 21:16:36,573 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 21:16:36,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:36,578 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) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:36,584 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 21:16:36,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:36,588 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) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:36,593 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 21:16:36,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:36,602 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 21:16:36,608 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 21:16:36,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,611 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 21:16:36,613 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 21:16:36,619 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 21:16:36,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,622 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 21:16:36,624 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 21:16:36,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 21:16:36,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:36,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:36,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:36,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:36,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:36,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:36,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:36,636 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:36,639 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:16:36,639 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 21:16:36,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:36,643 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:36,643 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:36,643 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-28 21:16:36,644 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:16:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:36,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:16:36,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:36,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:36,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:36,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:16:36,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:36,808 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 21:16:36,809 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 21:16:36,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-28 21:16:36,947 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 21:16:36,948 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 21:16:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:16:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-28 21:16:36,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-28 21:16:36,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:36,949 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:36,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:16:36,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:37,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:37,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:37,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:16:37,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:37,083 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 21:16:37,083 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 21:16:37,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-28 21:16:37,273 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 21:16:37,274 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 21:16:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:16:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-11-28 21:16:37,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-28 21:16:37,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:37,275 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:37,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:16:37,325 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:37,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:16:37,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:37,431 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 21:16:37,432 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 21:16:37,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-28 21:16:37,592 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 21:16:37,592 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 21:16:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 21:16:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-11-28 21:16:37,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-28 21:16:37,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:37,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-28 21:16:37,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-11-28 21:16:37,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:37,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-11-28 21:16:37,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-11-28 21:16:37,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-11-28 21:16:37,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-28 21:16:37,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-11-28 21:16:37,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-11-28 21:16:37,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:37,608 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-28 21:16:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-11-28 21:16:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-28 21:16:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 21:16:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-11-28 21:16:37,624 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-11-28 21:16:37,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 21:16:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-28 21:16:37,626 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:16:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:38,021 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-11-28 21:16:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:16:38,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-11-28 21:16:38,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 21:16:38,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-11-28 21:16:38,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-28 21:16:38,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-11-28 21:16:38,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-11-28 21:16:38,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:38,031 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-11-28 21:16:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-11-28 21:16:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-28 21:16:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 21:16:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-28 21:16:38,036 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-28 21:16:38,037 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-28 21:16:38,037 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:16:38,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-11-28 21:16:38,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 21:16:38,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:38,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:38,040 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 21:16:38,040 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 21:16:38,040 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 21:16:38,040 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 21:16:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-11-28 21:16:38,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:38,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714073800] [2019-11-28 21:16:38,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,151 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 21:16:38,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714073800] [2019-11-28 21:16:38,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960413592] [2019-11-28 21:16:38,152 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 21:16:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:38,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:16:38,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:38,265 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 21:16:38,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:38,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-11-28 21:16:38,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849796112] [2019-11-28 21:16:38,267 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-11-28 21:16:38,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:38,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045985963] [2019-11-28 21:16:38,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:38,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:38,497 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:38,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:38,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:38,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:38,498 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:16:38,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:38,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:38,499 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:38,499 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-28 21:16:38,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:38,499 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:38,500 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 21:16:38,503 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 21:16:38,504 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 21:16:38,511 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 21:16:38,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 21:16:38,514 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 21:16:38,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 21:16:38,518 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 21:16:38,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 21:16:38,570 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:38,571 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 21:16:38,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:38,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:38,579 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:38,579 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 21:16:38,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:38,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:38,588 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:38,588 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 21:16:38,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:38,595 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 21:16:38,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:16:38,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:39,291 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:39,293 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:39,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:39,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:39,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:39,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:39,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:39,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:39,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:39,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-28 21:16:39,294 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:39,294 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:39,295 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 21:16:39,296 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 21:16:39,297 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 21:16:39,303 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 21:16:39,305 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 21:16:39,306 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 21:16:39,308 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 21:16:39,310 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 21:16:39,312 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 21:16:39,360 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:39,361 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 21:16:39,367 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 21:16:39,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:39,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:39,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:39,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:39,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:39,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:39,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:39,372 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 21:16:39,380 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 21:16:39,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:39,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:39,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:39,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:39,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:39,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:39,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:39,384 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 21:16:39,389 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 21:16:39,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:39,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:39,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:39,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:39,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:39,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:39,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:39,396 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:39,398 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:16:39,398 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 21:16:39,403 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:39,403 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:39,403 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:39,403 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-28 21:16:39,404 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:16:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:39,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 21:16:39,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:39,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:16:39,533 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:39,614 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 21:16:39,615 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 21:16:39,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-28 21:16:39,993 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 21:16:39,994 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 21:16:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 21:16:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-11-28 21:16:39,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-28 21:16:39,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:39,995 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:40,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 21:16:40,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:40,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:40,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:16:40,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:40,180 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 21:16:40,181 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 21:16:40,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-28 21:16:40,450 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 21:16:40,453 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 21:16:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 21:16:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-11-28 21:16:40,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-28 21:16:40,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:40,454 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:40,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 21:16:40,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:40,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:16:40,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:40,644 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 21:16:40,645 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 21:16:40,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-28 21:16:41,069 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 21:16:41,073 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 21:16:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 21:16:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-11-28 21:16:41,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-28 21:16:41,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:41,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-11-28 21:16:41,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:41,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-28 21:16:41,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:41,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-11-28 21:16:41,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-28 21:16:41,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-11-28 21:16:41,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-28 21:16:41,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-28 21:16:41,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-11-28 21:16:41,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:41,094 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-11-28 21:16:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-11-28 21:16:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-11-28 21:16:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-28 21:16:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-11-28 21:16:41,108 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-11-28 21:16:41,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 21:16:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-28 21:16:41,109 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-11-28 21:16:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:41,517 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-11-28 21:16:41,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 21:16:41,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-11-28 21:16:41,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 21:16:41,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-11-28 21:16:41,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-11-28 21:16:41,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-11-28 21:16:41,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-11-28 21:16:41,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:41,531 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-11-28 21:16:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-11-28 21:16:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-11-28 21:16:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-28 21:16:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-11-28 21:16:41,546 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-28 21:16:41,546 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-28 21:16:41,546 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:16:41,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-11-28 21:16:41,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 21:16:41,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:41,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:41,552 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 21:16:41,552 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 21:16:41,552 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 21:16:41,552 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 21:16:41,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-11-28 21:16:41,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:41,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481211111] [2019-11-28 21:16:41,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,731 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 21:16:41,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481211111] [2019-11-28 21:16:41,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358464415] [2019-11-28 21:16:41,732 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 21:16:41,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:16:41,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:16:41,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:16:41,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:41,824 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 21:16:41,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:41,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-11-28 21:16:41,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339813611] [2019-11-28 21:16:41,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash -564433099, now seen corresponding path program 1 times [2019-11-28 21:16:41,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:41,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141384360] [2019-11-28 21:16:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:41,981 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 21:16:41,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141384360] [2019-11-28 21:16:41,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056177622] [2019-11-28 21:16:41,982 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 21:16:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:42,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:16:42,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:42,064 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 21:16:42,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:42,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-11-28 21:16:42,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461904328] [2019-11-28 21:16:42,065 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:42,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 21:16:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-28 21:16:42,066 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-11-28 21:16:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:42,603 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-11-28 21:16:42,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 21:16:42,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-11-28 21:16:42,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 21:16:42,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-11-28 21:16:42,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-11-28 21:16:42,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-11-28 21:16:42,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-11-28 21:16:42,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:42,617 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-11-28 21:16:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-11-28 21:16:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-11-28 21:16:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-28 21:16:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-11-28 21:16:42,633 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-28 21:16:42,633 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-28 21:16:42,633 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:16:42,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-11-28 21:16:42,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 21:16:42,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:42,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:42,638 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 21:16:42,638 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:42,638 INFO L794 eck$LassoCheckResult]: Stem: 10067#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10005#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10006#fibo1ENTRY ~n := #in~n; 10244#L8 assume !(~n < 1); 10245#L10 assume !(1 == ~n); 10235#L13 call #t~ret0 := fibo2(~n - 1);< 10236#fibo2ENTRY ~n := #in~n; 10261#L18 assume !(~n < 1); 10260#L20 assume !(1 == ~n); 10239#L23 call #t~ret2 := fibo1(~n - 1);< 10259#fibo1ENTRY ~n := #in~n; 10258#L8 assume !(~n < 1); 10238#L10 assume !(1 == ~n); 10240#L13 call #t~ret0 := fibo2(~n - 1);< 10257#fibo2ENTRY ~n := #in~n; 10256#L18 assume !(~n < 1); 10255#L20 assume !(1 == ~n); 10253#L23 call #t~ret2 := fibo1(~n - 1);< 10252#fibo1ENTRY ~n := #in~n; 10254#L8 assume !(~n < 1); 10419#L10 assume !(1 == ~n); 10229#L13 call #t~ret0 := fibo2(~n - 1);< 10234#fibo2ENTRY ~n := #in~n; 10251#L18 assume !(~n < 1); 10249#L20 assume !(1 == ~n); 10250#L23 call #t~ret2 := fibo1(~n - 1);< 10434#fibo1ENTRY ~n := #in~n; 10471#L8 assume !(~n < 1); 10470#L10 assume 1 == ~n;#res := 1; 10469#fibo1FINAL assume true; 10433#fibo1EXIT >#45#return; 10070#L23-1 call #t~ret3 := fibo1(~n - 2);< 10068#fibo1ENTRY ~n := #in~n; 10071#L8 assume !(~n < 1); 10432#L10 assume 1 == ~n;#res := 1; 10431#fibo1FINAL assume true; 10425#fibo1EXIT >#47#return; 10424#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10422#fibo2FINAL assume true; 10417#fibo2EXIT >#49#return; 10015#L13-1 call #t~ret1 := fibo2(~n - 2);< 10056#fibo2ENTRY ~n := #in~n; 10483#L18 assume !(~n < 1); 10482#L20 assume !(1 == ~n); 10047#L23 [2019-11-28 21:16:42,638 INFO L796 eck$LassoCheckResult]: Loop: 10047#L23 call #t~ret2 := fibo1(~n - 1);< 10397#fibo1ENTRY ~n := #in~n; 10414#L8 assume !(~n < 1); 10413#L10 assume !(1 == ~n); 10078#L13 call #t~ret0 := fibo2(~n - 1);< 10121#fibo2ENTRY ~n := #in~n; 10220#L18 assume !(~n < 1); 10212#L20 assume !(1 == ~n); 10172#L23 call #t~ret2 := fibo1(~n - 1);< 10176#fibo1ENTRY ~n := #in~n; 10188#L8 assume !(~n < 1); 10187#L10 assume 1 == ~n;#res := 1; 10180#fibo1FINAL assume true; 10170#fibo1EXIT >#45#return; 10051#L23-1 call #t~ret3 := fibo1(~n - 2);< 10029#fibo1ENTRY ~n := #in~n; 10223#L8 assume !(~n < 1); 10225#L10 assume 1 == ~n;#res := 1; 10050#fibo1FINAL assume true; 10053#fibo1EXIT >#47#return; 10120#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10213#fibo2FINAL assume true; 10214#fibo2EXIT >#49#return; 10023#L13-1 call #t~ret1 := fibo2(~n - 2);< 10056#fibo2ENTRY ~n := #in~n; 10483#L18 assume !(~n < 1); 10482#L20 assume !(1 == ~n); 10047#L23 [2019-11-28 21:16:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-11-28 21:16:42,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:42,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586244052] [2019-11-28 21:16:42,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:42,895 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 21:16:42,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586244052] [2019-11-28 21:16:42,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979786403] [2019-11-28 21:16:42,896 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 21:16:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:42,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:16:42,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:42,996 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 21:16:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:42,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-11-28 21:16:42,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646483101] [2019-11-28 21:16:42,998 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 781356392, now seen corresponding path program 1 times [2019-11-28 21:16:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:42,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707156792] [2019-11-28 21:16:42,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 21:16:43,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707156792] [2019-11-28 21:16:43,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296046451] [2019-11-28 21:16:43,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:16:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:16:43,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:16:43,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:43,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2019-11-28 21:16:43,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545969047] [2019-11-28 21:16:43,148 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:43,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 21:16:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-28 21:16:43,149 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-11-28 21:16:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:43,279 INFO L93 Difference]: Finished difference Result 500 states and 653 transitions. [2019-11-28 21:16:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 21:16:43,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 653 transitions. [2019-11-28 21:16:43,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 21:16:43,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 490 states and 642 transitions. [2019-11-28 21:16:43,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2019-11-28 21:16:43,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2019-11-28 21:16:43,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 490 states and 642 transitions. [2019-11-28 21:16:43,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:43,294 INFO L688 BuchiCegarLoop]: Abstraction has 490 states and 642 transitions. [2019-11-28 21:16:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states and 642 transitions. [2019-11-28 21:16:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2019-11-28 21:16:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-28 21:16:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 624 transitions. [2019-11-28 21:16:43,307 INFO L711 BuchiCegarLoop]: Abstraction has 478 states and 624 transitions. [2019-11-28 21:16:43,308 INFO L591 BuchiCegarLoop]: Abstraction has 478 states and 624 transitions. [2019-11-28 21:16:43,308 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:16:43,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 624 transitions. [2019-11-28 21:16:43,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-28 21:16:43,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:43,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:43,313 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:43,313 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:16:43,313 INFO L794 eck$LassoCheckResult]: Stem: 11348#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 11312#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11314#fibo1ENTRY ~n := #in~n; 11358#L8 assume !(~n < 1); 11311#L10 assume !(1 == ~n); 11313#L13 call #t~ret0 := fibo2(~n - 1);< 11515#fibo2ENTRY ~n := #in~n; 11545#L18 assume !(~n < 1); 11544#L20 assume !(1 == ~n); 11540#L23 call #t~ret2 := fibo1(~n - 1);< 11543#fibo1ENTRY ~n := #in~n; 11542#L8 assume !(~n < 1); 11541#L10 assume !(1 == ~n); 11536#L13 call #t~ret0 := fibo2(~n - 1);< 11539#fibo2ENTRY ~n := #in~n; 11538#L18 assume !(~n < 1); 11537#L20 assume !(1 == ~n); 11524#L23 call #t~ret2 := fibo1(~n - 1);< 11535#fibo1ENTRY ~n := #in~n; 11527#L8 assume !(~n < 1); 11523#L10 assume !(1 == ~n); 11317#L13 call #t~ret0 := fibo2(~n - 1);< 11516#fibo2ENTRY ~n := #in~n; 11534#L18 assume !(~n < 1); 11532#L20 assume !(1 == ~n); 11325#L23 call #t~ret2 := fibo1(~n - 1);< 11528#fibo1ENTRY ~n := #in~n; 11525#L8 assume !(~n < 1); 11526#L10 assume !(1 == ~n); 11329#L13 call #t~ret0 := fibo2(~n - 1);< 11330#fibo2ENTRY ~n := #in~n; 11757#L18 assume !(~n < 1); 11755#L20 assume 1 == ~n;#res := 1; 11754#fibo2FINAL assume true; 11751#fibo2EXIT >#49#return; 11746#L13-1 call #t~ret1 := fibo2(~n - 2);< 11747#fibo2ENTRY ~n := #in~n; 11753#L18 assume ~n < 1;#res := 0; 11748#fibo2FINAL assume true; 11745#fibo2EXIT >#51#return; 11744#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11743#fibo1FINAL assume true; 11324#fibo1EXIT >#45#return; 11315#L23-1 call #t~ret3 := fibo1(~n - 2);< 11318#fibo1ENTRY ~n := #in~n; 11733#L8 assume !(~n < 1); 11721#L10 assume 1 == ~n;#res := 1; 11720#fibo1FINAL assume true; 11718#fibo1EXIT >#47#return; 11716#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11712#fibo2FINAL assume true; 11692#fibo2EXIT >#49#return; 11350#L13-1 call #t~ret1 := fibo2(~n - 2);< 11342#fibo2ENTRY ~n := #in~n; 11770#L18 assume !(~n < 1); 11769#L20 assume !(1 == ~n); 11331#L23 [2019-11-28 21:16:43,314 INFO L796 eck$LassoCheckResult]: Loop: 11331#L23 call #t~ret2 := fibo1(~n - 1);< 11679#fibo1ENTRY ~n := #in~n; 11695#L8 assume !(~n < 1); 11694#L10 assume !(1 == ~n); 11356#L13 call #t~ret0 := fibo2(~n - 1);< 11398#fibo2ENTRY ~n := #in~n; 11486#L18 assume !(~n < 1); 11485#L20 assume !(1 == ~n); 11390#L23 call #t~ret2 := fibo1(~n - 1);< 11406#fibo1ENTRY ~n := #in~n; 11403#L8 assume !(~n < 1); 11401#L10 assume !(1 == ~n); 11377#L13 call #t~ret0 := fibo2(~n - 1);< 11472#fibo2ENTRY ~n := #in~n; 11425#L18 assume !(~n < 1); 11426#L20 assume 1 == ~n;#res := 1; 11424#fibo2FINAL assume true; 11421#fibo2EXIT >#49#return; 11418#L13-1 call #t~ret1 := fibo2(~n - 2);< 11420#fibo2ENTRY ~n := #in~n; 11428#L18 assume ~n < 1;#res := 0; 11417#fibo2FINAL assume true; 11419#fibo2EXIT >#51#return; 11494#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11495#fibo1FINAL assume true; 11388#fibo1EXIT >#45#return; 11395#L23-1 call #t~ret3 := fibo1(~n - 2);< 11405#fibo1ENTRY ~n := #in~n; 11465#L8 assume !(~n < 1); 11463#L10 assume 1 == ~n;#res := 1; 11453#fibo1FINAL assume true; 11451#fibo1EXIT >#47#return; 11394#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11707#fibo2FINAL assume true; 11702#fibo2EXIT >#49#return; 11341#L13-1 call #t~ret1 := fibo2(~n - 2);< 11342#fibo2ENTRY ~n := #in~n; 11770#L18 assume !(~n < 1); 11769#L20 assume !(1 == ~n); 11331#L23 [2019-11-28 21:16:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash -579432640, now seen corresponding path program 3 times [2019-11-28 21:16:43,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:43,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602079153] [2019-11-28 21:16:43,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:43,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1831895155, now seen corresponding path program 1 times [2019-11-28 21:16:43,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:43,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544911414] [2019-11-28 21:16:43,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:43,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash 551901268, now seen corresponding path program 4 times [2019-11-28 21:16:43,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:43,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778509554] [2019-11-28 21:16:43,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 99 proven. 98 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-28 21:16:43,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778509554] [2019-11-28 21:16:43,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994832135] [2019-11-28 21:16:43,548 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:16:43,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 21:16:43,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:16:43,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 21:16:43,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 193 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 21:16:43,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:43,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-28 21:16:43,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000132487] [2019-11-28 21:16:44,066 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:44,067 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:44,067 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:44,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:44,067 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:16:44,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:44,068 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:44,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:44,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration10_Loop [2019-11-28 21:16:44,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:44,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:44,069 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 21:16:44,070 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 21:16:44,078 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 21:16:44,080 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 21:16:44,081 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 21:16:44,083 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 21:16:44,087 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 21:16:44,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 21:16:44,089 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 21:16:44,152 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:44,152 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:44,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:44,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:44,161 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:44,162 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:44,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:44,166 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:44,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:16:44,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:46,111 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:46,113 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:46,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:46,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:46,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:46,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:46,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:46,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:46,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:46,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration10_Loop [2019-11-28 21:16:46,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:46,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:46,114 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 21:16:46,116 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 21:16:46,117 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 21:16:46,119 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 21:16:46,121 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 21:16:46,122 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 21:16:46,123 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 21:16:46,125 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 21:16:46,127 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 21:16:46,202 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:46,202 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:46,207 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 21:16:46,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:16:46,220 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 21:16:46,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:46,229 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 21:16:46,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,233 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 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 21:16:46,239 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 21:16:46,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,243 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:46,248 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 21:16:46,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,251 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 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 21:16:46,256 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 21:16:46,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,259 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 21:16:46,264 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 21:16:46,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,267 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 21:16:46,272 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 21:16:46,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,275 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 21:16:46,281 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 21:16:46,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:46,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:46,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:46,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:46,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:46,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:46,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:46,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:46,289 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:16:46,289 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 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 21:16:46,293 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:46,293 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:46,293 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:46,293 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-28 21:16:46,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:16:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:46,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 21:16:46,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:46,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:46,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:46,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:46,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:46,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 21:16:46,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 21:16:46,548 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-28 21:16:46,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 624 transitions. cyclomatic complexity: 150 Second operand 13 states. [2019-11-28 21:16:47,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 624 transitions. cyclomatic complexity: 150. Second operand 13 states. Result 1516 states and 1979 transitions. Complement of second has 50 states. [2019-11-28 21:16:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-28 21:16:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:16:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2019-11-28 21:16:47,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 56 letters. Loop has 39 letters. [2019-11-28 21:16:47,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:47,107 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:47,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 21:16:47,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:47,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 21:16:47,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 21:16:47,369 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-28 21:16:47,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 624 transitions. cyclomatic complexity: 150 Second operand 13 states. [2019-11-28 21:16:48,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 624 transitions. cyclomatic complexity: 150. Second operand 13 states. Result 1613 states and 2114 transitions. Complement of second has 52 states. [2019-11-28 21:16:48,029 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 21:16:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:16:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2019-11-28 21:16:48,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 56 letters. Loop has 39 letters. [2019-11-28 21:16:48,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:48,031 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:48,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 21:16:48,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:48,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:48,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 21:16:48,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 21:16:48,301 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 11 loop predicates [2019-11-28 21:16:48,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 624 transitions. cyclomatic complexity: 150 Second operand 13 states. [2019-11-28 21:16:48,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 624 transitions. cyclomatic complexity: 150. Second operand 13 states. Result 1981 states and 2429 transitions. Complement of second has 127 states. [2019-11-28 21:16:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-28 21:16:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:16:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-11-28 21:16:48,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 56 letters. Loop has 39 letters. [2019-11-28 21:16:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:48,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 95 letters. Loop has 39 letters. [2019-11-28 21:16:48,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:48,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 56 letters. Loop has 78 letters. [2019-11-28 21:16:48,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:48,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1981 states and 2429 transitions. [2019-11-28 21:16:48,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-11-28 21:16:48,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1981 states to 1257 states and 1632 transitions. [2019-11-28 21:16:48,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2019-11-28 21:16:48,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-11-28 21:16:48,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1257 states and 1632 transitions. [2019-11-28 21:16:48,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:48,953 INFO L688 BuchiCegarLoop]: Abstraction has 1257 states and 1632 transitions. [2019-11-28 21:16:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states and 1632 transitions. [2019-11-28 21:16:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1056. [2019-11-28 21:16:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-11-28 21:16:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1324 transitions. [2019-11-28 21:16:48,986 INFO L711 BuchiCegarLoop]: Abstraction has 1056 states and 1324 transitions. [2019-11-28 21:16:48,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:48,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 21:16:48,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-28 21:16:48,987 INFO L87 Difference]: Start difference. First operand 1056 states and 1324 transitions. Second operand 21 states. [2019-11-28 21:16:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:49,456 INFO L93 Difference]: Finished difference Result 951 states and 1137 transitions. [2019-11-28 21:16:49,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 21:16:49,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 951 states and 1137 transitions. [2019-11-28 21:16:49,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 21:16:49,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 951 states to 881 states and 1061 transitions. [2019-11-28 21:16:49,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2019-11-28 21:16:49,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 228 [2019-11-28 21:16:49,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 881 states and 1061 transitions. [2019-11-28 21:16:49,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:49,473 INFO L688 BuchiCegarLoop]: Abstraction has 881 states and 1061 transitions. [2019-11-28 21:16:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states and 1061 transitions. [2019-11-28 21:16:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 817. [2019-11-28 21:16:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-11-28 21:16:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 978 transitions. [2019-11-28 21:16:49,495 INFO L711 BuchiCegarLoop]: Abstraction has 817 states and 978 transitions. [2019-11-28 21:16:49,495 INFO L591 BuchiCegarLoop]: Abstraction has 817 states and 978 transitions. [2019-11-28 21:16:49,495 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:16:49,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 817 states and 978 transitions. [2019-11-28 21:16:49,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 21:16:49,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:49,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:49,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1] [2019-11-28 21:16:49,503 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 21:16:49,503 INFO L794 eck$LassoCheckResult]: Stem: 20589#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 20560#L37 call main_#t~ret4 := fibo1(main_~x~0);< 20561#fibo1ENTRY ~n := #in~n; 20720#L8 assume !(~n < 1); 20719#L10 assume !(1 == ~n); 20714#L13 call #t~ret0 := fibo2(~n - 1);< 20715#fibo2ENTRY ~n := #in~n; 20746#L18 assume !(~n < 1); 20744#L20 assume !(1 == ~n); 20712#L23 call #t~ret2 := fibo1(~n - 1);< 20741#fibo1ENTRY ~n := #in~n; 20793#L8 assume !(~n < 1); 20786#L10 assume !(1 == ~n); 20717#L13 call #t~ret0 := fibo2(~n - 1);< 20718#fibo2ENTRY ~n := #in~n; 20742#L18 assume !(~n < 1); 20739#L20 assume !(1 == ~n); 20734#L23 call #t~ret2 := fibo1(~n - 1);< 20735#fibo1ENTRY ~n := #in~n; 20797#L8 assume !(~n < 1); 20796#L10 assume !(1 == ~n); 20535#L13 call #t~ret0 := fibo2(~n - 1);< 20795#fibo2ENTRY ~n := #in~n; 21015#L18 assume !(~n < 1); 21014#L20 assume !(1 == ~n); 20597#L23 call #t~ret2 := fibo1(~n - 1);< 20889#fibo1ENTRY ~n := #in~n; 20596#L8 assume !(~n < 1); 20598#L10 assume !(1 == ~n); 21012#L13 call #t~ret0 := fibo2(~n - 1);< 21013#fibo2ENTRY ~n := #in~n; 21018#L18 assume !(~n < 1); 21017#L20 assume 1 == ~n;#res := 1; 21016#fibo2FINAL assume true; 21011#fibo2EXIT >#49#return; 21007#L13-1 call #t~ret1 := fibo2(~n - 2);< 21008#fibo2ENTRY ~n := #in~n; 21020#L18 assume ~n < 1;#res := 0; 21019#fibo2FINAL assume true; 21006#fibo2EXIT >#51#return; 21004#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 21002#fibo1FINAL assume true; 21001#fibo1EXIT >#45#return; 20999#L23-1 call #t~ret3 := fibo1(~n - 2);< 21000#fibo1ENTRY ~n := #in~n; 21009#L8 assume !(~n < 1); 21005#L10 assume 1 == ~n;#res := 1; 21003#fibo1FINAL assume true; 20998#fibo1EXIT >#47#return; 20996#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 20995#fibo2FINAL assume true; 20794#fibo2EXIT >#49#return; 20788#L13-1 call #t~ret1 := fibo2(~n - 2);< 20791#fibo2ENTRY ~n := #in~n; 21301#L18 assume ~n < 1;#res := 0; 21231#fibo2FINAL assume true; 20787#fibo2EXIT >#51#return; 20785#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 20784#fibo1FINAL assume true; 20733#fibo1EXIT >#45#return; 20727#L23-1 call #t~ret3 := fibo1(~n - 2);< 20731#fibo1ENTRY ~n := #in~n; 20978#L8 assume !(~n < 1); 20976#L10 assume !(1 == ~n); 20773#L13 call #t~ret0 := fibo2(~n - 1);< 20974#fibo2ENTRY ~n := #in~n; 20972#L18 assume !(~n < 1); 20968#L20 assume 1 == ~n;#res := 1; 20969#fibo2FINAL assume true; 21273#fibo2EXIT >#49#return; 20779#L13-1 call #t~ret1 := fibo2(~n - 2);< 20780#fibo2ENTRY ~n := #in~n; 21255#L18 assume ~n < 1;#res := 0; 21256#fibo2FINAL assume true; 21267#fibo2EXIT >#51#return; 20775#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 20772#fibo1FINAL assume true; 20724#fibo1EXIT >#47#return; 20722#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 20721#fibo2FINAL assume true; 20716#fibo2EXIT >#49#return; 20548#L13-1 call #t~ret1 := fibo2(~n - 2);< 20711#fibo2ENTRY ~n := #in~n; 20709#L18 assume !(~n < 1); 20707#L20 assume !(1 == ~n); 20637#L23 call #t~ret2 := fibo1(~n - 1);< 20704#fibo1ENTRY ~n := #in~n; 20702#L8 assume !(~n < 1); 20700#L10 assume !(1 == ~n); 20553#L13 call #t~ret0 := fibo2(~n - 1);< 21064#fibo2ENTRY ~n := #in~n; 21063#L18 assume !(~n < 1); 20942#L20 assume !(1 == ~n); 20943#L23 call #t~ret2 := fibo1(~n - 1);< 21053#fibo1ENTRY ~n := #in~n; 21071#L8 assume !(~n < 1); 21070#L10 assume 1 == ~n;#res := 1; 21065#fibo1FINAL assume true; 21050#fibo1EXIT >#45#return; 21046#L23-1 call #t~ret3 := fibo1(~n - 2);< 21048#fibo1ENTRY ~n := #in~n; 21121#L8 assume ~n < 1;#res := 0; 21076#fibo1FINAL assume true; 21044#fibo1EXIT >#47#return; 20562#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 20552#fibo2FINAL assume true; 20556#fibo2EXIT >#49#return; 20653#L13-1 call #t~ret1 := fibo2(~n - 2);< 20656#fibo2ENTRY ~n := #in~n; 20891#L18 assume ~n < 1;#res := 0; 20890#fibo2FINAL assume true; 20652#fibo2EXIT >#51#return; 20650#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 20645#fibo1FINAL assume true; 20635#fibo1EXIT >#45#return; 20576#L23-1 [2019-11-28 21:16:49,504 INFO L796 eck$LassoCheckResult]: Loop: 20576#L23-1 call #t~ret3 := fibo1(~n - 2);< 20634#fibo1ENTRY ~n := #in~n; 20633#L8 assume !(~n < 1); 20632#L10 assume !(1 == ~n); 20624#L13 call #t~ret0 := fibo2(~n - 1);< 20627#fibo2ENTRY ~n := #in~n; 20631#L18 assume !(~n < 1); 20622#L20 assume !(1 == ~n); 20542#L23 call #t~ret2 := fibo1(~n - 1);< 20641#fibo1ENTRY ~n := #in~n; 20776#L8 assume !(~n < 1); 20774#L10 assume !(1 == ~n); 20688#L13 call #t~ret0 := fibo2(~n - 1);< 20689#fibo2ENTRY ~n := #in~n; 20829#L18 assume !(~n < 1); 20826#L20 assume !(1 == ~n); 20827#L23 call #t~ret2 := fibo1(~n - 1);< 20964#fibo1ENTRY ~n := #in~n; 21026#L8 assume !(~n < 1); 21024#L10 assume 1 == ~n;#res := 1; 20967#fibo1FINAL assume true; 20958#fibo1EXIT >#45#return; 20753#L23-1 call #t~ret3 := fibo1(~n - 2);< 20756#fibo1ENTRY ~n := #in~n; 21137#L8 assume ~n < 1;#res := 0; 20954#fibo1FINAL assume true; 20750#fibo1EXIT >#47#return; 20696#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 20695#fibo2FINAL assume true; 20687#fibo2EXIT >#49#return; 20659#L13-1 call #t~ret1 := fibo2(~n - 2);< 20649#fibo2ENTRY ~n := #in~n; 20757#L18 assume !(~n < 1); 20697#L20 assume !(1 == ~n); 20675#L23 call #t~ret2 := fibo1(~n - 1);< 20676#fibo1ENTRY ~n := #in~n; 20694#L8 assume !(~n < 1); 20693#L10 assume 1 == ~n;#res := 1; 20691#fibo1FINAL assume true; 20674#fibo1EXIT >#45#return; 20670#L23-1 call #t~ret3 := fibo1(~n - 2);< 20673#fibo1ENTRY ~n := #in~n; 20692#L8 assume ~n < 1;#res := 0; 20690#fibo1FINAL assume true; 20669#fibo1EXIT >#47#return; 20667#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 20665#fibo2FINAL assume true; 20662#fibo2EXIT >#51#return; 20644#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 20643#fibo1FINAL assume true; 20640#fibo1EXIT >#45#return; 20576#L23-1 [2019-11-28 21:16:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash 138070353, now seen corresponding path program 1 times [2019-11-28 21:16:49,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:49,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872309287] [2019-11-28 21:16:49,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 78 proven. 195 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-28 21:16:49,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872309287] [2019-11-28 21:16:49,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290840221] [2019-11-28 21:16:49,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:16:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:49,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:16:49,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 209 proven. 83 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 21:16:50,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:50,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 28 [2019-11-28 21:16:50,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730323403] [2019-11-28 21:16:50,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1363160651, now seen corresponding path program 1 times [2019-11-28 21:16:50,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:50,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140295346] [2019-11-28 21:16:50,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,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 21:16:50,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140295346] [2019-11-28 21:16:50,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011567469] [2019-11-28 21:16:50,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:16:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:16:50,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:50,270 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 21:16:50,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:50,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-28 21:16:50,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528110718] [2019-11-28 21:16:50,272 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:50,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:50,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 21:16:50,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 21:16:50,273 INFO L87 Difference]: Start difference. First operand 817 states and 978 transitions. cyclomatic complexity: 168 Second operand 15 states. [2019-11-28 21:16:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:50,518 INFO L93 Difference]: Finished difference Result 1073 states and 1334 transitions. [2019-11-28 21:16:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:16:50,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1334 transitions. [2019-11-28 21:16:50,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 21:16:50,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 950 states and 1170 transitions. [2019-11-28 21:16:50,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-28 21:16:50,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-28 21:16:50,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 950 states and 1170 transitions. [2019-11-28 21:16:50,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:50,537 INFO L688 BuchiCegarLoop]: Abstraction has 950 states and 1170 transitions. [2019-11-28 21:16:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1170 transitions. [2019-11-28 21:16:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 875. [2019-11-28 21:16:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-11-28 21:16:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1050 transitions. [2019-11-28 21:16:50,561 INFO L711 BuchiCegarLoop]: Abstraction has 875 states and 1050 transitions. [2019-11-28 21:16:50,561 INFO L591 BuchiCegarLoop]: Abstraction has 875 states and 1050 transitions. [2019-11-28 21:16:50,562 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 21:16:50,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 875 states and 1050 transitions. [2019-11-28 21:16:50,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 21:16:50,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:50,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:50,571 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1] [2019-11-28 21:16:50,571 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 21:16:50,571 INFO L794 eck$LassoCheckResult]: Stem: 23386#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 23349#L37 call main_#t~ret4 := fibo1(main_~x~0);< 23350#fibo1ENTRY ~n := #in~n; 23494#L8 assume !(~n < 1); 23491#L10 assume !(1 == ~n); 23473#L13 call #t~ret0 := fibo2(~n - 1);< 23486#fibo2ENTRY ~n := #in~n; 23481#L18 assume !(~n < 1); 23477#L20 assume !(1 == ~n); 23421#L23 call #t~ret2 := fibo1(~n - 1);< 23468#fibo1ENTRY ~n := #in~n; 23457#L8 assume !(~n < 1); 23435#L10 assume !(1 == ~n); 23429#L13 call #t~ret0 := fibo2(~n - 1);< 23454#fibo2ENTRY ~n := #in~n; 23479#L18 assume !(~n < 1); 23475#L20 assume !(1 == ~n); 23470#L23 call #t~ret2 := fibo1(~n - 1);< 23471#fibo1ENTRY ~n := #in~n; 23492#L8 assume !(~n < 1); 23489#L10 assume !(1 == ~n); 23326#L13 call #t~ret0 := fibo2(~n - 1);< 23488#fibo2ENTRY ~n := #in~n; 23405#L18 assume !(~n < 1); 23403#L20 assume !(1 == ~n); 23404#L23 call #t~ret2 := fibo1(~n - 1);< 23680#fibo1ENTRY ~n := #in~n; 23681#L8 assume !(~n < 1); 23729#L10 assume !(1 == ~n); 23725#L13 call #t~ret0 := fibo2(~n - 1);< 23726#fibo2ENTRY ~n := #in~n; 23731#L18 assume !(~n < 1); 23730#L20 assume 1 == ~n;#res := 1; 23728#fibo2FINAL assume true; 23724#fibo2EXIT >#49#return; 23721#L13-1 call #t~ret1 := fibo2(~n - 2);< 23722#fibo2ENTRY ~n := #in~n; 23727#L18 assume ~n < 1;#res := 0; 23723#fibo2FINAL assume true; 23720#fibo2EXIT >#51#return; 23719#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 23717#fibo1FINAL assume true; 23713#fibo1EXIT >#45#return; 23708#L23-1 call #t~ret3 := fibo1(~n - 2);< 23711#fibo1ENTRY ~n := #in~n; 23772#L8 assume !(~n < 1); 23769#L10 assume 1 == ~n;#res := 1; 23768#fibo1FINAL assume true; 23707#fibo1EXIT >#47#return; 23709#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 23657#fibo2FINAL assume true; 23487#fibo2EXIT >#49#return; 23392#L13-1 call #t~ret1 := fibo2(~n - 2);< 23388#fibo2ENTRY ~n := #in~n; 23390#L18 assume ~n < 1;#res := 0; 23400#fibo2FINAL assume true; 23891#fibo2EXIT >#51#return; 23478#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 23474#fibo1FINAL assume true; 23469#fibo1EXIT >#45#return; 23459#L23-1 call #t~ret3 := fibo1(~n - 2);< 23466#fibo1ENTRY ~n := #in~n; 23831#L8 assume !(~n < 1); 23829#L10 assume !(1 == ~n); 23395#L13 call #t~ret0 := fibo2(~n - 1);< 23828#fibo2ENTRY ~n := #in~n; 23819#L18 assume !(~n < 1); 23814#L20 assume 1 == ~n;#res := 1; 23815#fibo2FINAL assume true; 24190#fibo2EXIT >#49#return; 23798#L13-1 call #t~ret1 := fibo2(~n - 2);< 23799#fibo2ENTRY ~n := #in~n; 24183#L18 assume ~n < 1;#res := 0; 24181#fibo2FINAL assume true; 24182#fibo2EXIT >#51#return; 23796#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 23795#fibo1FINAL assume true; 23458#fibo1EXIT >#47#return; 23456#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 23428#fibo2FINAL assume true; 23430#fibo2EXIT >#49#return; 23415#L13-1 call #t~ret1 := fibo2(~n - 2);< 23422#fibo2ENTRY ~n := #in~n; 23414#L18 assume !(~n < 1); 23416#L20 assume !(1 == ~n); 23379#L23 call #t~ret2 := fibo1(~n - 1);< 23529#fibo1ENTRY ~n := #in~n; 23591#L8 assume !(~n < 1); 23588#L10 assume !(1 == ~n); 23584#L13 call #t~ret0 := fibo2(~n - 1);< 23587#fibo2ENTRY ~n := #in~n; 23701#L18 assume !(~n < 1); 23698#L20 assume !(1 == ~n); 23699#L23 call #t~ret2 := fibo1(~n - 1);< 23753#fibo1ENTRY ~n := #in~n; 23760#L8 assume !(~n < 1); 23759#L10 assume 1 == ~n;#res := 1; 23758#fibo1FINAL assume true; 23749#fibo1EXIT >#45#return; 23743#L23-1 call #t~ret3 := fibo1(~n - 2);< 23746#fibo1ENTRY ~n := #in~n; 23755#L8 assume ~n < 1;#res := 0; 23747#fibo1FINAL assume true; 23740#fibo1EXIT >#47#return; 23739#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 23738#fibo2FINAL assume true; 23737#fibo2EXIT >#49#return; 23580#L13-1 call #t~ret1 := fibo2(~n - 2);< 23582#fibo2ENTRY ~n := #in~n; 23862#L18 assume ~n < 1;#res := 0; 23732#fibo2FINAL assume true; 23579#fibo2EXIT >#51#return; 23378#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 23382#fibo1FINAL assume true; 23524#fibo1EXIT >#45#return; 23508#L23-1 [2019-11-28 21:16:50,572 INFO L796 eck$LassoCheckResult]: Loop: 23508#L23-1 call #t~ret3 := fibo1(~n - 2);< 23514#fibo1ENTRY ~n := #in~n; 23645#L8 assume !(~n < 1); 23646#L10 assume !(1 == ~n); 23505#L13 call #t~ret0 := fibo2(~n - 1);< 23509#fibo2ENTRY ~n := #in~n; 23541#L18 assume !(~n < 1); 23537#L20 assume !(1 == ~n); 23362#L23 call #t~ret2 := fibo1(~n - 1);< 23526#fibo1ENTRY ~n := #in~n; 23706#L8 assume !(~n < 1); 23705#L10 assume !(1 == ~n); 23352#L13 call #t~ret0 := fibo2(~n - 1);< 23822#fibo2ENTRY ~n := #in~n; 23820#L18 assume !(~n < 1); 23810#L20 assume !(1 == ~n); 23661#L23 call #t~ret2 := fibo1(~n - 1);< 23668#fibo1ENTRY ~n := #in~n; 23666#L8 assume !(~n < 1); 23664#L10 assume !(1 == ~n); 23658#L13 call #t~ret0 := fibo2(~n - 1);< 23662#fibo2ENTRY ~n := #in~n; 23718#L18 assume !(~n < 1); 23714#L20 assume 1 == ~n;#res := 1; 23715#fibo2FINAL assume true; 23860#fibo2EXIT >#49#return; 23857#L13-1 call #t~ret1 := fibo2(~n - 2);< 23858#fibo2ENTRY ~n := #in~n; 23861#L18 assume ~n < 1;#res := 0; 23859#fibo2FINAL assume true; 23856#fibo2EXIT >#51#return; 23855#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 23853#fibo1FINAL assume true; 23851#fibo1EXIT >#45#return; 23846#L23-1 call #t~ret3 := fibo1(~n - 2);< 23849#fibo1ENTRY ~n := #in~n; 23854#L8 assume !(~n < 1); 23852#L10 assume 1 == ~n;#res := 1; 23850#fibo1FINAL assume true; 23845#fibo1EXIT >#47#return; 23465#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 23801#fibo2FINAL assume true; 23802#fibo2EXIT >#49#return; 23332#L13-1 call #t~ret1 := fibo2(~n - 2);< 23375#fibo2ENTRY ~n := #in~n; 23387#L18 assume ~n < 1;#res := 0; 23331#fibo2FINAL assume true; 23334#fibo2EXIT >#51#return; 23578#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 23690#fibo1FINAL assume true; 23523#fibo1EXIT >#45#return; 23508#L23-1 [2019-11-28 21:16:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:50,572 INFO L82 PathProgramCache]: Analyzing trace with hash 138070353, now seen corresponding path program 2 times [2019-11-28 21:16:50,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:50,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595573806] [2019-11-28 21:16:50,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 78 proven. 195 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-28 21:16:50,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595573806] [2019-11-28 21:16:50,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343522237] [2019-11-28 21:16:50,983 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:16:51,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:16:51,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:16:51,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 21:16:51,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 209 proven. 83 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 21:16:51,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:51,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 28 [2019-11-28 21:16:51,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037566060] [2019-11-28 21:16:51,100 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:51,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1742532038, now seen corresponding path program 2 times [2019-11-28 21:16:51,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:51,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610553692] [2019-11-28 21:16:51,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 21:16:51,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610553692] [2019-11-28 21:16:51,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838358178] [2019-11-28 21:16:51,210 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:16:51,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:16:51,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:16:51,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:16:51,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-28 21:16:51,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:51,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2019-11-28 21:16:51,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6544948] [2019-11-28 21:16:51,321 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:16:51,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 21:16:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-28 21:16:51,322 INFO L87 Difference]: Start difference. First operand 875 states and 1050 transitions. cyclomatic complexity: 182 Second operand 15 states. [2019-11-28 21:16:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:51,520 INFO L93 Difference]: Finished difference Result 929 states and 1127 transitions. [2019-11-28 21:16:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 21:16:51,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 929 states and 1127 transitions. [2019-11-28 21:16:51,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 21:16:51,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 929 states to 929 states and 1127 transitions. [2019-11-28 21:16:51,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2019-11-28 21:16:51,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-28 21:16:51,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 929 states and 1127 transitions. [2019-11-28 21:16:51,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:16:51,537 INFO L688 BuchiCegarLoop]: Abstraction has 929 states and 1127 transitions. [2019-11-28 21:16:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states and 1127 transitions. [2019-11-28 21:16:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 888. [2019-11-28 21:16:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-28 21:16:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1057 transitions. [2019-11-28 21:16:51,561 INFO L711 BuchiCegarLoop]: Abstraction has 888 states and 1057 transitions. [2019-11-28 21:16:51,561 INFO L591 BuchiCegarLoop]: Abstraction has 888 states and 1057 transitions. [2019-11-28 21:16:51,561 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 21:16:51,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 888 states and 1057 transitions. [2019-11-28 21:16:51,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 21:16:51,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:16:51,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:16:51,569 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 8, 8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2019-11-28 21:16:51,569 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 21:16:51,570 INFO L794 eck$LassoCheckResult]: Stem: 26087#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 26040#L37 call main_#t~ret4 := fibo1(main_~x~0);< 26041#fibo1ENTRY ~n := #in~n; 26202#L8 assume !(~n < 1); 26199#L10 assume !(1 == ~n); 26174#L13 call #t~ret0 := fibo2(~n - 1);< 26187#fibo2ENTRY ~n := #in~n; 26183#L18 assume !(~n < 1); 26179#L20 assume !(1 == ~n); 26130#L23 call #t~ret2 := fibo1(~n - 1);< 26156#fibo1ENTRY ~n := #in~n; 26157#L8 assume !(~n < 1); 26141#L10 assume !(1 == ~n); 26138#L13 call #t~ret0 := fibo2(~n - 1);< 26162#fibo2ENTRY ~n := #in~n; 26185#L18 assume !(~n < 1); 26181#L20 assume !(1 == ~n); 26176#L23 call #t~ret2 := fibo1(~n - 1);< 26177#fibo1ENTRY ~n := #in~n; 26203#L8 assume !(~n < 1); 26200#L10 assume !(1 == ~n); 26197#L13 call #t~ret0 := fibo2(~n - 1);< 26198#fibo2ENTRY ~n := #in~n; 26433#L18 assume !(~n < 1); 26432#L20 assume !(1 == ~n); 26097#L23 call #t~ret2 := fibo1(~n - 1);< 26478#fibo1ENTRY ~n := #in~n; 26096#L8 assume !(~n < 1); 26098#L10 assume !(1 == ~n); 26489#L13 call #t~ret0 := fibo2(~n - 1);< 26490#fibo2ENTRY ~n := #in~n; 26493#L18 assume !(~n < 1); 26492#L20 assume 1 == ~n;#res := 1; 26491#fibo2FINAL assume true; 26488#fibo2EXIT >#49#return; 26486#L13-1 call #t~ret1 := fibo2(~n - 2);< 26487#fibo2ENTRY ~n := #in~n; 26495#L18 assume ~n < 1;#res := 0; 26494#fibo2FINAL assume true; 26485#fibo2EXIT >#51#return; 26484#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26483#fibo1FINAL assume true; 26480#fibo1EXIT >#45#return; 26395#L23-1 call #t~ret3 := fibo1(~n - 2);< 26396#fibo1ENTRY ~n := #in~n; 26482#L8 assume !(~n < 1); 26481#L10 assume 1 == ~n;#res := 1; 26479#fibo1FINAL assume true; 26394#fibo1EXIT >#47#return; 26392#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 26391#fibo2FINAL assume true; 26195#fibo2EXIT >#49#return; 26190#L13-1 call #t~ret1 := fibo2(~n - 2);< 26193#fibo2ENTRY ~n := #in~n; 26541#L18 assume !(~n < 1); 26540#L20 assume 1 == ~n;#res := 1; 26538#fibo2FINAL assume true; 26537#fibo2EXIT >#51#return; 26184#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26180#fibo1FINAL assume true; 26175#fibo1EXIT >#45#return; 26167#L23-1 call #t~ret3 := fibo1(~n - 2);< 26172#fibo1ENTRY ~n := #in~n; 26502#L8 assume !(~n < 1); 26501#L10 assume !(1 == ~n); 26361#L13 call #t~ret0 := fibo2(~n - 1);< 26500#fibo2ENTRY ~n := #in~n; 26499#L18 assume !(~n < 1); 26496#L20 assume 1 == ~n;#res := 1; 26497#fibo2FINAL assume true; 26801#fibo2EXIT >#49#return; 26630#L13-1 call #t~ret1 := fibo2(~n - 2);< 26631#fibo2ENTRY ~n := #in~n; 26785#L18 assume ~n < 1;#res := 0; 26783#fibo2FINAL assume true; 26784#fibo2EXIT >#51#return; 26627#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26360#fibo1FINAL assume true; 26164#fibo1EXIT >#47#return; 26163#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 26137#fibo2FINAL assume true; 26139#fibo2EXIT >#49#return; 26124#L13-1 call #t~ret1 := fibo2(~n - 2);< 26131#fibo2ENTRY ~n := #in~n; 26123#L18 assume !(~n < 1); 26125#L20 assume !(1 == ~n); 26228#L23 call #t~ret2 := fibo1(~n - 1);< 26233#fibo1ENTRY ~n := #in~n; 26295#L8 assume !(~n < 1); 26293#L10 assume !(1 == ~n); 26288#L13 call #t~ret0 := fibo2(~n - 1);< 26291#fibo2ENTRY ~n := #in~n; 26531#L18 assume !(~n < 1); 26526#L20 assume !(1 == ~n); 26517#L23 call #t~ret2 := fibo1(~n - 1);< 26036#fibo1ENTRY ~n := #in~n; 26529#L8 assume !(~n < 1); 26528#L10 assume 1 == ~n;#res := 1; 26521#fibo1FINAL assume true; 26516#fibo1EXIT >#45#return; 26510#L23-1 call #t~ret3 := fibo1(~n - 2);< 26513#fibo1ENTRY ~n := #in~n; 26520#L8 assume ~n < 1;#res := 0; 26514#fibo1FINAL assume true; 26507#fibo1EXIT >#47#return; 26506#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 26505#fibo2FINAL assume true; 26504#fibo2EXIT >#49#return; 26282#L13-1 call #t~ret1 := fibo2(~n - 2);< 26286#fibo2ENTRY ~n := #in~n; 26310#L18 assume ~n < 1;#res := 0; 26311#fibo2FINAL assume true; 26539#fibo2EXIT >#51#return; 26285#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26503#fibo1FINAL assume true; 26227#fibo1EXIT >#45#return; 26077#L23-1 [2019-11-28 21:16:51,570 INFO L796 eck$LassoCheckResult]: Loop: 26077#L23-1 call #t~ret3 := fibo1(~n - 2);< 26223#fibo1ENTRY ~n := #in~n; 26304#L8 assume !(~n < 1); 26301#L10 assume !(1 == ~n); 26214#L13 call #t~ret0 := fibo2(~n - 1);< 26218#fibo2ENTRY ~n := #in~n; 26247#L18 assume !(~n < 1); 26243#L20 assume !(1 == ~n); 26069#L23 call #t~ret2 := fibo1(~n - 1);< 26230#fibo1ENTRY ~n := #in~n; 26406#L8 assume !(~n < 1); 26405#L10 assume !(1 == ~n); 26402#L13 call #t~ret0 := fibo2(~n - 1);< 26403#fibo2ENTRY ~n := #in~n; 26431#L18 assume !(~n < 1); 26426#L20 assume !(1 == ~n); 26380#L23 call #t~ret2 := fibo1(~n - 1);< 26422#fibo1ENTRY ~n := #in~n; 26476#L8 assume !(~n < 1); 26473#L10 assume !(1 == ~n); 26387#L13 call #t~ret0 := fibo2(~n - 1);< 26389#fibo2ENTRY ~n := #in~n; 26457#L18 assume !(~n < 1); 26454#L20 assume 1 == ~n;#res := 1; 26455#fibo2FINAL assume true; 26469#fibo2EXIT >#49#return; 26466#L13-1 call #t~ret1 := fibo2(~n - 2);< 26467#fibo2ENTRY ~n := #in~n; 26475#L18 assume ~n < 1;#res := 0; 26472#fibo2FINAL assume true; 26465#fibo2EXIT >#51#return; 26464#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26462#fibo1FINAL assume true; 26421#fibo1EXIT >#45#return; 26416#L23-1 call #t~ret3 := fibo1(~n - 2);< 26419#fibo1ENTRY ~n := #in~n; 26451#L8 assume !(~n < 1); 26450#L10 assume 1 == ~n;#res := 1; 26448#fibo1FINAL assume true; 26414#fibo1EXIT >#47#return; 26171#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 26413#fibo2FINAL assume true; 26401#fibo2EXIT >#49#return; 26049#L13-1 call #t~ret1 := fibo2(~n - 2);< 26254#fibo2ENTRY ~n := #in~n; 26397#L18 assume !(~n < 1); 26109#L20 assume !(1 == ~n); 26043#L23 call #t~ret2 := fibo1(~n - 1);< 26088#fibo1ENTRY ~n := #in~n; 26089#L8 assume !(~n < 1); 26042#L10 assume 1 == ~n;#res := 1; 26044#fibo1FINAL assume true; 26066#fibo1EXIT >#45#return; 26048#L23-1 call #t~ret3 := fibo1(~n - 2);< 26051#fibo1ENTRY ~n := #in~n; 26378#L8 assume ~n < 1;#res := 0; 26377#fibo1FINAL assume true; 26372#fibo1EXIT >#47#return; 26371#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 26369#fibo2FINAL assume true; 26253#fibo2EXIT >#51#return; 26246#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26242#fibo1FINAL assume true; 26229#fibo1EXIT >#45#return; 26077#L23-1 [2019-11-28 21:16:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash -490397511, now seen corresponding path program 3 times [2019-11-28 21:16:51,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:51,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042832248] [2019-11-28 21:16:51,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 80 proven. 196 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-28 21:16:51,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042832248] [2019-11-28 21:16:51,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655618413] [2019-11-28 21:16:51,961 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:16:52,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 21:16:52,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:16:52,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:16:52,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-11-28 21:16:52,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:16:52,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 30 [2019-11-28 21:16:52,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806832304] [2019-11-28 21:16:52,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:16:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash -550247555, now seen corresponding path program 1 times [2019-11-28 21:16:52,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:16:52,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315843249] [2019-11-28 21:16:52,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:16:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:16:52,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:16:52,838 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:52,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:52,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:52,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:52,838 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:16:52,839 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:52,839 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:52,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:52,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration13_Loop [2019-11-28 21:16:52,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:52,839 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:52,840 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 21:16:52,843 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 21:16:52,845 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 21:16:52,847 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 21:16:52,853 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 21:16:52,854 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 21:16:52,856 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 21:16:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:16:52,865 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 21:16:52,936 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:52,936 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:52,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:52,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:52,945 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:52,946 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:52,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:52,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:52,953 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:52,954 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 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 21:16:52,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:52,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:52,962 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:52,962 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 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 21:16:52,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:52,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:52,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:52,977 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 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 21:16:52,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:52,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:52,989 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:52,989 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 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 21:16:52,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:52,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:52,997 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:16:52,997 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 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 21:16:53,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:16:53,002 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:16:53,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:16:53,364 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:16:53,366 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:16:53,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:16:53,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:16:53,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:16:53,366 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:16:53,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,366 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:16:53,366 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:16:53,366 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration13_Loop [2019-11-28 21:16:53,366 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:16:53,366 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:16:53,367 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 21:16:53,369 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 21:16:53,370 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 21:16:53,372 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 21:16:53,373 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 21:16:53,374 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 21:16:53,375 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 21:16:53,391 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 21:16:53,393 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 21:16:53,459 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:16:53,459 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,468 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 21:16:53,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,471 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,476 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 21:16:53,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,479 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,484 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 21:16:53,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,487 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 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,493 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 21:16:53,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,496 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 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,506 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 21:16:53,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,509 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 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,515 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 21:16:53,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,518 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 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:16:53,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:16:53,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:16:53,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:16:53,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:16:53,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:16:53,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:16:53,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:16:53,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:16:53,534 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 21:16:53,534 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:16:53,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:16:53,540 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:16:53,540 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:16:53,540 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-28 21:16:53,541 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:16:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:53,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 21:16:53,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:53,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:53,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 21:16:53,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:53,917 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 21:16:53,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-28 21:16:53,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 888 states and 1057 transitions. cyclomatic complexity: 176 Second operand 13 states. [2019-11-28 21:16:54,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 888 states and 1057 transitions. cyclomatic complexity: 176. Second operand 13 states. Result 903 states and 1072 transitions. Complement of second has 13 states. [2019-11-28 21:16:54,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 21:16:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:16:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2019-11-28 21:16:54,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 116 letters. Loop has 64 letters. [2019-11-28 21:16:54,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:54,160 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:54,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 21:16:54,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:54,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:54,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 21:16:54,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:54,653 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 21:16:54,654 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-28 21:16:54,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 888 states and 1057 transitions. cyclomatic complexity: 176 Second operand 13 states. [2019-11-28 21:16:54,925 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 888 states and 1057 transitions. cyclomatic complexity: 176. Second operand 13 states. Result 903 states and 1072 transitions. Complement of second has 13 states. [2019-11-28 21:16:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 21:16:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:16:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2019-11-28 21:16:54,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 116 letters. Loop has 64 letters. [2019-11-28 21:16:54,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:54,927 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:16:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:16:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:55,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 21:16:55,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:55,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:16:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:16:55,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 21:16:55,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:16:55,332 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 21:16:55,332 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 11 loop predicates [2019-11-28 21:16:55,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 888 states and 1057 transitions. cyclomatic complexity: 176 Second operand 13 states. [2019-11-28 21:16:55,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 888 states and 1057 transitions. cyclomatic complexity: 176. Second operand 13 states. Result 3714 states and 4286 transitions. Complement of second has 141 states. [2019-11-28 21:16:55,949 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 21:16:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:16:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2019-11-28 21:16:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 81 transitions. Stem has 116 letters. Loop has 64 letters. [2019-11-28 21:16:55,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:55,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 81 transitions. Stem has 180 letters. Loop has 64 letters. [2019-11-28 21:16:55,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:55,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 81 transitions. Stem has 116 letters. Loop has 128 letters. [2019-11-28 21:16:55,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:16:55,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3714 states and 4286 transitions. [2019-11-28 21:16:55,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:16:55,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3714 states to 0 states and 0 transitions. [2019-11-28 21:16:55,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:16:55,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:16:55,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:16:55,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:16:55,981 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:55,982 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:55,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:16:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 21:16:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-11-28 21:16:55,982 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 30 states. [2019-11-28 21:16:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:16:55,983 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 21:16:55,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:16:55,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 21:16:55,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:16:55,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 21:16:55,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:16:55,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:16:55,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:16:55,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:16:55,984 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:55,984 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:55,984 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:16:55,984 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 21:16:55,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:16:55,984 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:16:55,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:16:55,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:16:55 BoogieIcfgContainer [2019-11-28 21:16:55,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:16:55,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:16:55,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:16:55,993 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:16:55,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:16:28" (3/4) ... [2019-11-28 21:16:55,997 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:16:55,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:16:55,999 INFO L168 Benchmark]: Toolchain (without parser) took 28466.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.5 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -361.6 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:56,000 INFO L168 Benchmark]: CDTParser took 0.19 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 21:16:56,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.72 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 21:16:56,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:16:56,005 INFO L168 Benchmark]: Boogie Preprocessor took 68.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:56,005 INFO L168 Benchmark]: RCFGBuilder took 237.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:56,005 INFO L168 Benchmark]: BuchiAutomizer took 27886.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 362.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.7 MB). Peak memory consumption was 150.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:16:56,006 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:16:56,008 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.19 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 237.72 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 25.38 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 237.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27886.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 362.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.7 MB). Peak memory consumption was 150.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (12 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 14 locations. One nondeterministic module has affine ranking function n and consists of 15 locations. 12 modules have a trivial ranking function, the largest among these consists of 30 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.7s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 15.4s. Construction of modules took 3.9s. Büchi inclusion checks took 7.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 579 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 888 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 66/161 HoareTripleCheckerStatistics: 583 SDtfs, 1414 SDslu, 1895 SDs, 0 SdLazy, 4693 SolverSat, 874 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI7 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf99 lsp91 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf92 smp83 dnf100 smp100 tf109 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...