./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e21c3699338992ddad7e6d15f4351c8cc3315b0b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:26:44,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:26:44,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:26:44,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:26:44,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:26:44,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:26:44,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:26:44,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:26:44,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:26:44,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:26:44,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:26:44,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:26:44,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:26:44,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:26:44,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:26:44,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:26:44,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:26:44,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:26:44,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:26:44,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:26:44,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:26:44,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:26:44,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:26:44,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:26:44,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:26:44,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:26:44,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:26:44,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:26:44,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:26:44,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:26:44,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:26:44,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:26:44,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:26:44,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:26:44,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:26:44,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:26:44,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:26:44,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:26:44,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:26:44,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:26:44,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:26:44,702 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 18:26:44,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:26:44,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:26:44,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:26:44,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:26:44,718 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:26:44,718 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:26:44,718 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:26:44,718 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:26:44,719 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:26:44,719 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:26:44,719 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:26:44,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:26:44,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:26:44,720 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:26:44,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:26:44,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:26:44,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:26:44,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:26:44,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:26:44,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:26:44,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:26:44,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:26:44,721 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:26:44,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:26:44,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:26:44,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:26:44,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:26:44,722 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:26:44,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:26:44,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:26:44,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:26:44,723 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:26:44,724 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:26:44,724 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2019-12-07 18:26:44,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:26:44,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:26:44,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:26:44,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:26:44,841 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:26:44,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-12-07 18:26:44,880 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/data/48c9fa0bb/6744476573504352a2ee22333581a3e4/FLAG2a93a9a77 [2019-12-07 18:26:45,286 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:26:45,286 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-12-07 18:26:45,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/data/48c9fa0bb/6744476573504352a2ee22333581a3e4/FLAG2a93a9a77 [2019-12-07 18:26:45,300 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/data/48c9fa0bb/6744476573504352a2ee22333581a3e4 [2019-12-07 18:26:45,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:26:45,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:26:45,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:26:45,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:26:45,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:26:45,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9c5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45, skipping insertion in model container [2019-12-07 18:26:45,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:26:45,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:26:45,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:26:45,432 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:26:45,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:26:45,483 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:26:45,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45 WrapperNode [2019-12-07 18:26:45,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:26:45,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:26:45,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:26:45,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:26:45,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:26:45,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:26:45,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:26:45,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:26:45,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... [2019-12-07 18:26:45,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:26:45,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:26:45,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:26:45,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:26:45,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:26:45,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:26:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-12-07 18:26:45,557 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-12-07 18:26:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-12-07 18:26:45,557 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-12-07 18:26:45,655 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:26:45,656 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 18:26:45,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:26:45 BoogieIcfgContainer [2019-12-07 18:26:45,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:26:45,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:26:45,657 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:26:45,659 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:26:45,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:26:45,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:26:45" (1/3) ... [2019-12-07 18:26:45,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ecbb45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:26:45, skipping insertion in model container [2019-12-07 18:26:45,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:26:45,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:45" (2/3) ... [2019-12-07 18:26:45,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ecbb45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:26:45, skipping insertion in model container [2019-12-07 18:26:45,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:26:45,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:26:45" (3/3) ... [2019-12-07 18:26:45,662 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-2.c [2019-12-07 18:26:45,692 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:26:45,692 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:26:45,692 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:26:45,692 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:26:45,692 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:26:45,692 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:26:45,692 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:26:45,692 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:26:45,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-12-07 18:26:45,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-12-07 18:26:45,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:45,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:45,724 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:26:45,724 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:45,724 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:26:45,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-12-07 18:26:45,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-12-07 18:26:45,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:45,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:45,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 18:26:45,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:45,732 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-12-07 18:26:45,732 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-12-07 18:26:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-12-07 18:26:45,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:45,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548811017] [2019-12-07 18:26:45,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:45,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-12-07 18:26:45,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:45,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757653698] [2019-12-07 18:26:45,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:45,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-12-07 18:26:45,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:45,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034908070] [2019-12-07 18:26:45,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:45,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:45,940 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:45,941 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:45,941 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:45,941 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:45,941 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:26:45,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:45,942 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:45,942 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:45,942 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration1_Loop [2019-12-07 18:26:45,942 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:45,942 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:45,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:45,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,026 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:46,027 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,037 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,038 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,045 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,051 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,052 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,058 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,065 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,065 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,072 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,078 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,079 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,085 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,085 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,092 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:46,092 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:46,096 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:26:46,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:46,152 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:26:46,153 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:46,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:46,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:46,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:46,154 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:26:46,154 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:46,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:46,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration1_Loop [2019-12-07 18:26:46,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:46,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:46,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:46,208 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:46,212 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,216 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-12-07 18:26:46,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,227 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-12-07 18:26:46,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,235 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-12-07 18:26:46,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,243 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-12-07 18:26:46,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:46,251 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-12-07 18:26:46,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,258 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-12-07 18:26:46,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,266 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-12-07 18:26:46,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,274 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-12-07 18:26:46,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,282 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-12-07 18:26:46,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:46,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:46,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:46,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:46,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:46,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:46,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:46,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:26:46,289 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-12-07 18:26:46,289 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:26:46,294 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:26:46,294 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:26:46,295 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-12-07 18:26:46,298 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:26:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:26:46,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:26:46,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:46,399 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-12-07 18:26:46,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-12-07 18:26:46,549 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-12-07 18:26:46,550 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-12-07 18:26:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-12-07 18:26:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-12-07 18:26:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-12-07 18:26:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:46,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-12-07 18:26:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:46,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-12-07 18:26:46,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:46,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-12-07 18:26:46,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-12-07 18:26:46,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-12-07 18:26:46,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-12-07 18:26:46,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-12-07 18:26:46,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-12-07 18:26:46,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:46,570 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-12-07 18:26:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-12-07 18:26:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-12-07 18:26:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 18:26:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-12-07 18:26:46,595 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-12-07 18:26:46,595 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-12-07 18:26:46,595 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:26:46,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-12-07 18:26:46,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-12-07 18:26:46,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:46,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:46,598 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:46,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:46,598 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-12-07 18:26:46,599 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-12-07 18:26:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-12-07 18:26:46,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:46,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348654418] [2019-12-07 18:26:46,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:46,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348654418] [2019-12-07 18:26:46,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244492999] [2019-12-07 18:26:46,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:26:46,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:46,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:46,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-07 18:26:46,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743829779] [2019-12-07 18:26:46,715 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-12-07 18:26:46,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:46,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926460590] [2019-12-07 18:26:46,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:26:46,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926460590] [2019-12-07 18:26:46,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:46,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:26:46,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053026105] [2019-12-07 18:26:46,751 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:26:46,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:26:46,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:26:46,754 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-12-07 18:26:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:46,807 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-12-07 18:26:46,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:26:46,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-12-07 18:26:46,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-12-07 18:26:46,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-12-07 18:26:46,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-12-07 18:26:46,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-12-07 18:26:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-12-07 18:26:46,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:46,813 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-12-07 18:26:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-12-07 18:26:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-12-07 18:26:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 18:26:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-12-07 18:26:46,818 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-12-07 18:26:46,818 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-12-07 18:26:46,819 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:26:46,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-12-07 18:26:46,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-12-07 18:26:46,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:46,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:46,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:46,821 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:46,821 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-12-07 18:26:46,821 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-12-07 18:26:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-12-07 18:26:46,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:46,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298444036] [2019-12-07 18:26:46,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:46,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298444036] [2019-12-07 18:26:46,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474189229] [2019-12-07 18:26:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:46,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:26:46,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:46,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:46,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-07 18:26:46,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357193073] [2019-12-07 18:26:46,905 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-12-07 18:26:46,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:46,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984663170] [2019-12-07 18:26:46,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:46,915 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:47,006 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:47,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:47,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:47,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:47,006 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:26:47,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:47,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:47,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:47,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration3_Loop [2019-12-07 18:26:47,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:47,007 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:47,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:47,058 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:47,058 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:47,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:47,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:47,064 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:47,065 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:47,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:47,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:47,072 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:47,072 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:47,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:47,076 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:47,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:26:47,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:47,993 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:26:47,996 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:47,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:47,996 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:47,996 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:47,996 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:26:47,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:47,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:47,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:47,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration3_Loop [2019-12-07 18:26:47,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:47,997 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:47,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:48,040 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:48,041 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:48,044 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-12-07 18:26:48,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:48,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:48,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:48,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:48,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:48,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:48,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:48,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:48,052 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-12-07 18:26:48,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:48,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:48,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:48,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:48,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:48,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:48,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:48,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:48,059 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-12-07 18:26:48,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:48,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:48,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:48,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:48,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:48,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:48,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:48,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:26:48,065 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-12-07 18:26:48,065 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:48,067 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:26:48,067 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:26:48,068 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:26:48,068 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-12-07 18:26:48,069 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:26:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:26:48,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:26:48,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:48,173 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-12-07 18:26:48,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-12-07 18:26:48,386 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-12-07 18:26:48,387 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-12-07 18:26:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 18:26:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-12-07 18:26:48,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-12-07 18:26:48,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:48,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-12-07 18:26:48,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:48,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-12-07 18:26:48,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:48,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-12-07 18:26:48,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 18:26:48,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-12-07 18:26:48,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-12-07 18:26:48,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-12-07 18:26:48,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-12-07 18:26:48,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:48,400 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-12-07 18:26:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-12-07 18:26:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-12-07 18:26:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 18:26:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-12-07 18:26:48,412 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-12-07 18:26:48,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:26:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:26:48,413 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-12-07 18:26:48,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:48,503 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-12-07 18:26:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:26:48,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-12-07 18:26:48,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 18:26:48,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-12-07 18:26:48,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-12-07 18:26:48,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-12-07 18:26:48,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-12-07 18:26:48,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:48,514 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-12-07 18:26:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-12-07 18:26:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-12-07 18:26:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 18:26:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-12-07 18:26:48,524 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-12-07 18:26:48,524 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-12-07 18:26:48,524 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:26:48,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-12-07 18:26:48,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 18:26:48,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:48,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:48,529 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-12-07 18:26:48,529 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-12-07 18:26:48,530 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-12-07 18:26:48,530 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~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-12-07 18:26:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-12-07 18:26:48,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:48,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483575610] [2019-12-07 18:26:48,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 89 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 18:26:48,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483575610] [2019-12-07 18:26:48,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967910835] [2019-12-07 18:26:48,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:26:48,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 18:26:48,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:48,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-12-07 18:26:48,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869724267] [2019-12-07 18:26:48,822 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-12-07 18:26:48,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:48,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166270089] [2019-12-07 18:26:48,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 18:26:48,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166270089] [2019-12-07 18:26:48,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061432003] [2019-12-07 18:26:48,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:48,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:26:48,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:26:48,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:26:48,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-12-07 18:26:48,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990098127] [2019-12-07 18:26:48,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:26:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:26:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:26:48,954 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-12-07 18:26:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:48,991 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-12-07 18:26:48,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:26:48,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-12-07 18:26:48,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 18:26:48,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-12-07 18:26:48,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-12-07 18:26:48,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-12-07 18:26:48,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-12-07 18:26:48,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:48,999 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-12-07 18:26:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-12-07 18:26:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-12-07 18:26:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 18:26:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-12-07 18:26:49,010 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-12-07 18:26:49,010 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-12-07 18:26:49,010 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 18:26:49,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-12-07 18:26:49,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 18:26:49,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:49,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:49,014 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-12-07 18:26:49,015 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-12-07 18:26:49,015 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-12-07 18:26:49,015 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~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-12-07 18:26:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-12-07 18:26:49,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:49,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988779686] [2019-12-07 18:26:49,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-12-07 18:26:49,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988779686] [2019-12-07 18:26:49,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227356908] [2019-12-07 18:26:49,220 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:49,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:26:49,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:26:49,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:26:49,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 18:26:49,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:49,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-12-07 18:26:49,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282288294] [2019-12-07 18:26:49,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-12-07 18:26:49,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:49,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945343467] [2019-12-07 18:26:49,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:26:49,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945343467] [2019-12-07 18:26:49,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366387143] [2019-12-07 18:26:49,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,418 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:26:49,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 18:26:49,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:49,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-12-07 18:26:49,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981351216] [2019-12-07 18:26:49,464 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:26:49,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:49,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:26:49,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:26:49,465 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-12-07 18:26:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:49,637 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-12-07 18:26:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:26:49,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-12-07 18:26:49,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-12-07 18:26:49,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-12-07 18:26:49,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-12-07 18:26:49,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-12-07 18:26:49,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-12-07 18:26:49,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:49,643 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-12-07 18:26:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-12-07 18:26:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-12-07 18:26:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 18:26:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-12-07 18:26:49,649 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-12-07 18:26:49,650 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-12-07 18:26:49,650 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 18:26:49,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-12-07 18:26:49,651 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-12-07 18:26:49,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:49,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:49,652 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-12-07 18:26:49,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:49,652 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-12-07 18:26:49,652 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-12-07 18:26:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-12-07 18:26:49,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:49,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533886308] [2019-12-07 18:26:49,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:26:49,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533886308] [2019-12-07 18:26:49,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431683081] [2019-12-07 18:26:49,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:49,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:26:49,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:26:49,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:49,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-12-07 18:26:49,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460304634] [2019-12-07 18:26:49,841 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-12-07 18:26:49,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:49,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233305843] [2019-12-07 18:26:49,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:49,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:49,929 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:49,929 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:49,929 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:49,929 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:49,929 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:26:49,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:49,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:49,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:49,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration6_Loop [2019-12-07 18:26:49,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:49,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:49,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,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-12-07 18:26:49,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-12-07 18:26:49,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:49,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:49,976 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:49,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:49,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:49,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:49,982 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:49,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:49,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:49,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:49,990 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:49,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:49,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:49,998 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:49,998 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:50,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:50,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:50,005 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:50,005 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:50,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:50,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:50,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:50,011 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:50,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:50,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:50,019 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:50,019 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:50,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:50,023 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:50,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:26:50,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:51,015 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:26:51,017 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:51,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:51,017 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:51,017 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:51,017 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:26:51,017 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:51,017 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:51,017 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:51,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration6_Loop [2019-12-07 18:26:51,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:51,017 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:51,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:51,060 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:51,060 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:51,063 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-12-07 18:26:51,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:51,070 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-12-07 18:26:51,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:51,077 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-12-07 18:26:51,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:51,085 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-12-07 18:26:51,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:51,092 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-12-07 18:26:51,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:51,098 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-12-07 18:26:51,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:51,106 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-12-07 18:26:51,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:51,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:51,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:51,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:51,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:51,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:51,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:51,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:26:51,113 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 18:26:51,113 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:51,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:26:51,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:26:51,116 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:26:51,116 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-12-07 18:26:51,117 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:26:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:51,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:51,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:51,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:26:51,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:51,215 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-12-07 18:26:51,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-12-07 18:26:51,294 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-12-07 18:26:51,295 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-12-07 18:26:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 18:26:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-12-07 18:26:51,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-12-07 18:26:51,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:51,296 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:26:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,324 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:51,325 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:51,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:26:51,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:51,383 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-12-07 18:26:51,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-12-07 18:26:51,486 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-12-07 18:26:51,486 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-12-07 18:26:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 18:26:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-12-07 18:26:51,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-12-07 18:26:51,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:51,487 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:26:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:51,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:51,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:51,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:26:51,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:51,571 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-12-07 18:26:51,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-12-07 18:26:51,663 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-12-07 18:26:51,664 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-12-07 18:26:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 18:26:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-12-07 18:26:51,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-12-07 18:26:51,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:51,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-12-07 18:26:51,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:51,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-12-07 18:26:51,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:51,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-12-07 18:26:51,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-12-07 18:26:51,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-12-07 18:26:51,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-12-07 18:26:51,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-12-07 18:26:51,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-12-07 18:26:51,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:51,674 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-12-07 18:26:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-12-07 18:26:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-12-07 18:26:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-12-07 18:26:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-12-07 18:26:51,682 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-12-07 18:26:51,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:51,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:26:51,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:26:51,683 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-12-07 18:26:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:51,890 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-12-07 18:26:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:26:51,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-12-07 18:26:51,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-12-07 18:26:51,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-12-07 18:26:51,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-12-07 18:26:51,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-12-07 18:26:51,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-12-07 18:26:51,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:51,894 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-12-07 18:26:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-12-07 18:26:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-12-07 18:26:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 18:26:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-12-07 18:26:51,898 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-12-07 18:26:51,898 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-12-07 18:26:51,898 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 18:26:51,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-12-07 18:26:51,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-12-07 18:26:51,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:51,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:51,899 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-12-07 18:26:51,899 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-12-07 18:26:51,900 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~ret2;havoc #t~ret3; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-12-07 18:26:51,900 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~ret2;havoc #t~ret3; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-12-07 18:26:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-12-07 18:26:51,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:51,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407786547] [2019-12-07 18:26:51,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:51,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407786547] [2019-12-07 18:26:51,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278706588] [2019-12-07 18:26:51,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:52,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:26:52,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:26:52,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:52,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-12-07 18:26:52,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516841191] [2019-12-07 18:26:52,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-12-07 18:26:52,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:52,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464343406] [2019-12-07 18:26:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:52,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:52,221 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:52,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:52,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:52,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:52,222 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:26:52,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:52,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:52,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:52,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration7_Loop [2019-12-07 18:26:52,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:52,222 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:52,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-12-07 18:26:52,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,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-12-07 18:26:52,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:52,261 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:52,261 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:52,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:52,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:52,266 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:52,267 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:52,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:52,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:52,273 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:52,273 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:52,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:52,277 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:52,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:26:52,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:53,019 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:26:53,021 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:53,021 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:53,021 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:53,021 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:53,021 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:26:53,021 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:53,021 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:53,021 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:53,021 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration7_Loop [2019-12-07 18:26:53,021 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:53,021 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:53,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:53,061 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:53,061 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:53,063 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-12-07 18:26:53,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:53,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:53,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:53,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:53,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:53,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:53,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:53,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:53,070 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-12-07 18:26:53,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:53,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:53,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:53,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:53,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:53,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:53,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:53,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:53,077 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-12-07 18:26:53,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:53,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:53,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:53,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:53,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:53,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:53,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:53,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:26:53,083 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-12-07 18:26:53,083 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:53,086 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:26:53,086 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:26:53,086 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:26:53,086 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-12-07 18:26:53,087 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:26:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:26:53,209 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-12-07 18:26:53,209 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-12-07 18:26:53,444 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-12-07 18:26:53,445 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-12-07 18:26:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 18:26:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-12-07 18:26:53,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-12-07 18:26:53,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:53,446 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:26:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:26:53,566 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-12-07 18:26:53,566 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-12-07 18:26:53,732 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-12-07 18:26:53,732 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-12-07 18:26:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 18:26:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-12-07 18:26:53,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-12-07 18:26:53,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:53,733 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:26:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:53,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:26:53,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:26:53,854 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-12-07 18:26:53,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-12-07 18:26:54,143 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-12-07 18:26:54,144 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-12-07 18:26:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 18:26:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-12-07 18:26:54,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-12-07 18:26:54,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:54,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-12-07 18:26:54,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:54,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-12-07 18:26:54,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:54,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-12-07 18:26:54,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-12-07 18:26:54,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-12-07 18:26:54,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-12-07 18:26:54,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-12-07 18:26:54,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-12-07 18:26:54,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:54,160 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-12-07 18:26:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-12-07 18:26:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-12-07 18:26:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 18:26:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-12-07 18:26:54,173 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-12-07 18:26:54,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:26:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:26:54,173 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-12-07 18:26:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:54,409 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-12-07 18:26:54,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:26:54,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-12-07 18:26:54,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:54,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-12-07 18:26:54,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-12-07 18:26:54,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-12-07 18:26:54,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-12-07 18:26:54,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:54,418 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-12-07 18:26:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-12-07 18:26:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-12-07 18:26:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 18:26:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-12-07 18:26:54,427 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-12-07 18:26:54,428 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-12-07 18:26:54,428 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 18:26:54,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-12-07 18:26:54,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:54,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:54,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:54,433 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-12-07 18:26:54,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [48, 47, 34, 33, 28, 24, 24, 24, 24, 24, 23, 23, 20, 17, 17, 17, 17, 16, 16, 11, 10] [2019-12-07 18:26:54,433 INFO L794 eck$LassoCheckResult]: Stem: 8596#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8562#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8563#fibo1ENTRY ~n := #in~n; 8643#L8 assume !(~n < 1); 8642#L10 assume !(1 == ~n); 8638#L13 call #t~ret0 := fibo2(~n - 1);< 8641#fibo2ENTRY ~n := #in~n; 8640#L18 assume !(~n < 1); 8639#L20 assume !(1 == ~n); 8634#L23 call #t~ret2 := fibo1(~n - 1);< 8636#fibo1ENTRY ~n := #in~n; 8637#L8 assume !(~n < 1); 8633#L10 assume !(1 == ~n); 8620#L13 call #t~ret0 := fibo2(~n - 1);< 8625#fibo2ENTRY ~n := #in~n; 8624#L18 assume !(~n < 1); 8622#L20 assume !(1 == ~n); 8571#L23 call #t~ret2 := fibo1(~n - 1);< 8613#fibo1ENTRY ~n := #in~n; 8614#L8 assume !(~n < 1); 8635#L10 assume !(1 == ~n); 8621#L13 call #t~ret0 := fibo2(~n - 1);< 8625#fibo2ENTRY ~n := #in~n; 8624#L18 assume !(~n < 1); 8622#L20 assume !(1 == ~n); 8571#L23 call #t~ret2 := fibo1(~n - 1);< 8613#fibo1ENTRY ~n := #in~n; 8612#L8 assume !(~n < 1); 8611#L10 assume !(1 == ~n); 8570#L13 call #t~ret0 := fibo2(~n - 1);< 8572#fibo2ENTRY ~n := #in~n; 8810#L18 assume !(~n < 1); 8808#L20 assume 1 == ~n;#res := 1; 8806#fibo2FINAL assume true; 8805#fibo2EXIT >#49#return; 8803#L13-1 call #t~ret1 := fibo2(~n - 2);< 8804#fibo2ENTRY ~n := #in~n; 8809#L18 assume ~n < 1;#res := 0; 8807#fibo2FINAL assume true; 8802#fibo2EXIT >#51#return; 8801#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8799#fibo1FINAL assume true; 8795#fibo1EXIT >#45#return; 8792#L23-1 call #t~ret3 := fibo1(~n - 2);< 8793#fibo1ENTRY ~n := #in~n; 8831#L8 assume ~n < 1;#res := 0; 8830#fibo1FINAL assume true; 8791#fibo1EXIT >#47#return; 8780#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8775#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8627#L13-1 [2019-12-07 18:26:54,434 INFO L796 eck$LassoCheckResult]: Loop: 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume 1 == ~n;#res := 1; 8700#fibo1FINAL assume true; 8710#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 [2019-12-07 18:26:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-12-07 18:26:54,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:54,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964514929] [2019-12-07 18:26:54,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 18:26:54,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964514929] [2019-12-07 18:26:54,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834339069] [2019-12-07 18:26:54,558 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:54,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:26:54,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:26:54,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:54,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:54,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:54,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-12-07 18:26:54,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669961380] [2019-12-07 18:26:54,615 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1098821556, now seen corresponding path program 1 times [2019-12-07 18:26:54,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:54,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743499965] [2019-12-07 18:26:54,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8447 backedges. 115 proven. 622 refuted. 0 times theorem prover too weak. 7710 trivial. 0 not checked. [2019-12-07 18:26:55,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743499965] [2019-12-07 18:26:55,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404139004] [2019-12-07 18:26:55,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:55,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:26:55,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8447 backedges. 996 proven. 3 refuted. 0 times theorem prover too weak. 7448 trivial. 0 not checked. [2019-12-07 18:26:55,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:55,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-12-07 18:26:55,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829159430] [2019-12-07 18:26:55,785 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:26:55,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:55,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 18:26:55,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:26:55,785 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-12-07 18:26:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:56,105 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-12-07 18:26:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:26:56,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-12-07 18:26:56,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:56,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-12-07 18:26:56,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-12-07 18:26:56,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-12-07 18:26:56,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-12-07 18:26:56,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:56,115 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-12-07 18:26:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-12-07 18:26:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-12-07 18:26:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-12-07 18:26:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-12-07 18:26:56,126 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-12-07 18:26:56,126 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-12-07 18:26:56,126 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 18:26:56,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-12-07 18:26:56,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:56,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:56,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:56,129 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-12-07 18:26:56,129 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-12-07 18:26:56,129 INFO L794 eck$LassoCheckResult]: Stem: 15215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 15171#L37 call main_#t~ret4 := fibo1(main_~x~0);< 15172#fibo1ENTRY ~n := #in~n; 15413#L8 assume !(~n < 1); 15405#L10 assume !(1 == ~n); 15406#L13 call #t~ret0 := fibo2(~n - 1);< 15416#fibo2ENTRY ~n := #in~n; 15415#L18 assume !(~n < 1); 15414#L20 assume !(1 == ~n); 15402#L23 call #t~ret2 := fibo1(~n - 1);< 15412#fibo1ENTRY ~n := #in~n; 15408#L8 assume !(~n < 1); 15409#L10 assume !(1 == ~n); 15401#L13 call #t~ret0 := fibo2(~n - 1);< 15403#fibo2ENTRY ~n := #in~n; 15438#L18 assume !(~n < 1); 15429#L20 assume !(1 == ~n); 15399#L23 call #t~ret2 := fibo1(~n - 1);< 15410#fibo1ENTRY ~n := #in~n; 15411#L8 assume !(~n < 1); 15497#L10 assume !(1 == ~n); 15165#L13 call #t~ret0 := fibo2(~n - 1);< 15400#fibo2ENTRY ~n := #in~n; 15431#L18 assume !(~n < 1); 15432#L20 assume !(1 == ~n); 15163#L23 call #t~ret2 := fibo1(~n - 1);< 15166#fibo1ENTRY ~n := #in~n; 15638#L8 assume !(~n < 1); 15637#L10 assume 1 == ~n;#res := 1; 15636#fibo1FINAL assume true; 15634#fibo1EXIT >#45#return; 15174#L23-1 call #t~ret3 := fibo1(~n - 2);< 15187#fibo1ENTRY ~n := #in~n; 15231#L8 assume !(~n < 1); 15173#L10 assume 1 == ~n;#res := 1; 15176#fibo1FINAL assume true; 15201#fibo1EXIT >#47#return; 15643#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 15642#fibo2FINAL assume true; 15641#fibo2EXIT >#49#return; 15317#L13-1 call #t~ret1 := fibo2(~n - 2);< 15210#fibo2ENTRY ~n := #in~n; 15321#L18 assume !(~n < 1); 15316#L20 assume !(1 == ~n); 15270#L23 [2019-12-07 18:26:56,129 INFO L796 eck$LassoCheckResult]: Loop: 15270#L23 call #t~ret2 := fibo1(~n - 1);< 15287#fibo1ENTRY ~n := #in~n; 15283#L8 assume !(~n < 1); 15284#L10 assume !(1 == ~n); 15185#L13 call #t~ret0 := fibo2(~n - 1);< 15271#fibo2ENTRY ~n := #in~n; 15378#L18 assume !(~n < 1); 15360#L20 assume !(1 == ~n); 15336#L23 call #t~ret2 := fibo1(~n - 1);< 15344#fibo1ENTRY ~n := #in~n; 15353#L8 assume !(~n < 1); 15352#L10 assume 1 == ~n;#res := 1; 15346#fibo1FINAL assume true; 15335#fibo1EXIT >#45#return; 15188#L23-1 call #t~ret3 := fibo1(~n - 2);< 15189#fibo1ENTRY ~n := #in~n; 15383#L8 assume ~n < 1;#res := 0; 15202#fibo1FINAL assume true; 15205#fibo1EXIT >#47#return; 15191#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 15183#fibo2FINAL assume true; 15186#fibo2EXIT >#49#return; 15230#L13-1 call #t~ret1 := fibo2(~n - 2);< 15210#fibo2ENTRY ~n := #in~n; 15321#L18 assume !(~n < 1); 15316#L20 assume !(1 == ~n); 15270#L23 [2019-12-07 18:26:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-12-07 18:26:56,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470696474] [2019-12-07 18:26:56,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:26:56,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470696474] [2019-12-07 18:26:56,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469838116] [2019-12-07 18:26:56,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:56,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:26:56,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:56,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-12-07 18:26:56,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267798316] [2019-12-07 18:26:56,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-12-07 18:26:56,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080139215] [2019-12-07 18:26:56,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:26:56,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080139215] [2019-12-07 18:26:56,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146712344] [2019-12-07 18:26:56,433 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:56,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:26:56,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:26:56,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:26:56,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:26:56,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:56,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-12-07 18:26:56,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939572461] [2019-12-07 18:26:56,480 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:26:56,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:26:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:26:56,480 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-12-07 18:26:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:56,607 INFO L93 Difference]: Finished difference Result 549 states and 744 transitions. [2019-12-07 18:26:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:26:56,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 744 transitions. [2019-12-07 18:26:56,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:56,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 524 states and 708 transitions. [2019-12-07 18:26:56,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2019-12-07 18:26:56,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-12-07 18:26:56,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 708 transitions. [2019-12-07 18:26:56,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:56,616 INFO L688 BuchiCegarLoop]: Abstraction has 524 states and 708 transitions. [2019-12-07 18:26:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 708 transitions. [2019-12-07 18:26:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2019-12-07 18:26:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-12-07 18:26:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2019-12-07 18:26:56,626 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-12-07 18:26:56,626 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-12-07 18:26:56,626 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 18:26:56,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 661 transitions. [2019-12-07 18:26:56,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:56,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:56,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:56,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:56,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:56,629 INFO L794 eck$LassoCheckResult]: Stem: 16577#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16519#L37 call main_#t~ret4 := fibo1(main_~x~0);< 16533#fibo1ENTRY ~n := #in~n; 16973#L8 assume !(~n < 1); 16518#L10 assume !(1 == ~n); 16520#L13 call #t~ret0 := fibo2(~n - 1);< 16749#fibo2ENTRY ~n := #in~n; 16931#L18 assume !(~n < 1); 16804#L20 assume !(1 == ~n); 16753#L23 call #t~ret2 := fibo1(~n - 1);< 16796#fibo1ENTRY ~n := #in~n; 16827#L8 assume !(~n < 1); 16826#L10 assume !(1 == ~n); 16773#L13 call #t~ret0 := fibo2(~n - 1);< 16824#fibo2ENTRY ~n := #in~n; 16965#L18 assume !(~n < 1); 16913#L20 assume !(1 == ~n); 16750#L23 call #t~ret2 := fibo1(~n - 1);< 16762#fibo1ENTRY ~n := #in~n; 16756#L8 assume !(~n < 1); 16754#L10 assume !(1 == ~n); 16507#L13 call #t~ret0 := fibo2(~n - 1);< 16581#fibo2ENTRY ~n := #in~n; 16582#L18 assume !(~n < 1); 16595#L20 assume !(1 == ~n); 16506#L23 call #t~ret2 := fibo1(~n - 1);< 16509#fibo1ENTRY ~n := #in~n; 16986#L8 assume !(~n < 1); 16984#L10 assume 1 == ~n;#res := 1; 16983#fibo1FINAL assume true; 16977#fibo1EXIT >#45#return; 16527#L23-1 call #t~ret3 := fibo1(~n - 2);< 16528#fibo1ENTRY ~n := #in~n; 16574#L8 assume !(~n < 1); 16945#L10 assume 1 == ~n;#res := 1; 16943#fibo1FINAL assume true; 16940#fibo1EXIT >#47#return; 16939#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 16937#fibo2FINAL assume true; 16935#fibo2EXIT >#49#return; 16799#L13-1 call #t~ret1 := fibo2(~n - 2);< 16807#fibo2ENTRY ~n := #in~n; 16996#L18 assume ~n < 1;#res := 0; 16808#fibo2FINAL assume true; 16797#fibo2EXIT >#51#return; 16801#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16990#fibo1FINAL assume true; 16777#fibo1EXIT >#45#return; 16606#L23-1 call #t~ret3 := fibo1(~n - 2);< 16774#fibo1ENTRY ~n := #in~n; 16605#L8 assume !(~n < 1); 16607#L10 assume !(1 == ~n); 16740#L13 [2019-12-07 18:26:56,629 INFO L796 eck$LassoCheckResult]: Loop: 16740#L13 call #t~ret0 := fibo2(~n - 1);< 16748#fibo2ENTRY ~n := #in~n; 16784#L18 assume !(~n < 1); 16775#L20 assume !(1 == ~n); 16745#L23 call #t~ret2 := fibo1(~n - 1);< 16767#fibo1ENTRY ~n := #in~n; 16958#L8 assume !(~n < 1); 16956#L10 assume !(1 == ~n); 16741#L13 call #t~ret0 := fibo2(~n - 1);< 16747#fibo2ENTRY ~n := #in~n; 16788#L18 assume !(~n < 1); 16785#L20 assume !(1 == ~n); 16787#L23 call #t~ret2 := fibo1(~n - 1);< 16849#fibo1ENTRY ~n := #in~n; 16864#L8 assume !(~n < 1); 16861#L10 assume 1 == ~n;#res := 1; 16859#fibo1FINAL assume true; 16846#fibo1EXIT >#45#return; 16589#L23-1 call #t~ret3 := fibo1(~n - 2);< 16845#fibo1ENTRY ~n := #in~n; 16588#L8 assume ~n < 1;#res := 0; 16590#fibo1FINAL assume true; 16844#fibo1EXIT >#47#return; 16841#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 16842#fibo2FINAL assume true; 16811#fibo2EXIT >#49#return; 16798#L13-1 call #t~ret1 := fibo2(~n - 2);< 16807#fibo2ENTRY ~n := #in~n; 16996#L18 assume ~n < 1;#res := 0; 16808#fibo2FINAL assume true; 16797#fibo2EXIT >#51#return; 16802#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16805#fibo1FINAL assume true; 16763#fibo1EXIT >#45#return; 16759#L23-1 call #t~ret3 := fibo1(~n - 2);< 16772#fibo1ENTRY ~n := #in~n; 16966#L8 assume !(~n < 1); 16915#L10 assume !(1 == ~n); 16740#L13 [2019-12-07 18:26:56,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 783666534, now seen corresponding path program 1 times [2019-12-07 18:26:56,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792220762] [2019-12-07 18:26:56,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 18:26:56,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792220762] [2019-12-07 18:26:56,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565926438] [2019-12-07 18:26:56,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:56,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:26:56,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:56,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-12-07 18:26:56,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825585497] [2019-12-07 18:26:56,790 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1056491202, now seen corresponding path program 2 times [2019-12-07 18:26:56,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781229919] [2019-12-07 18:26:56,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 18:26:56,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781229919] [2019-12-07 18:26:56,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494481393] [2019-12-07 18:26:56,833 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:26:56,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:26:56,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:26:56,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:26:56,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 18:26:56,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:56,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-12-07 18:26:56,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036096006] [2019-12-07 18:26:56,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:26:56,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:26:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:26:56,908 INFO L87 Difference]: Start difference. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 15 states. [2019-12-07 18:26:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:57,076 INFO L93 Difference]: Finished difference Result 518 states and 690 transitions. [2019-12-07 18:26:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:26:57,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 690 transitions. [2019-12-07 18:26:57,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:57,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 518 states and 690 transitions. [2019-12-07 18:26:57,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-12-07 18:26:57,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-12-07 18:26:57,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 690 transitions. [2019-12-07 18:26:57,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:57,085 INFO L688 BuchiCegarLoop]: Abstraction has 518 states and 690 transitions. [2019-12-07 18:26:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 690 transitions. [2019-12-07 18:26:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2019-12-07 18:26:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-12-07 18:26:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 650 transitions. [2019-12-07 18:26:57,094 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-12-07 18:26:57,094 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-12-07 18:26:57,094 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 18:26:57,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 650 transitions. [2019-12-07 18:26:57,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-12-07 18:26:57,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:57,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:57,097 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:57,097 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-12-07 18:26:57,097 INFO L794 eck$LassoCheckResult]: Stem: 18016#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 17965#L37 call main_#t~ret4 := fibo1(main_~x~0);< 17966#fibo1ENTRY ~n := #in~n; 18208#L8 assume !(~n < 1); 18194#L10 assume !(1 == ~n); 18186#L13 call #t~ret0 := fibo2(~n - 1);< 18212#fibo2ENTRY ~n := #in~n; 18211#L18 assume !(~n < 1); 18210#L20 assume !(1 == ~n); 18191#L23 call #t~ret2 := fibo1(~n - 1);< 18209#fibo1ENTRY ~n := #in~n; 18200#L8 assume !(~n < 1); 18201#L10 assume !(1 == ~n); 18190#L13 call #t~ret0 := fibo2(~n - 1);< 18192#fibo2ENTRY ~n := #in~n; 18270#L18 assume !(~n < 1); 18267#L20 assume !(1 == ~n); 17971#L23 call #t~ret2 := fibo1(~n - 1);< 18019#fibo1ENTRY ~n := #in~n; 18020#L8 assume !(~n < 1); 17970#L10 assume !(1 == ~n); 17960#L13 call #t~ret0 := fibo2(~n - 1);< 18189#fibo2ENTRY ~n := #in~n; 18207#L18 assume !(~n < 1); 18206#L20 assume !(1 == ~n); 17958#L23 call #t~ret2 := fibo1(~n - 1);< 17961#fibo1ENTRY ~n := #in~n; 18434#L8 assume !(~n < 1); 18433#L10 assume 1 == ~n;#res := 1; 18432#fibo1FINAL assume true; 18431#fibo1EXIT >#45#return; 17995#L23-1 call #t~ret3 := fibo1(~n - 2);< 18354#fibo1ENTRY ~n := #in~n; 18447#L8 assume !(~n < 1); 18448#L10 assume 1 == ~n;#res := 1; 18450#fibo1FINAL assume true; 18352#fibo1EXIT >#47#return; 18353#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 18427#fibo2FINAL assume true; 18402#fibo2EXIT >#49#return; 18024#L13-1 call #t~ret1 := fibo2(~n - 2);< 18344#fibo2ENTRY ~n := #in~n; 18337#L18 assume !(~n < 1); 18338#L20 assume 1 == ~n;#res := 1; 18400#fibo2FINAL assume true; 18393#fibo2EXIT >#51#return; 18390#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18386#fibo1FINAL assume true; 18382#fibo1EXIT >#45#return; 18008#L23-1 call #t~ret3 := fibo1(~n - 2);< 18378#fibo1ENTRY ~n := #in~n; 18044#L8 assume !(~n < 1); 18038#L10 assume !(1 == ~n); 17973#L13 [2019-12-07 18:26:57,097 INFO L796 eck$LassoCheckResult]: Loop: 17973#L13 call #t~ret0 := fibo2(~n - 1);< 18187#fibo2ENTRY ~n := #in~n; 18271#L18 assume !(~n < 1); 18268#L20 assume !(1 == ~n); 18009#L23 call #t~ret2 := fibo1(~n - 1);< 17964#fibo1ENTRY ~n := #in~n; 18258#L8 assume !(~n < 1); 18256#L10 assume !(1 == ~n); 17963#L13 call #t~ret0 := fibo2(~n - 1);< 18188#fibo2ENTRY ~n := #in~n; 18273#L18 assume !(~n < 1); 18263#L20 assume !(1 == ~n); 18265#L23 call #t~ret2 := fibo1(~n - 1);< 18413#fibo1ENTRY ~n := #in~n; 18424#L8 assume !(~n < 1); 18422#L10 assume 1 == ~n;#res := 1; 18420#fibo1FINAL assume true; 18410#fibo1EXIT >#45#return; 18408#L23-1 call #t~ret3 := fibo1(~n - 2);< 18409#fibo1ENTRY ~n := #in~n; 18425#L8 assume ~n < 1;#res := 0; 18426#fibo1FINAL assume true; 18430#fibo1EXIT >#47#return; 18429#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 18428#fibo2FINAL assume true; 18399#fibo2EXIT >#49#return; 18025#L13-1 call #t~ret1 := fibo2(~n - 2);< 18344#fibo2ENTRY ~n := #in~n; 18337#L18 assume !(~n < 1); 18338#L20 assume 1 == ~n;#res := 1; 18400#fibo2FINAL assume true; 18393#fibo2EXIT >#51#return; 18394#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18449#fibo1FINAL assume true; 18377#fibo1EXIT >#45#return; 17972#L23-1 call #t~ret3 := fibo1(~n - 2);< 17980#fibo1ENTRY ~n := #in~n; 18452#L8 assume !(~n < 1); 18451#L10 assume !(1 == ~n); 17973#L13 [2019-12-07 18:26:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1614825140, now seen corresponding path program 1 times [2019-12-07 18:26:57,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:57,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136346577] [2019-12-07 18:26:57,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:26:57,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136346577] [2019-12-07 18:26:57,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190655812] [2019-12-07 18:26:57,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:26:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:26:57,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:26:57,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:26:57,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2019-12-07 18:26:57,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842502416] [2019-12-07 18:26:57,279 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:26:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1482455256, now seen corresponding path program 1 times [2019-12-07 18:26:57,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:57,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130429895] [2019-12-07 18:26:57,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:57,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:57,494 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:57,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:57,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:57,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:57,494 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:26:57,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:57,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:57,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:57,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration11_Loop [2019-12-07 18:26:57,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:57,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:57,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,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-12-07 18:26:57,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-12-07 18:26:57,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,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-12-07 18:26:57,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-12-07 18:26:57,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,528 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:57,528 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:57,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:57,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:57,534 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:26:57,534 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:57,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:26:57,537 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:57,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:26:57,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:26:57,614 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:26:57,615 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:26:57,615 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:26:57,615 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:26:57,615 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:26:57,615 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:26:57,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:26:57,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:26:57,616 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:26:57,616 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration11_Loop [2019-12-07 18:26:57,616 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:26:57,616 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:26:57,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:26:57,653 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:26:57,653 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:57,656 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-12-07 18:26:57,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:26:57,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:26:57,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:26:57,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:26:57,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:26:57,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:26:57,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:26:57,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:26:57,663 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 18:26:57,663 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:26:57,666 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:26:57,666 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:26:57,666 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:26:57,666 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-12-07 18:26:57,667 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:26:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:26:57,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:57,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:57,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:57,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:57,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:26:57,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:57,837 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-12-07 18:26:57,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-12-07 18:26:58,160 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 1572 states and 2057 transitions. Complement of second has 49 states. [2019-12-07 18:26:58,160 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-12-07 18:26:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 18:26:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2019-12-07 18:26:58,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 53 letters. Loop has 39 letters. [2019-12-07 18:26:58,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:58,161 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:26:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:58,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:26:58,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:58,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:58,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:26:58,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:58,362 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-12-07 18:26:58,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-12-07 18:26:58,788 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 1677 states and 2221 transitions. Complement of second has 51 states. [2019-12-07 18:26:58,788 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-12-07 18:26:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 18:26:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2019-12-07 18:26:58,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 53 letters. Loop has 39 letters. [2019-12-07 18:26:58,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:58,790 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:26:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:58,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:26:58,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:58,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:58,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:26:58,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:26:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:26:58,985 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-12-07 18:26:58,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-12-07 18:26:59,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 2658 states and 3274 transitions. Complement of second has 128 states. [2019-12-07 18:26:59,386 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-12-07 18:26:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 18:26:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-12-07 18:26:59,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 53 letters. Loop has 39 letters. [2019-12-07 18:26:59,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:59,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 92 letters. Loop has 39 letters. [2019-12-07 18:26:59,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:59,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 53 letters. Loop has 78 letters. [2019-12-07 18:26:59,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:26:59,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2658 states and 3274 transitions. [2019-12-07 18:26:59,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-12-07 18:26:59,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2658 states to 1693 states and 2197 transitions. [2019-12-07 18:26:59,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 324 [2019-12-07 18:26:59,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2019-12-07 18:26:59,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1693 states and 2197 transitions. [2019-12-07 18:26:59,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:59,422 INFO L688 BuchiCegarLoop]: Abstraction has 1693 states and 2197 transitions. [2019-12-07 18:26:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states and 2197 transitions. [2019-12-07 18:26:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1488. [2019-12-07 18:26:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-07 18:26:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1848 transitions. [2019-12-07 18:26:59,453 INFO L711 BuchiCegarLoop]: Abstraction has 1488 states and 1848 transitions. [2019-12-07 18:26:59,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 18:26:59,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:26:59,454 INFO L87 Difference]: Start difference. First operand 1488 states and 1848 transitions. Second operand 22 states. [2019-12-07 18:26:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:59,773 INFO L93 Difference]: Finished difference Result 1553 states and 1910 transitions. [2019-12-07 18:26:59,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:26:59,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1553 states and 1910 transitions. [2019-12-07 18:26:59,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-12-07 18:26:59,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1553 states to 1494 states and 1849 transitions. [2019-12-07 18:26:59,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2019-12-07 18:26:59,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2019-12-07 18:26:59,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1494 states and 1849 transitions. [2019-12-07 18:26:59,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:26:59,793 INFO L688 BuchiCegarLoop]: Abstraction has 1494 states and 1849 transitions. [2019-12-07 18:26:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states and 1849 transitions. [2019-12-07 18:26:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1449. [2019-12-07 18:26:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-12-07 18:26:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1778 transitions. [2019-12-07 18:26:59,821 INFO L711 BuchiCegarLoop]: Abstraction has 1449 states and 1778 transitions. [2019-12-07 18:26:59,821 INFO L591 BuchiCegarLoop]: Abstraction has 1449 states and 1778 transitions. [2019-12-07 18:26:59,821 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 18:26:59,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1449 states and 1778 transitions. [2019-12-07 18:26:59,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-12-07 18:26:59,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:26:59,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:26:59,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 12, 12, 11, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 1, 1, 1] [2019-12-07 18:26:59,842 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-12-07 18:26:59,842 INFO L794 eck$LassoCheckResult]: Stem: 28885#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 28853#L37 call main_#t~ret4 := fibo1(main_~x~0);< 28854#fibo1ENTRY ~n := #in~n; 29189#L8 assume !(~n < 1); 29188#L10 assume !(1 == ~n); 29186#L13 call #t~ret0 := fibo2(~n - 1);< 29187#fibo2ENTRY ~n := #in~n; 29202#L18 assume !(~n < 1); 29200#L20 assume !(1 == ~n); 29197#L23 call #t~ret2 := fibo1(~n - 1);< 29198#fibo1ENTRY ~n := #in~n; 29228#L8 assume !(~n < 1); 29226#L10 assume !(1 == ~n); 29222#L13 call #t~ret0 := fibo2(~n - 1);< 29223#fibo2ENTRY ~n := #in~n; 29275#L18 assume !(~n < 1); 29272#L20 assume !(1 == ~n); 29257#L23 call #t~ret2 := fibo1(~n - 1);< 29258#fibo1ENTRY ~n := #in~n; 29291#L8 assume !(~n < 1); 29288#L10 assume !(1 == ~n); 28826#L13 call #t~ret0 := fibo2(~n - 1);< 29283#fibo2ENTRY ~n := #in~n; 29311#L18 assume !(~n < 1); 29307#L20 assume !(1 == ~n); 29267#L23 call #t~ret2 := fibo1(~n - 1);< 29299#fibo1ENTRY ~n := #in~n; 29300#L8 assume !(~n < 1); 29339#L10 assume !(1 == ~n); 29335#L13 call #t~ret0 := fibo2(~n - 1);< 29336#fibo2ENTRY ~n := #in~n; 29345#L18 assume !(~n < 1); 29343#L20 assume 1 == ~n;#res := 1; 29342#fibo2FINAL assume true; 29334#fibo2EXIT >#49#return; 29326#L13-1 call #t~ret1 := fibo2(~n - 2);< 29327#fibo2ENTRY ~n := #in~n; 29347#L18 assume ~n < 1;#res := 0; 29330#fibo2FINAL assume true; 29325#fibo2EXIT >#51#return; 29314#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29310#fibo1FINAL assume true; 29306#fibo1EXIT >#45#return; 29296#L23-1 call #t~ret3 := fibo1(~n - 2);< 29297#fibo1ENTRY ~n := #in~n; 29313#L8 assume !(~n < 1); 29309#L10 assume 1 == ~n;#res := 1; 29305#fibo1FINAL assume true; 29295#fibo1EXIT >#47#return; 29289#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29287#fibo2FINAL assume true; 29282#fibo2EXIT >#49#return; 29209#L13-1 call #t~ret1 := fibo2(~n - 2);< 29274#fibo2ENTRY ~n := #in~n; 29284#L18 assume !(~n < 1); 29280#L20 assume 1 == ~n;#res := 1; 29276#fibo2FINAL assume true; 29273#fibo2EXIT >#51#return; 29213#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29271#fibo1FINAL assume true; 29256#fibo1EXIT >#45#return; 29239#L23-1 call #t~ret3 := fibo1(~n - 2);< 29247#fibo1ENTRY ~n := #in~n; 29434#L8 assume !(~n < 1); 29420#L10 assume !(1 == ~n); 29415#L13 call #t~ret0 := fibo2(~n - 1);< 29416#fibo2ENTRY ~n := #in~n; 29459#L18 assume !(~n < 1); 29455#L20 assume 1 == ~n;#res := 1; 29446#fibo2FINAL assume true; 29447#fibo2EXIT >#49#return; 29263#L13-1 call #t~ret1 := fibo2(~n - 2);< 29264#fibo2ENTRY ~n := #in~n; 29439#L18 assume ~n < 1;#res := 0; 29440#fibo2FINAL assume true; 29453#fibo2EXIT >#51#return; 29260#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29249#fibo1FINAL assume true; 29245#fibo1EXIT >#47#return; 29237#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29233#fibo2FINAL assume true; 29221#fibo2EXIT >#49#return; 29207#L13-1 call #t~ret1 := fibo2(~n - 2);< 29215#fibo2ENTRY ~n := #in~n; 29259#L18 assume !(~n < 1); 29248#L20 assume !(1 == ~n); 29225#L23 call #t~ret2 := fibo1(~n - 1);< 29244#fibo1ENTRY ~n := #in~n; 29413#L8 assume !(~n < 1); 29412#L10 assume !(1 == ~n); 29096#L13 call #t~ret0 := fibo2(~n - 1);< 29595#fibo2ENTRY ~n := #in~n; 29553#L18 assume !(~n < 1); 29538#L20 assume !(1 == ~n); 29523#L23 call #t~ret2 := fibo1(~n - 1);< 29525#fibo1ENTRY ~n := #in~n; 29531#L8 assume !(~n < 1); 29529#L10 assume 1 == ~n;#res := 1; 29527#fibo1FINAL assume true; 29521#fibo1EXIT >#45#return; 29509#L23-1 call #t~ret3 := fibo1(~n - 2);< 29514#fibo1ENTRY ~n := #in~n; 29518#L8 assume ~n < 1;#res := 0; 29515#fibo1FINAL assume true; 29508#fibo1EXIT >#47#return; 29512#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29695#fibo2FINAL assume true; 29693#fibo2EXIT >#49#return; 29640#L13-1 call #t~ret1 := fibo2(~n - 2);< 29676#fibo2ENTRY ~n := #in~n; 29721#L18 assume !(~n < 1); 29722#L20 assume 1 == ~n;#res := 1; 29716#fibo2FINAL assume true; 29717#fibo2EXIT >#51#return; 29673#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29671#fibo1FINAL assume true; 29242#fibo1EXIT >#45#return; 29235#L23-1 call #t~ret3 := fibo1(~n - 2);< 29236#fibo1ENTRY ~n := #in~n; 29444#L8 assume !(~n < 1); 29442#L10 assume 1 == ~n;#res := 1; 29443#fibo1FINAL assume true; 29630#fibo1EXIT >#47#return; 29232#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29224#fibo2FINAL assume true; 29204#fibo2EXIT >#51#return; 29203#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29201#fibo1FINAL assume true; 29196#fibo1EXIT >#45#return; 29020#L23-1 call #t~ret3 := fibo1(~n - 2);< 29194#fibo1ENTRY ~n := #in~n; 29655#L8 assume !(~n < 1); 29654#L10 assume !(1 == ~n); 28987#L13 call #t~ret0 := fibo2(~n - 1);< 29016#fibo2ENTRY ~n := #in~n; 28993#L18 assume !(~n < 1); 28992#L20 assume !(1 == ~n); 28990#L23 call #t~ret2 := fibo1(~n - 1);< 28991#fibo1ENTRY ~n := #in~n; 29341#L8 assume !(~n < 1); 29333#L10 assume !(1 == ~n); 29252#L13 call #t~ret0 := fibo2(~n - 1);< 29286#fibo2ENTRY ~n := #in~n; 29340#L18 assume !(~n < 1); 29337#L20 assume 1 == ~n;#res := 1; 29332#fibo2FINAL assume true; 29329#fibo2EXIT >#49#return; 29316#L13-1 call #t~ret1 := fibo2(~n - 2);< 29324#fibo2ENTRY ~n := #in~n; 29331#L18 assume ~n < 1;#res := 0; 29328#fibo2FINAL assume true; 29315#fibo2EXIT >#51#return; 29322#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29376#fibo1FINAL assume true; 29375#fibo1EXIT >#45#return; 29355#L23-1 call #t~ret3 := fibo1(~n - 2);< 29360#fibo1ENTRY ~n := #in~n; 29367#L8 assume !(~n < 1); 29366#L10 assume 1 == ~n;#res := 1; 28900#fibo1FINAL assume true; 29354#fibo1EXIT >#47#return; 29348#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29231#fibo2FINAL assume true; 29218#fibo2EXIT >#49#return; 28923#L13-1 call #t~ret1 := fibo2(~n - 2);< 28927#fibo2ENTRY ~n := #in~n; 28926#L18 assume !(~n < 1); 28921#L20 assume !(1 == ~n); 28869#L23 [2019-12-07 18:26:59,843 INFO L796 eck$LassoCheckResult]: Loop: 28869#L23 call #t~ret2 := fibo1(~n - 1);< 28953#fibo1ENTRY ~n := #in~n; 28948#L8 assume !(~n < 1); 28949#L10 assume !(1 == ~n); 28931#L13 call #t~ret0 := fibo2(~n - 1);< 28932#fibo2ENTRY ~n := #in~n; 28947#L18 assume !(~n < 1); 28946#L20 assume !(1 == ~n); 28943#L23 call #t~ret2 := fibo1(~n - 1);< 28945#fibo1ENTRY ~n := #in~n; 29786#L8 assume !(~n < 1); 29785#L10 assume !(1 == ~n); 29779#L13 call #t~ret0 := fibo2(~n - 1);< 29784#fibo2ENTRY ~n := #in~n; 29980#L18 assume !(~n < 1); 29975#L20 assume 1 == ~n;#res := 1; 29976#fibo2FINAL assume true; 30028#fibo2EXIT >#49#return; 30018#L13-1 call #t~ret1 := fibo2(~n - 2);< 30023#fibo2ENTRY ~n := #in~n; 30047#L18 assume ~n < 1;#res := 0; 30046#fibo2FINAL assume true; 30017#fibo2EXIT >#51#return; 30021#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 30172#fibo1FINAL assume true; 30166#fibo1EXIT >#45#return; 28938#L23-1 call #t~ret3 := fibo1(~n - 2);< 28939#fibo1ENTRY ~n := #in~n; 30176#L8 assume !(~n < 1); 30174#L10 assume 1 == ~n;#res := 1; 30173#fibo1FINAL assume true; 30169#fibo1EXIT >#47#return; 28934#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 28933#fibo2FINAL assume true; 28929#fibo2EXIT >#49#return; 28922#L13-1 call #t~ret1 := fibo2(~n - 2);< 28927#fibo2ENTRY ~n := #in~n; 28926#L18 assume !(~n < 1); 28921#L20 assume !(1 == ~n); 28869#L23 [2019-12-07 18:26:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2142147031, now seen corresponding path program 1 times [2019-12-07 18:26:59,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:59,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187886327] [2019-12-07 18:26:59,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 221 proven. 312 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-12-07 18:27:00,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187886327] [2019-12-07 18:27:00,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804521612] [2019-12-07 18:27:00,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,182 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:27:00,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 390 proven. 162 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-12-07 18:27:00,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 30 [2019-12-07 18:27:00,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198576529] [2019-12-07 18:27:00,255 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:27:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1831895155, now seen corresponding path program 1 times [2019-12-07 18:27:00,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:00,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941366242] [2019-12-07 18:27:00,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:00,261 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:27:00,458 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:27:00,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:27:00,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:27:00,458 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:27:00,458 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:27:00,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:00,458 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:27:00,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:27:00,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration12_Loop [2019-12-07 18:27:00,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:27:00,458 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:27:00,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:00,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:27:00,509 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:00,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:00,514 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:00,514 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:00,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:00,521 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:00,521 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:00,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:00,528 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:00,528 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:00,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:00,535 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:00,535 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:00,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:00,541 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:00,541 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:00,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:00,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:00,547 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:00,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:00,550 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:00,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:27:00,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:02,593 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:27:02,595 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:27:02,595 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:27:02,595 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:27:02,595 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:27:02,595 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:27:02,595 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:02,595 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:27:02,595 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:27:02,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration12_Loop [2019-12-07 18:27:02,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:27:02,596 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:27:02,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:02,631 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:27:02,631 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:02,634 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-12-07 18:27:02,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:02,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:02,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:02,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:02,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:02,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:02,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:02,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:02,640 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-12-07 18:27:02,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:02,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:02,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:02,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:02,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:02,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:02,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:02,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:02,647 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-12-07 18:27:02,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:02,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:02,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:02,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:02,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:02,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:02,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:02,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:02,653 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-12-07 18:27:02,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:02,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:02,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:02,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:02,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:02,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:02,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:02,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:02,660 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-12-07 18:27:02,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:02,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:02,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:02,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:02,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:02,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:02,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:02,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:02,667 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-12-07 18:27:02,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:02,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:02,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:02,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:02,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:02,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:02,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:02,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:27:02,672 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-12-07 18:27:02,673 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:02,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:27:02,675 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:27:02,675 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:27:02,675 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-12-07 18:27:02,676 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:27:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:02,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 18:27:02,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:02,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:02,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:27:02,836 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:27:02,931 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-12-07 18:27:02,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-12-07 18:27:03,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 2883 states and 3513 transitions. Complement of second has 50 states. [2019-12-07 18:27:03,275 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-12-07 18:27:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 18:27:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2019-12-07 18:27:03,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 168 letters. Loop has 39 letters. [2019-12-07 18:27:03,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:03,277 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:27:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:03,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 18:27:03,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:03,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:03,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:27:03,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:27:03,573 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-12-07 18:27:03,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-12-07 18:27:03,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 2999 states and 3662 transitions. Complement of second has 52 states. [2019-12-07 18:27:03,948 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-12-07 18:27:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 18:27:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2019-12-07 18:27:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 168 letters. Loop has 39 letters. [2019-12-07 18:27:03,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:03,949 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:27:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:04,039 INFO L264 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 18:27:04,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:04,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:04,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:27:04,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:27:04,195 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-12-07 18:27:04,195 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-12-07 18:27:04,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 4589 states and 5376 transitions. Complement of second has 127 states. [2019-12-07 18:27:04,523 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-12-07 18:27:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 18:27:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-12-07 18:27:04,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 168 letters. Loop has 39 letters. [2019-12-07 18:27:04,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:04,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 207 letters. Loop has 39 letters. [2019-12-07 18:27:04,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:04,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 168 letters. Loop has 78 letters. [2019-12-07 18:27:04,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:04,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4589 states and 5376 transitions. [2019-12-07 18:27:04,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-12-07 18:27:04,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4589 states to 3185 states and 3878 transitions. [2019-12-07 18:27:04,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-12-07 18:27:04,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2019-12-07 18:27:04,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3185 states and 3878 transitions. [2019-12-07 18:27:04,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:27:04,564 INFO L688 BuchiCegarLoop]: Abstraction has 3185 states and 3878 transitions. [2019-12-07 18:27:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states and 3878 transitions. [2019-12-07 18:27:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 2761. [2019-12-07 18:27:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2019-12-07 18:27:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3277 transitions. [2019-12-07 18:27:04,609 INFO L711 BuchiCegarLoop]: Abstraction has 2761 states and 3277 transitions. [2019-12-07 18:27:04,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:27:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:27:04,610 INFO L87 Difference]: Start difference. First operand 2761 states and 3277 transitions. Second operand 30 states. [2019-12-07 18:27:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:05,361 INFO L93 Difference]: Finished difference Result 4283 states and 5397 transitions. [2019-12-07 18:27:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:27:05,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4283 states and 5397 transitions. [2019-12-07 18:27:05,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-12-07 18:27:05,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4283 states to 2695 states and 3264 transitions. [2019-12-07 18:27:05,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-12-07 18:27:05,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2019-12-07 18:27:05,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2695 states and 3264 transitions. [2019-12-07 18:27:05,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:27:05,396 INFO L688 BuchiCegarLoop]: Abstraction has 2695 states and 3264 transitions. [2019-12-07 18:27:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states and 3264 transitions. [2019-12-07 18:27:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2337. [2019-12-07 18:27:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-07 18:27:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 2749 transitions. [2019-12-07 18:27:05,430 INFO L711 BuchiCegarLoop]: Abstraction has 2337 states and 2749 transitions. [2019-12-07 18:27:05,430 INFO L591 BuchiCegarLoop]: Abstraction has 2337 states and 2749 transitions. [2019-12-07 18:27:05,430 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 18:27:05,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2337 states and 2749 transitions. [2019-12-07 18:27:05,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-12-07 18:27:05,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:27:05,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:27:05,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [24, 24, 23, 23, 20, 19, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1] [2019-12-07 18:27:05,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [22, 21, 20, 19, 17, 17, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 6, 5, 3] [2019-12-07 18:27:05,437 INFO L794 eck$LassoCheckResult]: Stem: 51111#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 51082#L37 call main_#t~ret4 := fibo1(main_~x~0);< 51083#fibo1ENTRY ~n := #in~n; 51155#L8 assume !(~n < 1); 51154#L10 assume !(1 == ~n); 51150#L13 call #t~ret0 := fibo2(~n - 1);< 51153#fibo2ENTRY ~n := #in~n; 51152#L18 assume !(~n < 1); 51151#L20 assume !(1 == ~n); 51146#L23 call #t~ret2 := fibo1(~n - 1);< 51149#fibo1ENTRY ~n := #in~n; 51148#L8 assume !(~n < 1); 51147#L10 assume !(1 == ~n); 51143#L13 call #t~ret0 := fibo2(~n - 1);< 51145#fibo2ENTRY ~n := #in~n; 51144#L18 assume !(~n < 1); 51142#L20 assume !(1 == ~n); 51136#L23 call #t~ret2 := fibo1(~n - 1);< 51139#fibo1ENTRY ~n := #in~n; 51140#L8 assume !(~n < 1); 51135#L10 assume !(1 == ~n); 51050#L13 call #t~ret0 := fibo2(~n - 1);< 51134#fibo2ENTRY ~n := #in~n; 51133#L18 assume !(~n < 1); 51129#L20 assume !(1 == ~n); 51122#L23 call #t~ret2 := fibo1(~n - 1);< 51141#fibo1ENTRY ~n := #in~n; 51121#L8 assume !(~n < 1); 51123#L10 assume !(1 == ~n); 53082#L13 call #t~ret0 := fibo2(~n - 1);< 53083#fibo2ENTRY ~n := #in~n; 53089#L18 assume !(~n < 1); 53087#L20 assume 1 == ~n;#res := 1; 53086#fibo2FINAL assume true; 53081#fibo2EXIT >#49#return; 53079#L13-1 call #t~ret1 := fibo2(~n - 2);< 53080#fibo2ENTRY ~n := #in~n; 53085#L18 assume ~n < 1;#res := 0; 53084#fibo2FINAL assume true; 53078#fibo2EXIT >#51#return; 53077#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 53075#fibo1FINAL assume true; 53073#fibo1EXIT >#45#return; 53070#L23-1 call #t~ret3 := fibo1(~n - 2);< 53071#fibo1ENTRY ~n := #in~n; 53076#L8 assume !(~n < 1); 53074#L10 assume 1 == ~n;#res := 1; 53072#fibo1FINAL assume true; 53069#fibo1EXIT >#47#return; 53067#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 53066#fibo2FINAL assume true; 52219#fibo2EXIT >#49#return; 52217#L13-1 call #t~ret1 := fibo2(~n - 2);< 52218#fibo2ENTRY ~n := #in~n; 52961#L18 assume !(~n < 1); 52959#L20 assume !(1 == ~n); 52956#L23 call #t~ret2 := fibo1(~n - 1);< 52957#fibo1ENTRY ~n := #in~n; 53007#L8 assume !(~n < 1); 52965#L10 assume 1 == ~n;#res := 1; 52964#fibo1FINAL assume true; 52955#fibo1EXIT >#45#return; 52944#L23-1 call #t~ret3 := fibo1(~n - 2);< 52953#fibo1ENTRY ~n := #in~n; 52950#L8 assume ~n < 1;#res := 0; 52951#fibo1FINAL assume true; 52943#fibo1EXIT >#47#return; 52941#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52865#fibo2FINAL assume true; 52861#fibo2EXIT >#51#return; 52206#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52204#fibo1FINAL assume true; 51694#fibo1EXIT >#45#return; 51683#L23-1 call #t~ret3 := fibo1(~n - 2);< 51687#fibo1ENTRY ~n := #in~n; 52999#L8 assume !(~n < 1); 52984#L10 assume !(1 == ~n); 52981#L13 call #t~ret0 := fibo2(~n - 1);< 52982#fibo2ENTRY ~n := #in~n; 52997#L18 assume !(~n < 1); 52995#L20 assume !(1 == ~n); 52991#L23 call #t~ret2 := fibo1(~n - 1);< 52992#fibo1ENTRY ~n := #in~n; 52998#L8 assume !(~n < 1); 52996#L10 assume 1 == ~n;#res := 1; 52994#fibo1FINAL assume true; 52990#fibo1EXIT >#45#return; 52987#L23-1 call #t~ret3 := fibo1(~n - 2);< 52988#fibo1ENTRY ~n := #in~n; 52993#L8 assume ~n < 1;#res := 0; 52989#fibo1FINAL assume true; 52986#fibo1EXIT >#47#return; 52985#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52983#fibo2FINAL assume true; 52980#fibo2EXIT >#49#return; 52904#L13-1 call #t~ret1 := fibo2(~n - 2);< 52979#fibo2ENTRY ~n := #in~n; 53132#L18 assume !(~n < 1); 53131#L20 assume 1 == ~n;#res := 1; 53130#fibo2FINAL assume true; 53124#fibo2EXIT >#51#return; 53119#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 53116#fibo1FINAL assume true; 51681#fibo1EXIT >#47#return; 51673#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51672#fibo2FINAL assume true; 51666#fibo2EXIT >#49#return; 51647#L13-1 call #t~ret1 := fibo2(~n - 2);< 51655#fibo2ENTRY ~n := #in~n; 52158#L18 assume !(~n < 1); 52159#L20 assume !(1 == ~n); 51970#L23 call #t~ret2 := fibo1(~n - 1);< 51976#fibo1ENTRY ~n := #in~n; 52079#L8 assume !(~n < 1); 52080#L10 assume !(1 == ~n); 52290#L13 call #t~ret0 := fibo2(~n - 1);< 52687#fibo2ENTRY ~n := #in~n; 52708#L18 assume !(~n < 1); 52705#L20 assume !(1 == ~n); 52699#L23 call #t~ret2 := fibo1(~n - 1);< 52701#fibo1ENTRY ~n := #in~n; 52709#L8 assume !(~n < 1); 52706#L10 assume 1 == ~n;#res := 1; 52702#fibo1FINAL assume true; 52698#fibo1EXIT >#45#return; 52693#L23-1 call #t~ret3 := fibo1(~n - 2);< 52696#fibo1ENTRY ~n := #in~n; 52716#L8 assume ~n < 1;#res := 0; 52711#fibo1FINAL assume true; 52692#fibo1EXIT >#47#return; 52691#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52690#fibo2FINAL assume true; 52686#fibo2EXIT >#49#return; 52682#L13-1 call #t~ret1 := fibo2(~n - 2);< 52683#fibo2ENTRY ~n := #in~n; 52728#L18 assume !(~n < 1); 52727#L20 assume 1 == ~n;#res := 1; 52726#fibo2FINAL assume true; 52681#fibo2EXIT >#51#return; 52678#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52674#fibo1FINAL assume true; 52672#fibo1EXIT >#45#return; 52668#L23-1 call #t~ret3 := fibo1(~n - 2);< 52670#fibo1ENTRY ~n := #in~n; 52739#L8 assume !(~n < 1); 52738#L10 assume !(1 == ~n); 52735#L13 call #t~ret0 := fibo2(~n - 1);< 52736#fibo2ENTRY ~n := #in~n; 52742#L18 assume !(~n < 1); 52741#L20 assume 1 == ~n;#res := 1; 52740#fibo2FINAL assume true; 52734#fibo2EXIT >#49#return; 52732#L13-1 call #t~ret1 := fibo2(~n - 2);< 52733#fibo2ENTRY ~n := #in~n; 52737#L18 assume ~n < 1;#res := 0; 52689#fibo2FINAL assume true; 52731#fibo2EXIT >#51#return; 52730#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52729#fibo1FINAL assume true; 52667#fibo1EXIT >#47#return; 51974#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52660#fibo2FINAL assume true; 51645#fibo2EXIT >#51#return; 51643#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51638#fibo1FINAL assume true; 51635#fibo1EXIT >#45#return; 51618#L23-1 call #t~ret3 := fibo1(~n - 2);< 51629#fibo1ENTRY ~n := #in~n; 52617#L8 assume !(~n < 1); 52614#L10 assume !(1 == ~n); 51613#L13 call #t~ret0 := fibo2(~n - 1);< 51617#fibo2ENTRY ~n := #in~n; 51656#L18 assume !(~n < 1); 51644#L20 assume !(1 == ~n); 51640#L23 call #t~ret2 := fibo1(~n - 1);< 51642#fibo1ENTRY ~n := #in~n; 51794#L8 assume !(~n < 1); 51791#L10 assume !(1 == ~n); 51786#L13 call #t~ret0 := fibo2(~n - 1);< 51787#fibo2ENTRY ~n := #in~n; 51793#L18 assume !(~n < 1); 51790#L20 assume 1 == ~n;#res := 1; 51789#fibo2FINAL assume true; 51784#fibo2EXIT >#49#return; 51776#L13-1 call #t~ret1 := fibo2(~n - 2);< 51779#fibo2ENTRY ~n := #in~n; 51788#L18 assume ~n < 1;#res := 0; 51781#fibo2FINAL assume true; 51775#fibo2EXIT >#51#return; 51773#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51772#fibo1FINAL assume true; 51758#fibo1EXIT >#45#return; 51753#L23-1 call #t~ret3 := fibo1(~n - 2);< 51865#fibo1ENTRY ~n := #in~n; 51866#L8 assume !(~n < 1); 51858#L10 assume 1 == ~n;#res := 1; 51859#fibo1FINAL assume true; 51752#fibo1EXIT >#47#return; 51751#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51750#fibo2FINAL assume true; 51749#fibo2EXIT >#49#return; 51740#L13-1 call #t~ret1 := fibo2(~n - 2);< 51742#fibo2ENTRY ~n := #in~n; 51780#L18 assume !(~n < 1); 51774#L20 assume !(1 == ~n); 51757#L23 call #t~ret2 := fibo1(~n - 1);< 51760#fibo1ENTRY ~n := #in~n; 51805#L8 assume !(~n < 1); 51804#L10 assume !(1 == ~n); 51769#L13 call #t~ret0 := fibo2(~n - 1);< 51771#fibo2ENTRY ~n := #in~n; 51954#L18 assume !(~n < 1); 51801#L20 assume 1 == ~n;#res := 1; 51800#fibo2FINAL assume true; 51768#fibo2EXIT >#49#return; 51764#L13-1 call #t~ret1 := fibo2(~n - 2);< 51767#fibo2ENTRY ~n := #in~n; 51802#L18 assume ~n < 1;#res := 0; 51799#fibo2FINAL assume true; 51763#fibo2EXIT >#51#return; 51762#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51761#fibo1FINAL assume true; 51756#fibo1EXIT >#45#return; 51754#L23-1 call #t~ret3 := fibo1(~n - 2);< 51755#fibo1ENTRY ~n := #in~n; 51863#L8 assume !(~n < 1); 51864#L10 assume 1 == ~n;#res := 1; 51807#fibo1FINAL assume true; 51809#fibo1EXIT >#47#return; 51751#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51750#fibo2FINAL assume true; 51749#fibo2EXIT >#51#return; 51615#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51733#fibo1FINAL assume true; 51628#fibo1EXIT >#47#return; 51626#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51622#fibo2FINAL assume true; 51610#fibo2EXIT >#49#return; 51203#L13-1 call #t~ret1 := fibo2(~n - 2);< 51242#fibo2ENTRY ~n := #in~n; 51243#L18 assume !(~n < 1); 51658#L20 assume !(1 == ~n); 51181#L23 call #t~ret2 := fibo1(~n - 1);< 51190#fibo1ENTRY ~n := #in~n; 51191#L8 assume !(~n < 1); 51180#L10 assume !(1 == ~n); 51163#L13 call #t~ret0 := fibo2(~n - 1);< 51164#fibo2ENTRY ~n := #in~n; 51185#L18 assume !(~n < 1); 51179#L20 assume !(1 == ~n); 51177#L23 call #t~ret2 := fibo1(~n - 1);< 51178#fibo1ENTRY ~n := #in~n; 51209#L8 assume !(~n < 1); 51208#L10 assume !(1 == ~n); 51205#L13 call #t~ret0 := fibo2(~n - 1);< 51207#fibo2ENTRY ~n := #in~n; 51397#L18 assume !(~n < 1); 51395#L20 assume 1 == ~n;#res := 1; 51396#fibo2FINAL assume true; 51432#fibo2EXIT >#49#return; 51427#L13-1 call #t~ret1 := fibo2(~n - 2);< 51430#fibo2ENTRY ~n := #in~n; 51436#L18 assume ~n < 1;#res := 0; 51433#fibo2FINAL assume true; 51426#fibo2EXIT >#51#return; 51424#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51423#fibo1FINAL assume true; 51337#fibo1EXIT >#45#return; 51320#L23-1 call #t~ret3 := fibo1(~n - 2);< 51347#fibo1ENTRY ~n := #in~n; 51439#L8 assume !(~n < 1); 51438#L10 assume 1 == ~n;#res := 1; 51349#fibo1FINAL assume true; 51319#fibo1EXIT >#47#return; 51323#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51806#fibo2FINAL assume true; 51744#fibo2EXIT >#49#return; 51062#L13-1 call #t~ret1 := fibo2(~n - 2);< 51096#fibo2ENTRY ~n := #in~n; 51803#L18 assume !(~n < 1); 51159#L20 assume !(1 == ~n); 51077#L23 call #t~ret2 := fibo1(~n - 1);< 51108#fibo1ENTRY ~n := #in~n; 51109#L8 assume !(~n < 1); 51076#L10 assume 1 == ~n;#res := 1; 51078#fibo1FINAL assume true; 51086#fibo1EXIT >#45#return; 51060#L23-1 call #t~ret3 := fibo1(~n - 2);< 51065#fibo1ENTRY ~n := #in~n; 52649#L8 assume ~n < 1;#res := 0; 52647#fibo1FINAL assume true; 52642#fibo1EXIT >#47#return; 51084#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51070#fibo2FINAL assume true; 51071#fibo2EXIT >#51#return; 51615#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51733#fibo1FINAL assume true; 51628#fibo1EXIT >#45#return; 51103#L23-1 call #t~ret3 := fibo1(~n - 2);< 51633#fibo1ENTRY [2019-12-07 18:27:05,437 INFO L796 eck$LassoCheckResult]: Loop: 51633#fibo1ENTRY ~n := #in~n; 51707#L8 assume !(~n < 1); 51625#L10 assume !(1 == ~n); 51612#L13 call #t~ret0 := fibo2(~n - 1);< 51617#fibo2ENTRY ~n := #in~n; 51656#L18 assume !(~n < 1); 51644#L20 assume !(1 == ~n); 51640#L23 call #t~ret2 := fibo1(~n - 1);< 51641#fibo1ENTRY ~n := #in~n; 51840#L8 assume !(~n < 1); 51837#L10 assume !(1 == ~n); 51833#L13 call #t~ret0 := fibo2(~n - 1);< 51835#fibo2ENTRY ~n := #in~n; 51857#L18 assume !(~n < 1); 51855#L20 assume !(1 == ~n); 51851#L23 call #t~ret2 := fibo1(~n - 1);< 51854#fibo1ENTRY ~n := #in~n; 51927#L8 assume !(~n < 1); 51925#L10 assume !(1 == ~n); 51869#L13 call #t~ret0 := fibo2(~n - 1);< 51923#fibo2ENTRY ~n := #in~n; 51922#L18 assume !(~n < 1); 51918#L20 assume 1 == ~n;#res := 1; 51919#fibo2FINAL assume true; 52157#fibo2EXIT >#49#return; 52140#L13-1 call #t~ret1 := fibo2(~n - 2);< 52142#fibo2ENTRY ~n := #in~n; 52162#L18 assume ~n < 1;#res := 0; 52160#fibo2FINAL assume true; 52139#fibo2EXIT >#51#return; 52141#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52114#fibo1FINAL assume true; 52115#fibo1EXIT >#45#return; 51967#L23-1 call #t~ret3 := fibo1(~n - 2);< 51968#fibo1ENTRY ~n := #in~n; 52615#L8 assume !(~n < 1); 52186#L10 assume 1 == ~n;#res := 1; 52116#fibo1FINAL assume true; 52119#fibo1EXIT >#47#return; 51959#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51861#fibo2FINAL assume true; 51860#fibo2EXIT >#49#return; 51828#L13-1 call #t~ret1 := fibo2(~n - 2);< 51830#fibo2ENTRY ~n := #in~n; 51979#L18 assume !(~n < 1); 51978#L20 assume !(1 == ~n); 51947#L23 call #t~ret2 := fibo1(~n - 1);< 51948#fibo1ENTRY ~n := #in~n; 52112#L8 assume !(~n < 1); 51980#L10 assume 1 == ~n;#res := 1; 51981#fibo1FINAL assume true; 51946#fibo1EXIT >#45#return; 51930#L23-1 call #t~ret3 := fibo1(~n - 2);< 52124#fibo1ENTRY ~n := #in~n; 52121#L8 assume ~n < 1;#res := 0; 52122#fibo1FINAL assume true; 51929#fibo1EXIT >#47#return; 51870#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51867#fibo2FINAL assume true; 51826#fibo2EXIT >#51#return; 51653#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51823#fibo1FINAL assume true; 51639#fibo1EXIT >#45#return; 51102#L23-1 call #t~ret3 := fibo1(~n - 2);< 51634#fibo1ENTRY ~n := #in~n; 51698#L8 assume !(~n < 1); 51697#L10 assume !(1 == ~n); 51680#L13 call #t~ret0 := fibo2(~n - 1);< 51696#fibo2ENTRY ~n := #in~n; 51695#L18 assume !(~n < 1); 51693#L20 assume !(1 == ~n); 51691#L23 call #t~ret2 := fibo1(~n - 1);< 51692#fibo1ENTRY ~n := #in~n; 51706#L8 assume !(~n < 1); 51704#L10 assume 1 == ~n;#res := 1; 51700#fibo1FINAL assume true; 51689#fibo1EXIT >#45#return; 51675#L23-1 call #t~ret3 := fibo1(~n - 2);< 51678#fibo1ENTRY ~n := #in~n; 51688#L8 assume ~n < 1;#res := 0; 51679#fibo1FINAL assume true; 51674#fibo1EXIT >#47#return; 51677#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51705#fibo2FINAL assume true; 51701#fibo2EXIT >#49#return; 51660#L13-1 call #t~ret1 := fibo2(~n - 2);< 51663#fibo2ENTRY ~n := #in~n; 51669#L18 assume !(~n < 1); 51667#L20 assume 1 == ~n;#res := 1; 51664#fibo2FINAL assume true; 51659#fibo2EXIT >#51#return; 51657#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51636#fibo1FINAL assume true; 51631#fibo1EXIT >#47#return; 51627#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51623#fibo2FINAL assume true; 51611#fibo2EXIT >#49#return; 51226#L13-1 call #t~ret1 := fibo2(~n - 2);< 51624#fibo2ENTRY ~n := #in~n; 51241#L18 assume !(~n < 1); 51224#L20 assume !(1 == ~n); 51095#L23 call #t~ret2 := fibo1(~n - 1);< 51637#fibo1ENTRY ~n := #in~n; 51186#L8 assume !(~n < 1); 51187#L10 assume !(1 == ~n); 51162#L13 call #t~ret0 := fibo2(~n - 1);< 51164#fibo2ENTRY ~n := #in~n; 51185#L18 assume !(~n < 1); 51179#L20 assume !(1 == ~n); 51177#L23 call #t~ret2 := fibo1(~n - 1);< 51178#fibo1ENTRY ~n := #in~n; 51209#L8 assume !(~n < 1); 51208#L10 assume !(1 == ~n); 51205#L13 call #t~ret0 := fibo2(~n - 1);< 51207#fibo2ENTRY ~n := #in~n; 51397#L18 assume !(~n < 1); 51395#L20 assume !(1 == ~n); 51231#L23 call #t~ret2 := fibo1(~n - 1);< 51235#fibo1ENTRY ~n := #in~n; 51234#L8 assume !(~n < 1); 51233#L10 assume !(1 == ~n); 51206#L13 call #t~ret0 := fibo2(~n - 1);< 51207#fibo2ENTRY ~n := #in~n; 51397#L18 assume !(~n < 1); 51395#L20 assume 1 == ~n;#res := 1; 51396#fibo2FINAL assume true; 51432#fibo2EXIT >#49#return; 51428#L13-1 call #t~ret1 := fibo2(~n - 2);< 51430#fibo2ENTRY ~n := #in~n; 51436#L18 assume ~n < 1;#res := 0; 51433#fibo2FINAL assume true; 51426#fibo2EXIT >#51#return; 51429#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51607#fibo1FINAL assume true; 51608#fibo1EXIT >#45#return; 51528#L23-1 call #t~ret3 := fibo1(~n - 2);< 51722#fibo1ENTRY ~n := #in~n; 51718#L8 assume !(~n < 1); 51715#L10 assume 1 == ~n;#res := 1; 51716#fibo1FINAL assume true; 51526#fibo1EXIT >#47#return; 51240#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51227#fibo2FINAL assume true; 51228#fibo2EXIT >#49#return; 51193#L13-1 call #t~ret1 := fibo2(~n - 2);< 51201#fibo2ENTRY ~n := #in~n; 53385#L18 assume !(~n < 1); 51500#L20 assume !(1 == ~n); 51495#L23 call #t~ret2 := fibo1(~n - 1);< 51498#fibo1ENTRY ~n := #in~n; 51520#L8 assume !(~n < 1); 51507#L10 assume 1 == ~n;#res := 1; 51508#fibo1FINAL assume true; 51494#fibo1EXIT >#45#return; 51496#L23-1 call #t~ret3 := fibo1(~n - 2);< 51711#fibo1ENTRY ~n := #in~n; 51708#L8 assume ~n < 1;#res := 0; 51619#fibo1FINAL assume true; 51620#fibo1EXIT >#47#return; 51239#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51214#fibo2FINAL assume true; 51192#fibo2EXIT >#51#return; 51188#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51182#fibo1FINAL assume true; 51174#fibo1EXIT >#45#return; 51169#L23-1 call #t~ret3 := fibo1(~n - 2);< 51173#fibo1ENTRY ~n := #in~n; 51287#L8 assume !(~n < 1); 51286#L10 assume !(1 == ~n); 51282#L13 call #t~ret0 := fibo2(~n - 1);< 51283#fibo2ENTRY ~n := #in~n; 51304#L18 assume !(~n < 1); 51303#L20 assume !(1 == ~n); 51300#L23 call #t~ret2 := fibo1(~n - 1);< 51302#fibo1ENTRY ~n := #in~n; 51309#L8 assume !(~n < 1); 51308#L10 assume 1 == ~n;#res := 1; 51305#fibo1FINAL assume true; 51299#fibo1EXIT >#45#return; 51297#L23-1 call #t~ret3 := fibo1(~n - 2);< 51298#fibo1ENTRY ~n := #in~n; 51311#L8 assume ~n < 1;#res := 0; 51310#fibo1FINAL assume true; 51295#fibo1EXIT >#47#return; 51292#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51289#fibo2FINAL assume true; 51281#fibo2EXIT >#49#return; 51272#L13-1 call #t~ret1 := fibo2(~n - 2);< 51275#fibo2ENTRY ~n := #in~n; 51284#L18 assume !(~n < 1); 51280#L20 assume 1 == ~n;#res := 1; 51277#fibo2FINAL assume true; 51271#fibo2EXIT >#51#return; 51274#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51276#fibo1FINAL assume true; 51167#fibo1EXIT >#47#return; 51166#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51165#fibo2FINAL assume true; 51161#fibo2EXIT >#49#return; 51064#L13-1 call #t~ret1 := fibo2(~n - 2);< 51160#fibo2ENTRY ~n := #in~n; 51157#L18 assume !(~n < 1); 51158#L20 assume !(1 == ~n); 51094#L23 call #t~ret2 := fibo1(~n - 1);< 51637#fibo1ENTRY ~n := #in~n; 51186#L8 assume !(~n < 1); 51187#L10 assume !(1 == ~n); 51131#L13 call #t~ret0 := fibo2(~n - 1);< 51862#fibo2ENTRY ~n := #in~n; 51156#L18 assume !(~n < 1); 51130#L20 assume !(1 == ~n); 51132#L23 call #t~ret2 := fibo1(~n - 1);< 51907#fibo1ENTRY ~n := #in~n; 51920#L8 assume !(~n < 1); 51916#L10 assume 1 == ~n;#res := 1; 51913#fibo1FINAL assume true; 51906#fibo1EXIT >#45#return; 51895#L23-1 call #t~ret3 := fibo1(~n - 2);< 51896#fibo1ENTRY ~n := #in~n; 51905#L8 assume ~n < 1;#res := 0; 51904#fibo1FINAL assume true; 51894#fibo1EXIT >#47#return; 51891#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51888#fibo2FINAL assume true; 51885#fibo2EXIT >#49#return; 51878#L13-1 call #t~ret1 := fibo2(~n - 2);< 51879#fibo2ENTRY ~n := #in~n; 51928#L18 assume !(~n < 1); 51926#L20 assume 1 == ~n;#res := 1; 51924#fibo2FINAL assume true; 51877#fibo2EXIT >#51#return; 51875#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51873#fibo1FINAL assume true; 51871#fibo1EXIT >#45#return; 51090#L23-1 call #t~ret3 := fibo1(~n - 2);< 51747#fibo1ENTRY ~n := #in~n; 52087#L8 assume !(~n < 1); 52086#L10 assume !(1 == ~n); 51089#L13 call #t~ret0 := fibo2(~n - 1);< 51091#fibo2ENTRY ~n := #in~n; 51112#L18 assume !(~n < 1); 51125#L20 assume 1 == ~n;#res := 1; 51126#fibo2FINAL assume true; 51117#fibo2EXIT >#49#return; 51118#L13-1 call #t~ret1 := fibo2(~n - 2);< 51944#fibo2ENTRY ~n := #in~n; 51945#L18 assume ~n < 1;#res := 0; 51670#fibo2FINAL assume true; 51943#fibo2EXIT >#51#return; 51938#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51937#fibo1FINAL assume true; 51746#fibo1EXIT >#47#return; 51745#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51743#fibo2FINAL assume true; 51741#fibo2EXIT >#51#return; 51101#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51105#fibo1FINAL assume true; 51632#fibo1EXIT >#45#return; 51104#L23-1 call #t~ret3 := fibo1(~n - 2);< 51633#fibo1ENTRY [2019-12-07 18:27:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash 535019962, now seen corresponding path program 2 times [2019-12-07 18:27:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:05,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979634544] [2019-12-07 18:27:05,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 724 proven. 685 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2019-12-07 18:27:05,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979634544] [2019-12-07 18:27:05,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971754192] [2019-12-07 18:27:05,995 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:06,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:27:06,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:06,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:27:06,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 1271 proven. 160 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2019-12-07 18:27:06,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:06,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 31 [2019-12-07 18:27:06,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445769782] [2019-12-07 18:27:06,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:27:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1921463404, now seen corresponding path program 1 times [2019-12-07 18:27:06,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:06,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262762153] [2019-12-07 18:27:06,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 249 proven. 621 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2019-12-07 18:27:06,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262762153] [2019-12-07 18:27:06,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821174622] [2019-12-07 18:27:06,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 18:27:06,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 189 proven. 573 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-12-07 18:27:06,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:06,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 32 [2019-12-07 18:27:06,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694168331] [2019-12-07 18:27:06,735 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:27:06,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:27:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:27:06,736 INFO L87 Difference]: Start difference. First operand 2337 states and 2749 transitions. cyclomatic complexity: 422 Second operand 32 states. [2019-12-07 18:27:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:07,354 INFO L93 Difference]: Finished difference Result 3804 states and 4737 transitions. [2019-12-07 18:27:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:27:07,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3804 states and 4737 transitions. [2019-12-07 18:27:07,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-12-07 18:27:07,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3804 states to 3153 states and 3819 transitions. [2019-12-07 18:27:07,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2019-12-07 18:27:07,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-12-07 18:27:07,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3153 states and 3819 transitions. [2019-12-07 18:27:07,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:27:07,410 INFO L688 BuchiCegarLoop]: Abstraction has 3153 states and 3819 transitions. [2019-12-07 18:27:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states and 3819 transitions. [2019-12-07 18:27:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2767. [2019-12-07 18:27:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2767 states. [2019-12-07 18:27:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 3257 transitions. [2019-12-07 18:27:07,450 INFO L711 BuchiCegarLoop]: Abstraction has 2767 states and 3257 transitions. [2019-12-07 18:27:07,450 INFO L591 BuchiCegarLoop]: Abstraction has 2767 states and 3257 transitions. [2019-12-07 18:27:07,450 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 18:27:07,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2767 states and 3257 transitions. [2019-12-07 18:27:07,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-12-07 18:27:07,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:27:07,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:27:07,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 30, 29, 25, 25, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 10, 9, 7, 5, 1, 1] [2019-12-07 18:27:07,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [24, 23, 22, 21, 19, 18, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 7, 7, 6, 3] [2019-12-07 18:27:07,459 INFO L794 eck$LassoCheckResult]: Stem: 61062#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 61031#L37 call main_#t~ret4 := fibo1(main_~x~0);< 61032#fibo1ENTRY ~n := #in~n; 61316#L8 assume !(~n < 1); 61314#L10 assume !(1 == ~n); 61210#L13 call #t~ret0 := fibo2(~n - 1);< 61211#fibo2ENTRY ~n := #in~n; 61243#L18 assume !(~n < 1); 61242#L20 assume !(1 == ~n); 61240#L23 call #t~ret2 := fibo1(~n - 1);< 61241#fibo1ENTRY ~n := #in~n; 62049#L8 assume !(~n < 1); 62048#L10 assume !(1 == ~n); 62045#L13 call #t~ret0 := fibo2(~n - 1);< 62047#fibo2ENTRY ~n := #in~n; 62046#L18 assume !(~n < 1); 62044#L20 assume !(1 == ~n); 62036#L23 call #t~ret2 := fibo1(~n - 1);< 62039#fibo1ENTRY ~n := #in~n; 62040#L8 assume !(~n < 1); 62035#L10 assume !(1 == ~n); 61002#L13 call #t~ret0 := fibo2(~n - 1);< 61903#fibo2ENTRY ~n := #in~n; 61899#L18 assume !(~n < 1); 61897#L20 assume !(1 == ~n); 61077#L23 call #t~ret2 := fibo1(~n - 1);< 62042#fibo1ENTRY ~n := #in~n; 61076#L8 assume !(~n < 1); 61078#L10 assume !(1 == ~n); 63196#L13 call #t~ret0 := fibo2(~n - 1);< 63197#fibo2ENTRY ~n := #in~n; 63201#L18 assume !(~n < 1); 63200#L20 assume 1 == ~n;#res := 1; 63199#fibo2FINAL assume true; 63195#fibo2EXIT >#49#return; 63192#L13-1 call #t~ret1 := fibo2(~n - 2);< 63193#fibo2ENTRY ~n := #in~n; 63198#L18 assume ~n < 1;#res := 0; 63194#fibo2FINAL assume true; 63191#fibo2EXIT >#51#return; 63190#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 63189#fibo1FINAL assume true; 63188#fibo1EXIT >#45#return; 63175#L23-1 call #t~ret3 := fibo1(~n - 2);< 63176#fibo1ENTRY ~n := #in~n; 63187#L8 assume !(~n < 1); 63185#L10 assume 1 == ~n;#res := 1; 63182#fibo1FINAL assume true; 63174#fibo1EXIT >#47#return; 63173#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 63169#fibo2FINAL assume true; 63167#fibo2EXIT >#49#return; 63156#L13-1 call #t~ret1 := fibo2(~n - 2);< 63165#fibo2ENTRY ~n := #in~n; 63561#L18 assume !(~n < 1); 63560#L20 assume !(1 == ~n); 63179#L23 call #t~ret2 := fibo1(~n - 1);< 63181#fibo1ENTRY ~n := #in~n; 63202#L8 assume !(~n < 1); 63186#L10 assume 1 == ~n;#res := 1; 63184#fibo1FINAL assume true; 63178#fibo1EXIT >#45#return; 63171#L23-1 call #t~ret3 := fibo1(~n - 2);< 63172#fibo1ENTRY ~n := #in~n; 63183#L8 assume ~n < 1;#res := 0; 63177#fibo1FINAL assume true; 63170#fibo1EXIT >#47#return; 63168#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 63166#fibo2FINAL assume true; 63153#fibo2EXIT >#51#return; 63152#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 63151#fibo1FINAL assume true; 62137#fibo1EXIT >#45#return; 62134#L23-1 call #t~ret3 := fibo1(~n - 2);< 62135#fibo1ENTRY ~n := #in~n; 63068#L8 assume !(~n < 1); 63065#L10 assume !(1 == ~n); 62848#L13 call #t~ret0 := fibo2(~n - 1);< 62849#fibo2ENTRY ~n := #in~n; 62964#L18 assume !(~n < 1); 62962#L20 assume !(1 == ~n); 62871#L23 call #t~ret2 := fibo1(~n - 1);< 62872#fibo1ENTRY ~n := #in~n; 62971#L8 assume !(~n < 1); 62880#L10 assume 1 == ~n;#res := 1; 62879#fibo1FINAL assume true; 62870#fibo1EXIT >#45#return; 62866#L23-1 call #t~ret3 := fibo1(~n - 2);< 62867#fibo1ENTRY ~n := #in~n; 62878#L8 assume ~n < 1;#res := 0; 62869#fibo1FINAL assume true; 62865#fibo1EXIT >#47#return; 62864#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62862#fibo2FINAL assume true; 62847#fibo2EXIT >#49#return; 62842#L13-1 call #t~ret1 := fibo2(~n - 2);< 62843#fibo2ENTRY ~n := #in~n; 62894#L18 assume !(~n < 1); 62892#L20 assume 1 == ~n;#res := 1; 62856#fibo2FINAL assume true; 62841#fibo2EXIT >#51#return; 62839#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62827#fibo1FINAL assume true; 62822#fibo1EXIT >#47#return; 62807#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62122#fibo2FINAL assume true; 62123#fibo2EXIT >#49#return; 62099#L13-1 call #t~ret1 := fibo2(~n - 2);< 62100#fibo2ENTRY ~n := #in~n; 62863#L18 assume !(~n < 1); 62861#L20 assume !(1 == ~n); 62833#L23 call #t~ret2 := fibo1(~n - 1);< 62834#fibo1ENTRY ~n := #in~n; 63064#L8 assume !(~n < 1); 63063#L10 assume !(1 == ~n); 62737#L13 call #t~ret0 := fibo2(~n - 1);< 62852#fibo2ENTRY ~n := #in~n; 62968#L18 assume !(~n < 1); 62966#L20 assume !(1 == ~n); 62885#L23 call #t~ret2 := fibo1(~n - 1);< 62887#fibo1ENTRY ~n := #in~n; 62974#L8 assume !(~n < 1); 62890#L10 assume 1 == ~n;#res := 1; 62889#fibo1FINAL assume true; 62884#fibo1EXIT >#45#return; 62874#L23-1 call #t~ret3 := fibo1(~n - 2);< 62877#fibo1ENTRY ~n := #in~n; 62888#L8 assume ~n < 1;#res := 0; 62881#fibo1FINAL assume true; 62873#fibo1EXIT >#47#return; 62868#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62853#fibo2FINAL assume true; 62851#fibo2EXIT >#49#return; 62845#L13-1 call #t~ret1 := fibo2(~n - 2);< 62846#fibo2ENTRY ~n := #in~n; 62860#L18 assume !(~n < 1); 62859#L20 assume 1 == ~n;#res := 1; 62858#fibo2FINAL assume true; 62844#fibo2EXIT >#51#return; 62840#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62838#fibo1FINAL assume true; 62832#fibo1EXIT >#45#return; 62700#L23-1 call #t~ret3 := fibo1(~n - 2);< 62702#fibo1ENTRY ~n := #in~n; 62837#L8 assume !(~n < 1); 62835#L10 assume !(1 == ~n); 62731#L13 call #t~ret0 := fibo2(~n - 1);< 62732#fibo2ENTRY ~n := #in~n; 62831#L18 assume !(~n < 1); 62734#L20 assume 1 == ~n;#res := 1; 62733#fibo2FINAL assume true; 62730#fibo2EXIT >#49#return; 62713#L13-1 call #t~ret1 := fibo2(~n - 2);< 62714#fibo2ENTRY ~n := #in~n; 62728#L18 assume ~n < 1;#res := 0; 62727#fibo2FINAL assume true; 62712#fibo2EXIT >#51#return; 62707#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62705#fibo1FINAL assume true; 62699#fibo1EXIT >#47#return; 62565#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62451#fibo2FINAL assume true; 62456#fibo2EXIT >#51#return; 62094#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62093#fibo1FINAL assume true; 61239#fibo1EXIT >#45#return; 61050#L23-1 call #t~ret3 := fibo1(~n - 2);< 61238#fibo1ENTRY ~n := #in~n; 61256#L8 assume !(~n < 1); 61252#L10 assume !(1 == ~n); 61011#L13 call #t~ret0 := fibo2(~n - 1);< 61098#fibo2ENTRY ~n := #in~n; 61122#L18 assume !(~n < 1); 61119#L20 assume !(1 == ~n); 61036#L23 call #t~ret2 := fibo1(~n - 1);< 61117#fibo1ENTRY ~n := #in~n; 61857#L8 assume !(~n < 1); 61854#L10 assume !(1 == ~n); 61847#L13 call #t~ret0 := fibo2(~n - 1);< 61848#fibo2ENTRY ~n := #in~n; 61864#L18 assume !(~n < 1); 61860#L20 assume 1 == ~n;#res := 1; 61853#fibo2FINAL assume true; 61845#fibo2EXIT >#49#return; 61841#L13-1 call #t~ret1 := fibo2(~n - 2);< 61843#fibo2ENTRY ~n := #in~n; 61849#L18 assume ~n < 1;#res := 0; 61844#fibo2FINAL assume true; 61839#fibo2EXIT >#51#return; 61837#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61838#fibo1FINAL assume true; 61035#fibo1EXIT >#45#return; 61026#L23-1 call #t~ret3 := fibo1(~n - 2);< 61057#fibo1ENTRY ~n := #in~n; 61058#L8 assume !(~n < 1); 61025#L10 assume 1 == ~n;#res := 1; 61027#fibo1FINAL assume true; 61280#fibo1EXIT >#47#return; 61276#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61269#fibo2FINAL assume true; 61250#fibo2EXIT >#49#return; 61247#L13-1 call #t~ret1 := fibo2(~n - 2);< 61131#fibo2ENTRY ~n := #in~n; 61428#L18 assume !(~n < 1); 61426#L20 assume !(1 == ~n); 61345#L23 call #t~ret2 := fibo1(~n - 1);< 61347#fibo1ENTRY ~n := #in~n; 61887#L8 assume !(~n < 1); 61355#L10 assume 1 == ~n;#res := 1; 61352#fibo1FINAL assume true; 61344#fibo1EXIT >#45#return; 61332#L23-1 call #t~ret3 := fibo1(~n - 2);< 61335#fibo1ENTRY ~n := #in~n; 61350#L8 assume ~n < 1;#res := 0; 61339#fibo1FINAL assume true; 61331#fibo1EXIT >#47#return; 61325#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61321#fibo2FINAL assume true; 61246#fibo2EXIT >#51#return; 61245#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61244#fibo1FINAL assume true; 61237#fibo1EXIT >#47#return; 61120#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61216#fibo2FINAL assume true; 61209#fibo2EXIT >#49#return; 61118#L13-1 call #t~ret1 := fibo2(~n - 2);< 61207#fibo2ENTRY ~n := #in~n; 61167#L18 assume !(~n < 1); 61150#L20 assume !(1 == ~n); 61051#L23 call #t~ret2 := fibo1(~n - 1);< 61121#fibo1ENTRY ~n := #in~n; 61306#L8 assume !(~n < 1); 61302#L10 assume !(1 == ~n); 61070#L13 call #t~ret0 := fibo2(~n - 1);< 61255#fibo2ENTRY ~n := #in~n; 61282#L18 assume !(~n < 1); 61279#L20 assume !(1 == ~n); 61272#L23 call #t~ret2 := fibo1(~n - 1);< 61275#fibo1ENTRY ~n := #in~n; 61305#L8 assume !(~n < 1); 61301#L10 assume !(1 == ~n); 61294#L13 call #t~ret0 := fibo2(~n - 1);< 61296#fibo2ENTRY ~n := #in~n; 61304#L18 assume !(~n < 1); 61299#L20 assume !(1 == ~n); 61291#L23 call #t~ret2 := fibo1(~n - 1);< 61308#fibo1ENTRY ~n := #in~n; 61307#L8 assume !(~n < 1); 61303#L10 assume !(1 == ~n); 61295#L13 call #t~ret0 := fibo2(~n - 1);< 61296#fibo2ENTRY ~n := #in~n; 61304#L18 assume !(~n < 1); 61299#L20 assume 1 == ~n;#res := 1; 61298#fibo2FINAL assume true; 61293#fibo2EXIT >#49#return; 61284#L13-1 call #t~ret1 := fibo2(~n - 2);< 61287#fibo2ENTRY ~n := #in~n; 61297#L18 assume ~n < 1;#res := 0; 61288#fibo2FINAL assume true; 61283#fibo2EXIT >#51#return; 61286#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61554#fibo1FINAL assume true; 61551#fibo1EXIT >#45#return; 61542#L23-1 call #t~ret3 := fibo1(~n - 2);< 61547#fibo1ENTRY ~n := #in~n; 61556#L8 assume !(~n < 1); 61553#L10 assume 1 == ~n;#res := 1; 61550#fibo1FINAL assume true; 61541#fibo1EXIT >#47#return; 61545#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61781#fibo2FINAL assume true; 61777#fibo2EXIT >#49#return; 61516#L13-1 call #t~ret1 := fibo2(~n - 2);< 61524#fibo2ENTRY ~n := #in~n; 61560#L18 assume !(~n < 1); 61640#L20 assume !(1 == ~n); 61538#L23 call #t~ret2 := fibo1(~n - 1);< 61540#fibo1ENTRY ~n := #in~n; 61829#L8 assume !(~n < 1); 61552#L10 assume 1 == ~n;#res := 1; 61549#fibo1FINAL assume true; 61537#fibo1EXIT >#45#return; 61533#L23-1 call #t~ret3 := fibo1(~n - 2);< 61534#fibo1ENTRY ~n := #in~n; 61548#L8 assume ~n < 1;#res := 0; 61536#fibo1FINAL assume true; 61532#fibo1EXIT >#47#return; 61530#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61525#fibo2FINAL assume true; 61514#fibo2EXIT >#51#return; 61523#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62034#fibo1FINAL assume true; 62033#fibo1EXIT >#45#return; 61678#L23-1 call #t~ret3 := fibo1(~n - 2);< 62032#fibo1ENTRY ~n := #in~n; 62140#L8 assume !(~n < 1); 61975#L10 assume !(1 == ~n); 61916#L13 call #t~ret0 := fibo2(~n - 1);< 61920#fibo2ENTRY ~n := #in~n; 61981#L18 assume !(~n < 1); 61979#L20 assume !(1 == ~n); 61937#L23 call #t~ret2 := fibo1(~n - 1);< 61939#fibo1ENTRY ~n := #in~n; 62015#L8 assume !(~n < 1); 61977#L10 assume 1 == ~n;#res := 1; 61976#fibo1FINAL assume true; 61936#fibo1EXIT >#45#return; 61930#L23-1 call #t~ret3 := fibo1(~n - 2);< 61932#fibo1ENTRY ~n := #in~n; 61946#L8 assume ~n < 1;#res := 0; 61944#fibo1FINAL assume true; 61929#fibo1EXIT >#47#return; 61926#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61922#fibo2FINAL assume true; 61915#fibo2EXIT >#49#return; 61446#L13-1 call #t~ret1 := fibo2(~n - 2);< 61910#fibo2ENTRY ~n := #in~n; 61911#L18 assume !(~n < 1); 62026#L20 assume 1 == ~n;#res := 1; 62025#fibo2FINAL assume true; 62023#fibo2EXIT >#51#return; 62024#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62031#fibo1FINAL assume true; 61675#fibo1EXIT >#47#return; 61681#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62509#fibo2FINAL assume true; 61069#fibo2EXIT >#49#return; 61073#L13-1 call #t~ret1 := fibo2(~n - 2);< 61363#fibo2ENTRY ~n := #in~n; 61685#L18 assume !(~n < 1); 61671#L20 assume !(1 == ~n); 61041#L23 call #t~ret2 := fibo1(~n - 1);< 61563#fibo1ENTRY ~n := #in~n; 61824#L8 assume !(~n < 1); 61823#L10 assume !(1 == ~n); 61038#L13 call #t~ret0 := fibo2(~n - 1);< 61040#fibo2ENTRY ~n := #in~n; 61395#L18 assume !(~n < 1); 61394#L20 assume !(1 == ~n); 61383#L23 call #t~ret2 := fibo1(~n - 1);< 61386#fibo1ENTRY ~n := #in~n; 61396#L8 assume !(~n < 1); 61391#L10 assume 1 == ~n;#res := 1; 61388#fibo1FINAL assume true; 61382#fibo1EXIT >#45#return; 61384#L23-1 call #t~ret3 := fibo1(~n - 2);< 61423#fibo1ENTRY ~n := #in~n; 61427#L8 assume ~n < 1;#res := 0; 61425#fibo1FINAL assume true; 61422#fibo1EXIT >#47#return; 61420#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61419#fibo2FINAL assume true; 61416#fibo2EXIT >#49#return; 61045#L13-1 call #t~ret1 := fibo2(~n - 2);< 61046#fibo2ENTRY ~n := #in~n; 61580#L18 assume !(~n < 1); 61577#L20 assume 1 == ~n;#res := 1; 61574#fibo2FINAL assume true; 61568#fibo2EXIT >#51#return; 61566#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61564#fibo1FINAL assume true; 61561#fibo1EXIT >#45#return; 61366#L23-1 call #t~ret3 := fibo1(~n - 2);< 61367#fibo1ENTRY ~n := #in~n; 61696#L8 assume !(~n < 1); 61695#L10 assume !(1 == ~n); 61374#L13 call #t~ret0 := fibo2(~n - 1);< 61375#fibo2ENTRY ~n := #in~n; 61379#L18 assume !(~n < 1); 61378#L20 assume 1 == ~n;#res := 1; 61377#fibo2FINAL assume true; 61373#fibo2EXIT >#49#return; 61371#L13-1 call #t~ret1 := fibo2(~n - 2);< 61372#fibo2ENTRY ~n := #in~n; 61376#L18 assume ~n < 1;#res := 0; 61172#fibo2FINAL assume true; 61370#fibo2EXIT >#51#return; 61369#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61368#fibo1FINAL assume true; 61365#fibo1EXIT >#47#return; 61364#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61362#fibo2FINAL assume true; 61361#fibo2EXIT >#51#return; 61054#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61049#fibo1FINAL assume true; 61052#fibo1EXIT >#45#return; 61100#L23-1 call #t~ret3 := fibo1(~n - 2);< 61110#fibo1ENTRY [2019-12-07 18:27:07,459 INFO L796 eck$LassoCheckResult]: Loop: 61110#fibo1ENTRY ~n := #in~n; 61105#L8 assume !(~n < 1); 61103#L10 assume !(1 == ~n); 61013#L13 call #t~ret0 := fibo2(~n - 1);< 61098#fibo2ENTRY ~n := #in~n; 61122#L18 assume !(~n < 1); 61119#L20 assume !(1 == ~n); 61036#L23 call #t~ret2 := fibo1(~n - 1);< 61116#fibo1ENTRY ~n := #in~n; 61184#L8 assume !(~n < 1); 61180#L10 assume !(1 == ~n); 61177#L13 call #t~ret0 := fibo2(~n - 1);< 61179#fibo2ENTRY ~n := #in~n; 61236#L18 assume !(~n < 1); 61232#L20 assume !(1 == ~n); 61229#L23 call #t~ret2 := fibo1(~n - 1);< 61230#fibo1ENTRY ~n := #in~n; 61353#L8 assume !(~n < 1); 61349#L10 assume !(1 == ~n); 61337#L13 call #t~ret0 := fibo2(~n - 1);< 61338#fibo2ENTRY ~n := #in~n; 61358#L18 assume !(~n < 1); 61356#L20 assume !(1 == ~n); 61357#L23 call #t~ret2 := fibo1(~n - 1);< 61593#fibo1ENTRY ~n := #in~n; 61597#L8 assume !(~n < 1); 61596#L10 assume 1 == ~n;#res := 1; 61595#fibo1FINAL assume true; 61592#fibo1EXIT >#45#return; 61584#L23-1 call #t~ret3 := fibo1(~n - 2);< 61589#fibo1ENTRY ~n := #in~n; 61594#L8 assume ~n < 1;#res := 0; 61590#fibo1FINAL assume true; 61583#fibo1EXIT >#47#return; 61587#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62449#fibo2FINAL assume true; 62447#fibo2EXIT >#49#return; 62444#L13-1 call #t~ret1 := fibo2(~n - 2);< 62445#fibo2ENTRY ~n := #in~n; 62450#L18 assume !(~n < 1); 62448#L20 assume 1 == ~n;#res := 1; 62446#fibo2FINAL assume true; 62443#fibo2EXIT >#51#return; 62442#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62441#fibo1FINAL assume true; 62440#fibo1EXIT >#45#return; 62435#L23-1 call #t~ret3 := fibo1(~n - 2);< 62439#fibo1ENTRY ~n := #in~n; 62478#L8 assume !(~n < 1); 62476#L10 assume !(1 == ~n); 62470#L13 call #t~ret0 := fibo2(~n - 1);< 62471#fibo2ENTRY ~n := #in~n; 62479#L18 assume !(~n < 1); 62477#L20 assume 1 == ~n;#res := 1; 62475#fibo2FINAL assume true; 62469#fibo2EXIT >#49#return; 62464#L13-1 call #t~ret1 := fibo2(~n - 2);< 62466#fibo2ENTRY ~n := #in~n; 62473#L18 assume ~n < 1;#res := 0; 62468#fibo2FINAL assume true; 62463#fibo2EXIT >#51#return; 62461#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62457#fibo1FINAL assume true; 62432#fibo1EXIT >#47#return; 62437#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 63209#fibo2FINAL assume true; 63206#fibo2EXIT >#49#return; 61135#L13-1 call #t~ret1 := fibo2(~n - 2);< 61149#fibo2ENTRY ~n := #in~n; 62092#L18 assume !(~n < 1); 63231#L20 assume !(1 == ~n); 61164#L23 call #t~ret2 := fibo1(~n - 1);< 61166#fibo1ENTRY ~n := #in~n; 62095#L8 assume !(~n < 1); 61173#L10 assume 1 == ~n;#res := 1; 61170#fibo1FINAL assume true; 61163#fibo1EXIT >#45#return; 61159#L23-1 call #t~ret3 := fibo1(~n - 2);< 61162#fibo1ENTRY ~n := #in~n; 61200#L8 assume ~n < 1;#res := 0; 61181#fibo1FINAL assume true; 61158#fibo1EXIT >#47#return; 61156#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61146#fibo2FINAL assume true; 61133#fibo2EXIT >#51#return; 61140#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62166#fibo1FINAL assume true; 61115#fibo1EXIT >#45#return; 61088#L23-1 call #t~ret3 := fibo1(~n - 2);< 61111#fibo1ENTRY ~n := #in~n; 61257#L8 assume !(~n < 1); 61087#L10 assume !(1 == ~n); 61064#L13 call #t~ret0 := fibo2(~n - 1);< 61063#fibo2ENTRY ~n := #in~n; 61065#L18 assume !(~n < 1); 61080#L20 assume !(1 == ~n); 61081#L23 call #t~ret2 := fibo1(~n - 1);< 61199#fibo1ENTRY ~n := #in~n; 61909#L8 assume !(~n < 1); 61204#L10 assume 1 == ~n;#res := 1; 61201#fibo1FINAL assume true; 61197#fibo1EXIT >#45#return; 61190#L23-1 call #t~ret3 := fibo1(~n - 2);< 61193#fibo1ENTRY ~n := #in~n; 61208#L8 assume ~n < 1;#res := 0; 61206#fibo1FINAL assume true; 61189#fibo1EXIT >#47#return; 61175#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61174#fibo2FINAL assume true; 61157#fibo2EXIT >#49#return; 61152#L13-1 call #t~ret1 := fibo2(~n - 2);< 61155#fibo2ENTRY ~n := #in~n; 61171#L18 assume !(~n < 1); 61169#L20 assume 1 == ~n;#res := 1; 61168#fibo2FINAL assume true; 61151#fibo2EXIT >#51#return; 61123#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61112#fibo1FINAL assume true; 61109#fibo1EXIT >#47#return; 61104#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61102#fibo2FINAL assume true; 61096#fibo2EXIT >#49#return; 61008#L13-1 call #t~ret1 := fibo2(~n - 2);< 61095#fibo2ENTRY ~n := #in~n; 61094#L18 assume !(~n < 1); 61093#L20 assume !(1 == ~n); 61039#L23 call #t~ret2 := fibo1(~n - 1);< 61092#fibo1ENTRY ~n := #in~n; 61091#L8 assume !(~n < 1); 61090#L10 assume !(1 == ~n); 61071#L13 call #t~ret0 := fibo2(~n - 1);< 61255#fibo2ENTRY ~n := #in~n; 61282#L18 assume !(~n < 1); 61279#L20 assume !(1 == ~n); 61272#L23 call #t~ret2 := fibo1(~n - 1);< 61275#fibo1ENTRY ~n := #in~n; 61305#L8 assume !(~n < 1); 61301#L10 assume !(1 == ~n); 61294#L13 call #t~ret0 := fibo2(~n - 1);< 61296#fibo2ENTRY ~n := #in~n; 61304#L18 assume !(~n < 1); 61299#L20 assume !(1 == ~n); 61291#L23 call #t~ret2 := fibo1(~n - 1);< 61308#fibo1ENTRY ~n := #in~n; 61307#L8 assume !(~n < 1); 61303#L10 assume !(1 == ~n); 61295#L13 call #t~ret0 := fibo2(~n - 1);< 61296#fibo2ENTRY ~n := #in~n; 61304#L18 assume !(~n < 1); 61299#L20 assume 1 == ~n;#res := 1; 61298#fibo2FINAL assume true; 61293#fibo2EXIT >#49#return; 61284#L13-1 call #t~ret1 := fibo2(~n - 2);< 61287#fibo2ENTRY ~n := #in~n; 61297#L18 assume ~n < 1;#res := 0; 61288#fibo2FINAL assume true; 61283#fibo2EXIT >#51#return; 61286#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61554#fibo1FINAL assume true; 61551#fibo1EXIT >#45#return; 61542#L23-1 call #t~ret3 := fibo1(~n - 2);< 61547#fibo1ENTRY ~n := #in~n; 61556#L8 assume !(~n < 1); 61553#L10 assume 1 == ~n;#res := 1; 61550#fibo1FINAL assume true; 61541#fibo1EXIT >#47#return; 61545#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61781#fibo2FINAL assume true; 61777#fibo2EXIT >#49#return; 61516#L13-1 call #t~ret1 := fibo2(~n - 2);< 61524#fibo2ENTRY ~n := #in~n; 61560#L18 assume !(~n < 1); 61640#L20 assume !(1 == ~n); 61538#L23 call #t~ret2 := fibo1(~n - 1);< 61540#fibo1ENTRY ~n := #in~n; 61829#L8 assume !(~n < 1); 61552#L10 assume 1 == ~n;#res := 1; 61549#fibo1FINAL assume true; 61537#fibo1EXIT >#45#return; 61533#L23-1 call #t~ret3 := fibo1(~n - 2);< 61534#fibo1ENTRY ~n := #in~n; 61548#L8 assume ~n < 1;#res := 0; 61536#fibo1FINAL assume true; 61532#fibo1EXIT >#47#return; 61530#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61525#fibo2FINAL assume true; 61514#fibo2EXIT >#51#return; 61523#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62034#fibo1FINAL assume true; 62033#fibo1EXIT >#45#return; 61678#L23-1 call #t~ret3 := fibo1(~n - 2);< 62032#fibo1ENTRY ~n := #in~n; 62140#L8 assume !(~n < 1); 61975#L10 assume !(1 == ~n); 61916#L13 call #t~ret0 := fibo2(~n - 1);< 61920#fibo2ENTRY ~n := #in~n; 61981#L18 assume !(~n < 1); 61979#L20 assume !(1 == ~n); 61937#L23 call #t~ret2 := fibo1(~n - 1);< 61939#fibo1ENTRY ~n := #in~n; 62015#L8 assume !(~n < 1); 61977#L10 assume 1 == ~n;#res := 1; 61976#fibo1FINAL assume true; 61936#fibo1EXIT >#45#return; 61930#L23-1 call #t~ret3 := fibo1(~n - 2);< 61932#fibo1ENTRY ~n := #in~n; 61946#L8 assume ~n < 1;#res := 0; 61944#fibo1FINAL assume true; 61929#fibo1EXIT >#47#return; 61926#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61922#fibo2FINAL assume true; 61915#fibo2EXIT >#49#return; 61446#L13-1 call #t~ret1 := fibo2(~n - 2);< 61910#fibo2ENTRY ~n := #in~n; 61911#L18 assume !(~n < 1); 62026#L20 assume 1 == ~n;#res := 1; 62025#fibo2FINAL assume true; 62023#fibo2EXIT >#51#return; 62024#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62031#fibo1FINAL assume true; 61675#fibo1EXIT >#47#return; 61681#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62509#fibo2FINAL assume true; 61069#fibo2EXIT >#49#return; 61072#L13-1 call #t~ret1 := fibo2(~n - 2);< 61363#fibo2ENTRY ~n := #in~n; 61685#L18 assume !(~n < 1); 61671#L20 assume !(1 == ~n); 61041#L23 call #t~ret2 := fibo1(~n - 1);< 61563#fibo1ENTRY ~n := #in~n; 61824#L8 assume !(~n < 1); 61823#L10 assume !(1 == ~n); 61038#L13 call #t~ret0 := fibo2(~n - 1);< 61040#fibo2ENTRY ~n := #in~n; 61395#L18 assume !(~n < 1); 61394#L20 assume !(1 == ~n); 61383#L23 call #t~ret2 := fibo1(~n - 1);< 61386#fibo1ENTRY ~n := #in~n; 61396#L8 assume !(~n < 1); 61391#L10 assume 1 == ~n;#res := 1; 61388#fibo1FINAL assume true; 61382#fibo1EXIT >#45#return; 61384#L23-1 call #t~ret3 := fibo1(~n - 2);< 61423#fibo1ENTRY ~n := #in~n; 61427#L8 assume ~n < 1;#res := 0; 61425#fibo1FINAL assume true; 61422#fibo1EXIT >#47#return; 61420#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61419#fibo2FINAL assume true; 61416#fibo2EXIT >#49#return; 61045#L13-1 call #t~ret1 := fibo2(~n - 2);< 61046#fibo2ENTRY ~n := #in~n; 61580#L18 assume !(~n < 1); 61577#L20 assume 1 == ~n;#res := 1; 61574#fibo2FINAL assume true; 61568#fibo2EXIT >#51#return; 61566#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61564#fibo1FINAL assume true; 61561#fibo1EXIT >#45#return; 61366#L23-1 call #t~ret3 := fibo1(~n - 2);< 61367#fibo1ENTRY ~n := #in~n; 61696#L8 assume !(~n < 1); 61695#L10 assume !(1 == ~n); 61374#L13 call #t~ret0 := fibo2(~n - 1);< 61375#fibo2ENTRY ~n := #in~n; 61379#L18 assume !(~n < 1); 61378#L20 assume 1 == ~n;#res := 1; 61377#fibo2FINAL assume true; 61373#fibo2EXIT >#49#return; 61371#L13-1 call #t~ret1 := fibo2(~n - 2);< 61372#fibo2ENTRY ~n := #in~n; 61376#L18 assume ~n < 1;#res := 0; 61172#fibo2FINAL assume true; 61370#fibo2EXIT >#51#return; 61369#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61368#fibo1FINAL assume true; 61365#fibo1EXIT >#47#return; 61364#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61362#fibo2FINAL assume true; 61361#fibo2EXIT >#51#return; 61097#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62458#fibo1FINAL assume true; 61114#fibo1EXIT >#45#return; 61099#L23-1 call #t~ret3 := fibo1(~n - 2);< 61110#fibo1ENTRY [2019-12-07 18:27:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:07,459 INFO L82 PathProgramCache]: Analyzing trace with hash -100717608, now seen corresponding path program 3 times [2019-12-07 18:27:07,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:07,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087731981] [2019-12-07 18:27:07,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 762 proven. 1188 refuted. 0 times theorem prover too weak. 2900 trivial. 0 not checked. [2019-12-07 18:27:08,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087731981] [2019-12-07 18:27:08,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235952795] [2019-12-07 18:27:08,059 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:08,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-07 18:27:08,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:08,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:27:08,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 590 proven. 181 refuted. 0 times theorem prover too weak. 4079 trivial. 0 not checked. [2019-12-07 18:27:08,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:08,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 35 [2019-12-07 18:27:08,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811874744] [2019-12-07 18:27:08,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:27:08,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash -162680412, now seen corresponding path program 2 times [2019-12-07 18:27:08,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:08,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564078863] [2019-12-07 18:27:08,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 381 proven. 692 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-12-07 18:27:08,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564078863] [2019-12-07 18:27:08,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641864342] [2019-12-07 18:27:08,776 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:08,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:27:08,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:08,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:27:08,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1208 proven. 52 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2019-12-07 18:27:08,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:08,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 34 [2019-12-07 18:27:08,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88662577] [2019-12-07 18:27:08,936 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:27:08,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:08,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 18:27:08,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:27:08,937 INFO L87 Difference]: Start difference. First operand 2767 states and 3257 transitions. cyclomatic complexity: 500 Second operand 34 states. [2019-12-07 18:27:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:09,492 INFO L93 Difference]: Finished difference Result 2905 states and 3408 transitions. [2019-12-07 18:27:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 18:27:09,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2905 states and 3408 transitions. [2019-12-07 18:27:09,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-12-07 18:27:09,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2905 states to 2857 states and 3360 transitions. [2019-12-07 18:27:09,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2019-12-07 18:27:09,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2019-12-07 18:27:09,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2857 states and 3360 transitions. [2019-12-07 18:27:09,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:27:09,515 INFO L688 BuchiCegarLoop]: Abstraction has 2857 states and 3360 transitions. [2019-12-07 18:27:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states and 3360 transitions. [2019-12-07 18:27:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2698. [2019-12-07 18:27:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-12-07 18:27:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3097 transitions. [2019-12-07 18:27:09,549 INFO L711 BuchiCegarLoop]: Abstraction has 2698 states and 3097 transitions. [2019-12-07 18:27:09,549 INFO L591 BuchiCegarLoop]: Abstraction has 2698 states and 3097 transitions. [2019-12-07 18:27:09,549 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 18:27:09,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2698 states and 3097 transitions. [2019-12-07 18:27:09,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-12-07 18:27:09,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:27:09,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:27:09,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 20, 20, 19, 18, 13, 12, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 6, 4, 4, 1, 1] [2019-12-07 18:27:09,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1] [2019-12-07 18:27:09,555 INFO L794 eck$LassoCheckResult]: Stem: 71404#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 71369#L37 call main_#t~ret4 := fibo1(main_~x~0);< 71370#fibo1ENTRY ~n := #in~n; 71750#L8 assume !(~n < 1); 71749#L10 assume !(1 == ~n); 71504#L13 call #t~ret0 := fibo2(~n - 1);< 71505#fibo2ENTRY ~n := #in~n; 71631#L18 assume !(~n < 1); 71629#L20 assume !(1 == ~n); 71626#L23 call #t~ret2 := fibo1(~n - 1);< 71627#fibo1ENTRY ~n := #in~n; 72035#L8 assume !(~n < 1); 72033#L10 assume !(1 == ~n); 72029#L13 call #t~ret0 := fibo2(~n - 1);< 72030#fibo2ENTRY ~n := #in~n; 72283#L18 assume !(~n < 1); 72282#L20 assume !(1 == ~n); 72280#L23 call #t~ret2 := fibo1(~n - 1);< 72281#fibo1ENTRY ~n := #in~n; 72834#L8 assume !(~n < 1); 72827#L10 assume !(1 == ~n); 71348#L13 call #t~ret0 := fibo2(~n - 1);< 72759#fibo2ENTRY ~n := #in~n; 72833#L18 assume !(~n < 1); 72832#L20 assume !(1 == ~n); 72737#L23 call #t~ret2 := fibo1(~n - 1);< 72830#fibo1ENTRY ~n := #in~n; 72831#L8 assume !(~n < 1); 72848#L10 assume !(1 == ~n); 72844#L13 call #t~ret0 := fibo2(~n - 1);< 72845#fibo2ENTRY ~n := #in~n; 72850#L18 assume !(~n < 1); 72849#L20 assume 1 == ~n;#res := 1; 72847#fibo2FINAL assume true; 72843#fibo2EXIT >#49#return; 72840#L13-1 call #t~ret1 := fibo2(~n - 2);< 72841#fibo2ENTRY ~n := #in~n; 72846#L18 assume ~n < 1;#res := 0; 72842#fibo2FINAL assume true; 72839#fibo2EXIT >#51#return; 72838#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72836#fibo1FINAL assume true; 72829#fibo1EXIT >#45#return; 72824#L23-1 call #t~ret3 := fibo1(~n - 2);< 72825#fibo1ENTRY ~n := #in~n; 72837#L8 assume !(~n < 1); 72835#L10 assume 1 == ~n;#res := 1; 72828#fibo1FINAL assume true; 72823#fibo1EXIT >#47#return; 72820#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72818#fibo2FINAL assume true; 72758#fibo2EXIT >#49#return; 72722#L13-1 call #t~ret1 := fibo2(~n - 2);< 72726#fibo2ENTRY ~n := #in~n; 72812#L18 assume !(~n < 1); 72805#L20 assume !(1 == ~n); 72756#L23 call #t~ret2 := fibo1(~n - 1);< 72757#fibo1ENTRY ~n := #in~n; 72796#L8 assume !(~n < 1); 72791#L10 assume 1 == ~n;#res := 1; 72790#fibo1FINAL assume true; 72755#fibo1EXIT >#45#return; 72753#L23-1 call #t~ret3 := fibo1(~n - 2);< 72754#fibo1ENTRY ~n := #in~n; 72799#L8 assume ~n < 1;#res := 0; 72795#fibo1FINAL assume true; 72752#fibo1EXIT >#47#return; 72748#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72733#fibo2FINAL assume true; 72720#fibo2EXIT >#51#return; 72718#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72714#fibo1FINAL assume true; 72713#fibo1EXIT >#45#return; 72160#L23-1 call #t~ret3 := fibo1(~n - 2);< 72161#fibo1ENTRY ~n := #in~n; 72768#L8 assume !(~n < 1); 72767#L10 assume !(1 == ~n); 72765#L13 call #t~ret0 := fibo2(~n - 1);< 72766#fibo2ENTRY ~n := #in~n; 72857#L18 assume !(~n < 1); 72855#L20 assume !(1 == ~n); 72852#L23 call #t~ret2 := fibo1(~n - 1);< 72853#fibo1ENTRY ~n := #in~n; 72858#L8 assume !(~n < 1); 72856#L10 assume 1 == ~n;#res := 1; 72854#fibo1FINAL assume true; 72851#fibo1EXIT >#45#return; 72778#L23-1 call #t~ret3 := fibo1(~n - 2);< 72779#fibo1ENTRY ~n := #in~n; 72787#L8 assume ~n < 1;#res := 0; 72786#fibo1FINAL assume true; 72777#fibo1EXIT >#47#return; 72772#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72770#fibo2FINAL assume true; 72764#fibo2EXIT >#49#return; 72728#L13-1 call #t~ret1 := fibo2(~n - 2);< 72729#fibo2ENTRY ~n := #in~n; 72762#L18 assume !(~n < 1); 72761#L20 assume 1 == ~n;#res := 1; 72760#fibo2FINAL assume true; 72727#fibo2EXIT >#51#return; 72719#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72715#fibo1FINAL assume true; 72708#fibo1EXIT >#47#return; 72149#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72150#fibo2FINAL assume true; 72673#fibo2EXIT >#49#return; 71641#L13-1 call #t~ret1 := fibo2(~n - 2);< 71642#fibo2ENTRY ~n := #in~n; 72742#L18 assume !(~n < 1); 72741#L20 assume !(1 == ~n); 72739#L23 call #t~ret2 := fibo1(~n - 1);< 72740#fibo1ENTRY ~n := #in~n; 72798#L8 assume !(~n < 1); 72794#L10 assume !(1 == ~n); 72705#L13 call #t~ret0 := fibo2(~n - 1);< 72751#fibo2ENTRY ~n := #in~n; 72817#L18 assume !(~n < 1); 72815#L20 assume !(1 == ~n); 72809#L23 call #t~ret2 := fibo1(~n - 1);< 72811#fibo1ENTRY ~n := #in~n; 72822#L8 assume !(~n < 1); 72819#L10 assume 1 == ~n;#res := 1; 72814#fibo1FINAL assume true; 72808#fibo1EXIT >#45#return; 72801#L23-1 call #t~ret3 := fibo1(~n - 2);< 72804#fibo1ENTRY ~n := #in~n; 72813#L8 assume ~n < 1;#res := 0; 72806#fibo1FINAL assume true; 72800#fibo1EXIT >#47#return; 72797#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72792#fibo2FINAL assume true; 72749#fibo2EXIT >#49#return; 72746#L13-1 call #t~ret1 := fibo2(~n - 2);< 72747#fibo2ENTRY ~n := #in~n; 72785#L18 assume !(~n < 1); 72784#L20 assume 1 == ~n;#res := 1; 72783#fibo2FINAL assume true; 72745#fibo2EXIT >#51#return; 72744#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72743#fibo1FINAL assume true; 72738#fibo1EXIT >#45#return; 72731#L23-1 call #t~ret3 := fibo1(~n - 2);< 72732#fibo1ENTRY ~n := #in~n; 72863#L8 assume !(~n < 1); 72861#L10 assume !(1 == ~n); 72781#L13 call #t~ret0 := fibo2(~n - 1);< 72782#fibo2ENTRY ~n := #in~n; 72862#L18 assume !(~n < 1); 72860#L20 assume 1 == ~n;#res := 1; 72859#fibo2FINAL assume true; 72780#fibo2EXIT >#49#return; 72774#L13-1 call #t~ret1 := fibo2(~n - 2);< 72776#fibo2ENTRY ~n := #in~n; 72789#L18 assume ~n < 1;#res := 0; 72788#fibo2FINAL assume true; 72773#fibo2EXIT >#51#return; 72771#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72769#fibo1FINAL assume true; 72730#fibo1EXIT >#47#return; 72677#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72675#fibo2FINAL assume true; 72674#fibo2EXIT >#51#return; 71630#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 71628#fibo1FINAL assume true; 71625#fibo1EXIT >#45#return; 71388#L23-1 call #t~ret3 := fibo1(~n - 2);< 71623#fibo1ENTRY ~n := #in~n; 71657#L8 assume !(~n < 1); 71654#L10 assume !(1 == ~n); 71427#L13 call #t~ret0 := fibo2(~n - 1);< 71431#fibo2ENTRY ~n := #in~n; 71456#L18 assume !(~n < 1); 71453#L20 assume !(1 == ~n); 71449#L23 call #t~ret2 := fibo1(~n - 1);< 71451#fibo1ENTRY ~n := #in~n; 71521#L8 assume !(~n < 1); 71520#L10 assume !(1 == ~n); 71518#L13 call #t~ret0 := fibo2(~n - 1);< 71519#fibo2ENTRY ~n := #in~n; 71546#L18 assume !(~n < 1); 71542#L20 assume !(1 == ~n); 71539#L23 call #t~ret2 := fibo1(~n - 1);< 71541#fibo1ENTRY ~n := #in~n; 71577#L8 assume !(~n < 1); 71574#L10 assume !(1 == ~n); 71570#L13 call #t~ret0 := fibo2(~n - 1);< 71571#fibo2ENTRY ~n := #in~n; 71578#L18 assume !(~n < 1); 71575#L20 assume !(1 == ~n); 71576#L23 call #t~ret2 := fibo1(~n - 1);< 72118#fibo1ENTRY ~n := #in~n; 72188#L8 assume !(~n < 1); 72130#L10 assume 1 == ~n;#res := 1; 72126#fibo1FINAL assume true; 72117#fibo1EXIT >#45#return; 72111#L23-1 call #t~ret3 := fibo1(~n - 2);< 72116#fibo1ENTRY ~n := #in~n; 72121#L8 assume ~n < 1;#res := 0; 72119#fibo1FINAL assume true; 72110#fibo1EXIT >#47#return; 72114#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72446#fibo2FINAL assume true; 72445#fibo2EXIT >#49#return; 72443#L13-1 call #t~ret1 := fibo2(~n - 2);< 72444#fibo2ENTRY ~n := #in~n; 72449#L18 assume !(~n < 1); 72448#L20 assume 1 == ~n;#res := 1; 72447#fibo2FINAL assume true; 72442#fibo2EXIT >#51#return; 72441#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72439#fibo1FINAL assume true; 72436#fibo1EXIT >#45#return; 72354#L23-1 call #t~ret3 := fibo1(~n - 2);< 72357#fibo1ENTRY ~n := #in~n; 72432#L8 assume !(~n < 1); 72430#L10 assume !(1 == ~n); 72427#L13 call #t~ret0 := fibo2(~n - 1);< 72428#fibo2ENTRY ~n := #in~n; 72440#L18 assume !(~n < 1); 72438#L20 assume 1 == ~n;#res := 1; 72437#fibo2FINAL assume true; 72426#fibo2EXIT >#49#return; 72421#L13-1 call #t~ret1 := fibo2(~n - 2);< 72423#fibo2ENTRY ~n := #in~n; 72453#L18 assume ~n < 1;#res := 0; 72452#fibo2FINAL assume true; 72420#fibo2EXIT >#51#return; 72419#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72418#fibo1FINAL assume true; 72351#fibo1EXIT >#47#return; 72356#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73263#fibo2FINAL assume true; 73261#fibo2EXIT >#49#return; 73256#L13-1 call #t~ret1 := fibo2(~n - 2);< 73259#fibo2ENTRY ~n := #in~n; 73291#L18 assume !(~n < 1); 73289#L20 assume !(1 == ~n); 73281#L23 call #t~ret2 := fibo1(~n - 1);< 73282#fibo1ENTRY ~n := #in~n; 73312#L8 assume !(~n < 1); 73311#L10 assume !(1 == ~n); 73303#L13 call #t~ret0 := fibo2(~n - 1);< 73305#fibo2ENTRY ~n := #in~n; 73313#L18 assume !(~n < 1); 73308#L20 assume 1 == ~n;#res := 1; 73307#fibo2FINAL assume true; 73302#fibo2EXIT >#49#return; 73296#L13-1 call #t~ret1 := fibo2(~n - 2);< 73299#fibo2ENTRY ~n := #in~n; 73306#L18 assume ~n < 1;#res := 0; 73301#fibo2FINAL assume true; 73295#fibo2EXIT >#51#return; 73298#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73288#fibo1FINAL assume true; 73280#fibo1EXIT >#45#return; 73274#L23-1 call #t~ret3 := fibo1(~n - 2);< 73277#fibo1ENTRY ~n := #in~n; 73287#L8 assume !(~n < 1); 73283#L10 assume 1 == ~n;#res := 1; 73278#fibo1FINAL assume true; 73273#fibo1EXIT >#47#return; 73271#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73268#fibo2FINAL assume true; 73255#fibo2EXIT >#51#return; 71639#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72897#fibo1FINAL assume true; 71448#fibo1EXIT >#45#return; 71398#L23-1 call #t~ret3 := fibo1(~n - 2);< 71444#fibo1ENTRY ~n := #in~n; 71496#L8 assume !(~n < 1); 71497#L10 assume !(1 == ~n); 71429#L13 [2019-12-07 18:27:09,555 INFO L796 eck$LassoCheckResult]: Loop: 71429#L13 call #t~ret0 := fibo2(~n - 1);< 71431#fibo2ENTRY ~n := #in~n; 71456#L18 assume !(~n < 1); 71453#L20 assume !(1 == ~n); 71449#L23 call #t~ret2 := fibo1(~n - 1);< 71451#fibo1ENTRY ~n := #in~n; 71521#L8 assume !(~n < 1); 71520#L10 assume !(1 == ~n); 71518#L13 call #t~ret0 := fibo2(~n - 1);< 71519#fibo2ENTRY ~n := #in~n; 71546#L18 assume !(~n < 1); 71542#L20 assume !(1 == ~n); 71539#L23 call #t~ret2 := fibo1(~n - 1);< 71541#fibo1ENTRY ~n := #in~n; 71577#L8 assume !(~n < 1); 71574#L10 assume !(1 == ~n); 71570#L13 call #t~ret0 := fibo2(~n - 1);< 71571#fibo2ENTRY ~n := #in~n; 71578#L18 assume !(~n < 1); 71575#L20 assume !(1 == ~n); 71576#L23 call #t~ret2 := fibo1(~n - 1);< 72118#fibo1ENTRY ~n := #in~n; 72188#L8 assume !(~n < 1); 72130#L10 assume 1 == ~n;#res := 1; 72126#fibo1FINAL assume true; 72117#fibo1EXIT >#45#return; 72111#L23-1 call #t~ret3 := fibo1(~n - 2);< 72116#fibo1ENTRY ~n := #in~n; 72121#L8 assume ~n < 1;#res := 0; 72119#fibo1FINAL assume true; 72110#fibo1EXIT >#47#return; 72114#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72446#fibo2FINAL assume true; 72445#fibo2EXIT >#49#return; 72443#L13-1 call #t~ret1 := fibo2(~n - 2);< 72444#fibo2ENTRY ~n := #in~n; 72449#L18 assume !(~n < 1); 72448#L20 assume 1 == ~n;#res := 1; 72447#fibo2FINAL assume true; 72442#fibo2EXIT >#51#return; 72441#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72439#fibo1FINAL assume true; 72436#fibo1EXIT >#45#return; 72354#L23-1 call #t~ret3 := fibo1(~n - 2);< 72357#fibo1ENTRY ~n := #in~n; 72432#L8 assume !(~n < 1); 72430#L10 assume !(1 == ~n); 72427#L13 call #t~ret0 := fibo2(~n - 1);< 72428#fibo2ENTRY ~n := #in~n; 72440#L18 assume !(~n < 1); 72438#L20 assume 1 == ~n;#res := 1; 72437#fibo2FINAL assume true; 72426#fibo2EXIT >#49#return; 72421#L13-1 call #t~ret1 := fibo2(~n - 2);< 72423#fibo2ENTRY ~n := #in~n; 72453#L18 assume ~n < 1;#res := 0; 72452#fibo2FINAL assume true; 72420#fibo2EXIT >#51#return; 72419#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72418#fibo1FINAL assume true; 72351#fibo1EXIT >#47#return; 72356#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73263#fibo2FINAL assume true; 73261#fibo2EXIT >#49#return; 73256#L13-1 call #t~ret1 := fibo2(~n - 2);< 73259#fibo2ENTRY ~n := #in~n; 73291#L18 assume !(~n < 1); 73289#L20 assume !(1 == ~n); 73281#L23 call #t~ret2 := fibo1(~n - 1);< 73282#fibo1ENTRY ~n := #in~n; 73312#L8 assume !(~n < 1); 73311#L10 assume !(1 == ~n); 73303#L13 call #t~ret0 := fibo2(~n - 1);< 73305#fibo2ENTRY ~n := #in~n; 73313#L18 assume !(~n < 1); 73308#L20 assume 1 == ~n;#res := 1; 73307#fibo2FINAL assume true; 73302#fibo2EXIT >#49#return; 73296#L13-1 call #t~ret1 := fibo2(~n - 2);< 73299#fibo2ENTRY ~n := #in~n; 73306#L18 assume ~n < 1;#res := 0; 73301#fibo2FINAL assume true; 73295#fibo2EXIT >#51#return; 73298#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73288#fibo1FINAL assume true; 73280#fibo1EXIT >#45#return; 73274#L23-1 call #t~ret3 := fibo1(~n - 2);< 73277#fibo1ENTRY ~n := #in~n; 73287#L8 assume !(~n < 1); 73283#L10 assume 1 == ~n;#res := 1; 73278#fibo1FINAL assume true; 73273#fibo1EXIT >#47#return; 73271#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73268#fibo2FINAL assume true; 73255#fibo2EXIT >#51#return; 71639#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72897#fibo1FINAL assume true; 71448#fibo1EXIT >#45#return; 71398#L23-1 call #t~ret3 := fibo1(~n - 2);< 71444#fibo1ENTRY ~n := #in~n; 71496#L8 assume !(~n < 1); 71497#L10 assume !(1 == ~n); 71429#L13 [2019-12-07 18:27:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1387384655, now seen corresponding path program 4 times [2019-12-07 18:27:09,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:09,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256983444] [2019-12-07 18:27:09,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 463 proven. 260 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-12-07 18:27:09,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256983444] [2019-12-07 18:27:09,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704602270] [2019-12-07 18:27:09,829 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:09,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:27:09,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:09,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:27:09,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 398 proven. 239 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-12-07 18:27:10,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:10,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 28 [2019-12-07 18:27:10,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973817883] [2019-12-07 18:27:10,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:27:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2000726677, now seen corresponding path program 3 times [2019-12-07 18:27:10,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:10,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111879000] [2019-12-07 18:27:10,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:10,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:27:10,544 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:27:10,544 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:27:10,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:27:10,544 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:27:10,544 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:27:10,544 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:10,544 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:27:10,544 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:27:10,544 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration15_Loop [2019-12-07 18:27:10,544 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:27:10,544 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:27:10,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:10,578 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:27:10,578 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:10,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:10,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:10,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:10,583 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:10,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:10,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:10,589 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:10,589 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:10,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:10,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:10,596 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:10,596 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:10,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:10,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:10,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:27:10,602 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 /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:10,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:27:10,606 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/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-12-07 18:27:10,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:27:10,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:27:12,200 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:27:12,201 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:27:12,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:27:12,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:27:12,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:27:12,202 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:27:12,202 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:27:12,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:27:12,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration15_Loop [2019-12-07 18:27:12,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:27:12,202 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:27:12,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:12,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:12,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-12-07 18:27:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:12,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:12,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-12-07 18:27:12,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-12-07 18:27:12,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:27:12,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:27:12,238 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,240 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-12-07 18:27:12,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:12,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:12,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:12,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:12,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:12,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:12,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:12,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,246 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-12-07 18:27:12,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:12,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:12,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:12,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:12,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:12,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:12,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:12,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,252 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-12-07 18:27:12,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:12,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:12,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:12,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:12,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:12,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:12,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:12,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,259 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-12-07 18:27:12,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:12,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:12,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:12,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:12,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:12,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:12,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:12,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,266 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-12-07 18:27:12,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:12,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:12,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:12,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:12,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:12,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:12,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:12,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,273 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-12-07 18:27:12,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:27:12,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:27:12,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:27:12,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:27:12,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:27:12,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:27:12,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:27:12,278 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:27:12,279 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-12-07 18:27:12,279 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6775e80b-f87a-40db-8bd3-b1128ad5bfe9/bin/uautomizer/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:27:12,282 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:27:12,282 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:27:12,282 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:27:12,282 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-12-07 18:27:12,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:27:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:12,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-07 18:27:12,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:12,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 18:27:12,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 31 proven. 131 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 18:27:12,654 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2019-12-07 18:27:12,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2698 states and 3097 transitions. cyclomatic complexity: 409 Second operand 15 states. [2019-12-07 18:27:13,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2698 states and 3097 transitions. cyclomatic complexity: 409. Second operand 15 states. Result 5897 states and 6736 transitions. Complement of second has 79 states. [2019-12-07 18:27:13,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2019-12-07 18:27:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 18:27:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2019-12-07 18:27:13,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 272 letters. Loop has 102 letters. [2019-12-07 18:27:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:13,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 374 letters. Loop has 102 letters. [2019-12-07 18:27:13,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:13,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 272 letters. Loop has 204 letters. [2019-12-07 18:27:13,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:27:13,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5897 states and 6736 transitions. [2019-12-07 18:27:13,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-12-07 18:27:13,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5897 states to 3928 states and 4485 transitions. [2019-12-07 18:27:13,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-12-07 18:27:13,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2019-12-07 18:27:13,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3928 states and 4485 transitions. [2019-12-07 18:27:13,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:27:13,253 INFO L688 BuchiCegarLoop]: Abstraction has 3928 states and 4485 transitions. [2019-12-07 18:27:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states and 4485 transitions. [2019-12-07 18:27:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3899. [2019-12-07 18:27:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-12-07 18:27:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 4454 transitions. [2019-12-07 18:27:13,296 INFO L711 BuchiCegarLoop]: Abstraction has 3899 states and 4454 transitions. [2019-12-07 18:27:13,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:27:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:27:13,296 INFO L87 Difference]: Start difference. First operand 3899 states and 4454 transitions. Second operand 28 states. [2019-12-07 18:27:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:14,123 INFO L93 Difference]: Finished difference Result 2470 states and 2702 transitions. [2019-12-07 18:27:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 18:27:14,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2470 states and 2702 transitions. [2019-12-07 18:27:14,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:27:14,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2470 states to 0 states and 0 transitions. [2019-12-07 18:27:14,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 18:27:14,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 18:27:14,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 18:27:14,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:27:14,130 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:27:14,130 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:27:14,131 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:27:14,131 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-12-07 18:27:14,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:27:14,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:27:14,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 18:27:14,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 06:27:14 BoogieIcfgContainer [2019-12-07 18:27:14,135 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 18:27:14,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:27:14,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:27:14,136 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:27:14,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:26:45" (3/4) ... [2019-12-07 18:27:14,138 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:27:14,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:27:14,139 INFO L168 Benchmark]: Toolchain (without parser) took 28835.73 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 898.6 MB). Free memory was 947.9 MB in the beginning and 1.2 GB in the end (delta: -243.3 MB). Peak memory consumption was 655.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:14,140 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:14,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:14,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:14,140 INFO L168 Benchmark]: Boogie Preprocessor took 11.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:14,140 INFO L168 Benchmark]: RCFGBuilder took 140.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:14,141 INFO L168 Benchmark]: BuchiAutomizer took 28478.61 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 816.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.2 MB). Peak memory consumption was 685.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:14,141 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.9 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:14,143 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 140.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28478.61 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 816.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.2 MB). Peak memory consumption was 685.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.9 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 21 terminating modules (14 trivial, 3 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 deterministic module has affine ranking function n and consists of 17 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 14 locations. 14 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.4s and 16 iterations. TraceHistogramMax:48. Analysis of lassos took 16.3s. Construction of modules took 4.2s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 20. Automata minimization 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 1844 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 2767 states and ocurred in iteration 13. Nontrivial modules had stage [3, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 200/391 HoareTripleCheckerStatistics: 733 SDtfs, 1863 SDslu, 3574 SDs, 0 SdLazy, 8969 SolverSat, 1547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI8 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf99 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq199 hnf90 smp92 dnf100 smp100 tf109 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 30 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...