./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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 dd317ac0ecdb37853dacea373914a521115465e0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:57:10,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:57:10,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:57:10,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:57:10,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:57:10,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:57:10,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:57:10,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:57:10,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:57:10,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:57:10,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:57:10,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:57:10,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:57:10,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:57:10,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:57:10,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:57:10,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:57:10,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:57:10,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:57:10,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:57:10,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:57:10,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:57:10,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:57:10,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:57:10,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:57:10,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:57:10,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:57:10,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:57:10,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:57:10,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:57:10,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:57:10,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:57:10,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:57:10,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:57:10,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:57:10,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:57:10,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:57:10,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:57:10,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:57:10,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:57:10,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:57:10,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:57:10,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:57:10,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:57:10,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:57:10,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:57:10,767 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:57:10,767 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:57:10,767 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:57:10,768 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:57:10,768 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:57:10,768 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:57:10,768 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:57:10,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:57:10,769 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:57:10,769 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:57:10,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:57:10,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:57:10,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:57:10,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:57:10,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:57:10,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:57:10,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:57:10,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:57:10,771 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:57:10,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:57:10,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:57:10,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:57:10,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:57:10,772 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:57:10,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:57:10,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:57:10,779 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:57:10,780 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:57:10,780 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_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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 -> dd317ac0ecdb37853dacea373914a521115465e0 [2019-11-15 23:57:10,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:57:10,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:57:10,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:57:10,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:57:10,825 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:57:10,826 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10-2.c [2019-11-15 23:57:10,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/data/a98010707/1c19a3b4734d4bf4a4f2ac67f073014b/FLAG0b9c24739 [2019-11-15 23:57:11,280 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:57:11,281 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2019-11-15 23:57:11,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/data/a98010707/1c19a3b4734d4bf4a4f2ac67f073014b/FLAG0b9c24739 [2019-11-15 23:57:11,306 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/data/a98010707/1c19a3b4734d4bf4a4f2ac67f073014b [2019-11-15 23:57:11,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:57:11,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:57:11,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:57:11,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:57:11,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:57:11,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d12a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11, skipping insertion in model container [2019-11-15 23:57:11,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,330 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:57:11,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:57:11,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:57:11,591 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:57:11,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:57:11,617 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:57:11,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11 WrapperNode [2019-11-15 23:57:11,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:57:11,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:57:11,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:57:11,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:57:11,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:57:11,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:57:11,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:57:11,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:57:11,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... [2019-11-15 23:57:11,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:57:11,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:57:11,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:57:11,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:57:11,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:57:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:57:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-15 23:57:11,742 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-15 23:57:11,913 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:57:11,914 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:57:11,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:11 BoogieIcfgContainer [2019-11-15 23:57:11,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:57:11,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:57:11,919 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:57:11,923 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:57:11,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:57:11,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:57:11" (1/3) ... [2019-11-15 23:57:11,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a72c57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:57:11, skipping insertion in model container [2019-11-15 23:57:11,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:57:11,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:11" (2/3) ... [2019-11-15 23:57:11,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a72c57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:57:11, skipping insertion in model container [2019-11-15 23:57:11,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:57:11,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:11" (3/3) ... [2019-11-15 23:57:11,927 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_10-2.c [2019-11-15 23:57:11,996 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:57:11,997 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:57:11,997 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:57:11,997 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:57:11,997 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:57:11,997 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:57:11,998 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:57:11,998 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:57:12,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:57:12,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:12,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:12,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:12,074 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:57:12,074 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:12,074 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:57:12,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:57:12,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:12,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:12,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:12,078 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:57:12,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:12,085 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-11-15 23:57:12,086 INFO L793 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-11-15 23:57:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-11-15 23:57:12,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:12,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185077329] [2019-11-15 23:57:12,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:12,172 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-11-15 23:57:12,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:12,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246230921] [2019-11-15 23:57:12,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:12,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-11-15 23:57:12,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:12,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385176045] [2019-11-15 23:57:12,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:12,204 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:12,305 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:12,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:12,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:12,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:12,306 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:12,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:12,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:12,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:12,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration1_Loop [2019-11-15 23:57:12,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:12,308 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:12,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,415 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:12,416 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:12,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:12,423 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:12,432 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:12,433 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:12,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:12,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:12,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:12,446 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:12,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:12,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:12,458 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:12,458 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:12,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:12,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:12,487 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:12,487 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:12,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:12,494 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:12,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:12,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:12,518 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:12,530 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:12,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:12,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:12,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:12,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:12,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:12,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:12,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:12,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration1_Loop [2019-11-15 23:57:12,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:12,531 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:12,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:12,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-11-15 23:57:12,604 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:12,609 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:12,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:12,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:12,612 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:12,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:12,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:12,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:12,615 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:12,615 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:12,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:12,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:12,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:12,620 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:12,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:12,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:12,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:12,622 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:12,622 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:12,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:12,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:12,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:12,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:12,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:12,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:12,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:12,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:12,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:12,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:12,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:12,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:12,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:12,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:12,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:12,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:12,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:12,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:12,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:12,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:12,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:12,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:12,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:12,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:12,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:12,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:12,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:12,641 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:12,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:12,647 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:12,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:12,661 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:12,662 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:12,662 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 23:57:12,664 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:12,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:57:12,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:12,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:12,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:12,765 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:57:12,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-11-15 23:57:12,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-11-15 23:57:12,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:57:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 23:57:12,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:57:12,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:12,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:57:12,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:12,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 23:57:12,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:12,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-11-15 23:57:12,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:12,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-11-15 23:57:12,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:57:12,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:57:12,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-15 23:57:12,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:12,922 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:57:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-15 23:57:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-15 23:57:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:57:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 23:57:12,948 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:57:12,948 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:57:12,948 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:57:12,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 23:57:12,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:12,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:12,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:12,951 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:12,951 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:12,951 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 23:57:12,952 INFO L793 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 23:57:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-11-15 23:57:12,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:12,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476558905] [2019-11-15 23:57:12,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:13,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476558905] [2019-11-15 23:57:13,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190881958] [2019-11-15 23:57:13,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:57:13,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:13,124 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:13,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:57:13,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72533335] [2019-11-15 23:57:13,127 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-11-15 23:57:13,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:13,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154665072] [2019-11-15 23:57:13,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:13,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:57:13,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154665072] [2019-11-15 23:57:13,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:13,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:13,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933629416] [2019-11-15 23:57:13,175 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:57:13,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:13,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:13,179 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 23:57:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:13,256 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-15 23:57:13,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:57:13,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-15 23:57:13,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:13,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-15 23:57:13,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:57:13,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:57:13,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 23:57:13,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:13,261 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:57:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 23:57:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:57:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:57:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 23:57:13,265 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:57:13,265 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:57:13,265 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:57:13,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 23:57:13,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:13,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:13,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:13,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:13,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:13,267 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 221#L25 call main_#t~ret2 := fibo(main_~x~0);< 225#fiboENTRY ~n := #in~n; 226#L6 assume !(~n < 1); 224#L8 assume !(1 == ~n); 218#L11 call #t~ret0 := fibo(~n - 1);< 227#fiboENTRY ~n := #in~n; 228#L6 assume !(~n < 1); 222#L8 assume 1 == ~n;#res := 1; 223#fiboFINAL assume true; 217#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 23:57:13,267 INFO L793 eck$LassoCheckResult]: Loop: 219#L11-1 call #t~ret1 := fibo(~n - 2);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume !(1 == ~n); 230#L11 call #t~ret0 := fibo(~n - 1);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume 1 == ~n;#res := 1; 236#fiboFINAL assume true; 234#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 23:57:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-11-15 23:57:13,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:13,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321671598] [2019-11-15 23:57:13,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:13,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:13,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:13,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321671598] [2019-11-15 23:57:13,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746805961] [2019-11-15 23:57:13,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:13,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:57:13,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:13,384 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:13,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:57:13,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706256064] [2019-11-15 23:57:13,385 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-11-15 23:57:13,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:13,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821949769] [2019-11-15 23:57:13,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:13,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:13,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:13,564 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:13,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:13,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:13,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:13,564 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:13,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:13,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:13,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:13,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration3_Loop [2019-11-15 23:57:13,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:13,565 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:13,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:13,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:13,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:13,657 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:13,658 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:13,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:13,667 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:13,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:13,683 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:14,149 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:14,151 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:14,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:14,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:14,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:14,151 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:14,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:14,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:14,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:14,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration3_Loop [2019-11-15 23:57:14,152 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:14,152 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:14,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:14,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:14,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:14,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:14,233 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:14,233 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:14,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:14,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:14,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:14,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:14,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:14,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:14,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:14,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:14,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:14,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:14,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:14,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:14,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:14,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:14,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:14,241 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:14,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:14,256 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:14,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:14,270 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:14,271 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:14,271 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:14,271 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:14,271 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:57:14,272 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:57:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:57:14,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:14,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-15 23:57:14,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-15 23:57:14,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-11-15 23:57:14,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:57:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-11-15 23:57:14,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 23:57:14,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:14,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-15 23:57:14,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:14,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-11-15 23:57:14,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:14,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-15 23:57:14,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:57:14,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-15 23:57:14,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-15 23:57:14,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:57:14,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-15 23:57:14,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:14,645 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-15 23:57:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-15 23:57:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-15 23:57:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:57:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-15 23:57:14,660 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-15 23:57:14,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:14,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:57:14,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:14,661 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-15 23:57:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:14,760 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-15 23:57:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:14,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-15 23:57:14,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:57:14,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-15 23:57:14,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:57:14,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:57:14,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-15 23:57:14,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:14,772 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-15 23:57:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-15 23:57:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-15 23:57:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:57:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 23:57:14,786 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:57:14,786 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:57:14,786 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:57:14,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-15 23:57:14,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:57:14,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:14,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:14,791 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:14,791 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-15 23:57:14,792 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 745#L25 call main_#t~ret2 := fibo(main_~x~0);< 769#fiboENTRY ~n := #in~n; 793#L6 assume !(~n < 1); 752#L8 assume !(1 == ~n); 753#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 761#L6 assume !(~n < 1); 772#L8 assume !(1 == ~n); 760#L11 call #t~ret0 := fibo(~n - 1);< 759#fiboENTRY ~n := #in~n; 762#L6 assume !(~n < 1); 796#L8 assume 1 == ~n;#res := 1; 795#fiboFINAL assume true; 794#fiboEXIT >#32#return; 757#L11-1 call #t~ret1 := fibo(~n - 2);< 756#fiboENTRY ~n := #in~n; 758#L6 assume ~n < 1;#res := 0; 823#fiboFINAL assume true; 817#fiboEXIT >#34#return; 814#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 812#fiboFINAL assume true; 802#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 23:57:14,792 INFO L793 eck$LassoCheckResult]: Loop: 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume !(1 == ~n); 808#L11 call #t~ret0 := fibo(~n - 1);< 810#fiboENTRY ~n := #in~n; 818#L6 assume !(~n < 1); 815#L8 assume 1 == ~n;#res := 1; 816#fiboFINAL assume true; 813#fiboEXIT >#32#return; 804#L11-1 call #t~ret1 := fibo(~n - 2);< 810#fiboENTRY ~n := #in~n; 818#L6 assume ~n < 1;#res := 0; 819#fiboFINAL assume true; 821#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 811#fiboFINAL assume true; 807#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 23:57:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-11-15 23:57:14,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:14,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023276292] [2019-11-15 23:57:14,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:14,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:14,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:57:14,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023276292] [2019-11-15 23:57:14,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936495165] [2019-11-15 23:57:14,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:57:14,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:57:14,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:14,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-15 23:57:14,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523996584] [2019-11-15 23:57:14,990 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1408722332, now seen corresponding path program 1 times [2019-11-15 23:57:14,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:14,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605891335] [2019-11-15 23:57:14,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:14,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:14,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:57:15,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605891335] [2019-11-15 23:57:15,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101195522] [2019-11-15 23:57:15,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:57:15,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:57:15,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:15,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 23:57:15,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101854497] [2019-11-15 23:57:15,195 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:57:15,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:57:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:57:15,196 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-15 23:57:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:15,420 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-11-15 23:57:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:57:15,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-11-15 23:57:15,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:57:15,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-11-15 23:57:15,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-15 23:57:15,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 23:57:15,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-11-15 23:57:15,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:15,432 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 23:57:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-11-15 23:57:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 23:57:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 23:57:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-15 23:57:15,444 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 23:57:15,444 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-15 23:57:15,444 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:57:15,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-11-15 23:57:15,446 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:57:15,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:15,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:15,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:15,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:57:15,448 INFO L791 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 1249#L25 call main_#t~ret2 := fibo(main_~x~0);< 1278#fiboENTRY ~n := #in~n; 1308#L6 assume !(~n < 1); 1307#L8 assume !(1 == ~n); 1256#L11 call #t~ret0 := fibo(~n - 1);< 1273#fiboENTRY ~n := #in~n; 1274#L6 assume !(~n < 1); 1255#L8 assume !(1 == ~n); 1257#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1305#L6 assume !(~n < 1); 1303#L8 assume !(1 == ~n); 1263#L11 call #t~ret0 := fibo(~n - 1);< 1301#fiboENTRY ~n := #in~n; 1306#L6 assume !(~n < 1); 1304#L8 assume 1 == ~n;#res := 1; 1302#fiboFINAL assume true; 1300#fiboEXIT >#32#return; 1243#L11-1 call #t~ret1 := fibo(~n - 2);< 1298#fiboENTRY ~n := #in~n; 1345#L6 assume ~n < 1;#res := 0; 1344#fiboFINAL assume true; 1342#fiboEXIT >#34#return; 1340#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1339#fiboFINAL assume true; 1332#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 23:57:15,449 INFO L793 eck$LassoCheckResult]: Loop: 1260#L11-1 call #t~ret1 := fibo(~n - 2);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume !(1 == ~n); 1262#L11 call #t~ret0 := fibo(~n - 1);< 1276#fiboENTRY ~n := #in~n; 1309#L6 assume !(~n < 1); 1311#L8 assume 1 == ~n;#res := 1; 1254#fiboFINAL assume true; 1346#fiboEXIT >#32#return; 1252#L11-1 call #t~ret1 := fibo(~n - 2);< 1271#fiboENTRY ~n := #in~n; 1272#L6 assume ~n < 1;#res := 0; 1310#fiboFINAL assume true; 1347#fiboEXIT >#34#return; 1244#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 1258#fiboFINAL assume true; 1264#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 23:57:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292419, now seen corresponding path program 2 times [2019-11-15 23:57:15,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:15,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492904581] [2019-11-15 23:57:15,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:15,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:15,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:57:15,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492904581] [2019-11-15 23:57:15,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120712381] [2019-11-15 23:57:15,574 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:15,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:57:15,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:57:15,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:57:15,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:57:15,648 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:15,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-15 23:57:15,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901657899] [2019-11-15 23:57:15,649 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:15,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash 22774646, now seen corresponding path program 2 times [2019-11-15 23:57:15,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:15,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723967369] [2019-11-15 23:57:15,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:15,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:15,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:15,661 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:15,926 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:15,927 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:15,927 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:15,927 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:15,927 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:15,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:15,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:15,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:15,927 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration5_Loop [2019-11-15 23:57:15,927 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:15,927 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:15,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:15,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-11-15 23:57:15,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:15,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:16,003 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:16,003 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:16,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:16,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:16,009 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:16,010 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:16,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:16,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:16,018 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:16,018 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:16,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:16,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:16,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:16,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=1} Honda state: {fibo_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:16,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:16,033 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:16,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:16,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:16,587 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:16,589 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:16,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:16,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:16,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:16,590 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:16,590 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:16,590 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:16,590 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:16,590 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration5_Loop [2019-11-15 23:57:16,590 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:16,590 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:16,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:16,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-11-15 23:57:16,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:16,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:16,706 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:16,706 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:16,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:16,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:16,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:16,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:16,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:16,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:16,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:16,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:16,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:16,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:16,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:16,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:16,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:16,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:16,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:16,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:16,712 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:16,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:16,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:16,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:16,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:16,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:16,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:16,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:16,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:16,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:16,720 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:16,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:16,724 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:16,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:16,725 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:16,725 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:16,726 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:57:16,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:16,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:57:16,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:16,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:16,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:16,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:57:16,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:57:16,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:57:16,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-15 23:57:17,175 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 182 states and 247 transitions. Complement of second has 33 states. [2019-11-15 23:57:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:57:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-15 23:57:17,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 23:57:17,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:17,179 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:57:17,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:17,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:57:17,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:57:17,379 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:57:17,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-15 23:57:17,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 307 states and 416 transitions. Complement of second has 25 states. [2019-11-15 23:57:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:57:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 23:57:17,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 23:57:17,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:17,555 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:57:17,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:17,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:17,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:57:17,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:57:17,733 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:57:17,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-15 23:57:18,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48. Second operand 8 states. Result 1077 states and 1512 transitions. Complement of second has 130 states. [2019-11-15 23:57:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:57:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-15 23:57:18,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 23:57:18,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 53 letters. Loop has 22 letters. [2019-11-15 23:57:18,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:18,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 44 letters. [2019-11-15 23:57:18,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:18,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1512 transitions. [2019-11-15 23:57:18,045 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-15 23:57:18,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 604 states and 935 transitions. [2019-11-15 23:57:18,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-15 23:57:18,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2019-11-15 23:57:18,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 935 transitions. [2019-11-15 23:57:18,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:18,067 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 935 transitions. [2019-11-15 23:57:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 935 transitions. [2019-11-15 23:57:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 477. [2019-11-15 23:57:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-15 23:57:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 725 transitions. [2019-11-15 23:57:18,112 INFO L711 BuchiCegarLoop]: Abstraction has 477 states and 725 transitions. [2019-11-15 23:57:18,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:57:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:57:18,114 INFO L87 Difference]: Start difference. First operand 477 states and 725 transitions. Second operand 14 states. [2019-11-15 23:57:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:18,435 INFO L93 Difference]: Finished difference Result 537 states and 809 transitions. [2019-11-15 23:57:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:57:18,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 809 transitions. [2019-11-15 23:57:18,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:18,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 534 states and 802 transitions. [2019-11-15 23:57:18,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-11-15 23:57:18,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-11-15 23:57:18,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 802 transitions. [2019-11-15 23:57:18,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:18,463 INFO L688 BuchiCegarLoop]: Abstraction has 534 states and 802 transitions. [2019-11-15 23:57:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 802 transitions. [2019-11-15 23:57:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 494. [2019-11-15 23:57:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-15 23:57:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-11-15 23:57:18,495 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-15 23:57:18,495 INFO L591 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-15 23:57:18,495 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:57:18,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 746 transitions. [2019-11-15 23:57:18,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:18,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:18,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:18,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:18,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:18,503 INFO L791 eck$LassoCheckResult]: Stem: 4807#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 4808#L25 call main_#t~ret2 := fibo(main_~x~0);< 4845#fiboENTRY ~n := #in~n; 4869#L6 assume !(~n < 1); 4868#L8 assume !(1 == ~n); 4864#L11 call #t~ret0 := fibo(~n - 1);< 4867#fiboENTRY ~n := #in~n; 4866#L6 assume !(~n < 1); 4865#L8 assume !(1 == ~n); 4860#L11 call #t~ret0 := fibo(~n - 1);< 4862#fiboENTRY ~n := #in~n; 4863#L6 assume !(~n < 1); 4859#L8 assume !(1 == ~n); 4811#L11 call #t~ret0 := fibo(~n - 1);< 4856#fiboENTRY ~n := #in~n; 4857#L6 assume !(~n < 1); 4861#L8 assume !(1 == ~n); 4810#L11 call #t~ret0 := fibo(~n - 1);< 4856#fiboENTRY ~n := #in~n; 4858#L6 assume !(~n < 1); 4809#L8 assume 1 == ~n;#res := 1; 4812#fiboFINAL assume true; 4953#fiboEXIT >#32#return; 4933#L11-1 call #t~ret1 := fibo(~n - 2);< 4941#fiboENTRY ~n := #in~n; 5030#L6 assume !(~n < 1); 4957#L8 assume !(1 == ~n); 4958#L11 call #t~ret0 := fibo(~n - 1);< 4967#fiboENTRY ~n := #in~n; 5112#L6 assume !(~n < 1); 5035#L8 assume !(1 == ~n); 5036#L11 call #t~ret0 := fibo(~n - 1);< 5054#fiboENTRY [2019-11-15 23:57:18,503 INFO L793 eck$LassoCheckResult]: Loop: 5054#fiboENTRY ~n := #in~n; 5065#L6 assume !(~n < 1); 5062#L8 assume !(1 == ~n); 5051#L11 call #t~ret0 := fibo(~n - 1);< 5054#fiboENTRY [2019-11-15 23:57:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash 116207529, now seen corresponding path program 1 times [2019-11-15 23:57:18,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:18,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773320540] [2019-11-15 23:57:18,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:18,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773320540] [2019-11-15 23:57:18,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207088060] [2019-11-15 23:57:18,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:18,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:57:18,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:57:18,854 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:18,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 20 [2019-11-15 23:57:18,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617097967] [2019-11-15 23:57:18,855 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-11-15 23:57:18,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:18,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200481893] [2019-11-15 23:57:18,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:18,859 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:18,886 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:18,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:18,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:18,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:18,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:18,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:18,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:18,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:18,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration6_Loop [2019-11-15 23:57:18,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:18,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:18,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:18,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:18,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:18,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:18,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:18,951 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:18,951 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:18,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:18,960 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:18,963 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:18,963 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:18,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:18,982 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:18,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:18,986 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:57:19,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:19,003 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:19,007 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:19,007 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:19,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:19,018 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:19,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:19,033 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:19,090 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:19,093 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:19,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:19,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:19,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:19,093 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:19,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:19,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:19,094 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:19,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration6_Loop [2019-11-15 23:57:19,094 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:19,094 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:19,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,169 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:19,169 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:19,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:19,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:19,170 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:19,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:19,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:19,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:19,171 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:19,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:19,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:19,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:19,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:19,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:19,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:19,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:19,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:19,173 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:19,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:19,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:19,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:19,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:19,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:19,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:19,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:19,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:19,175 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:19,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:19,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:19,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:19,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:19,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:19,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:19,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:19,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:19,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:19,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:19,187 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:19,189 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:19,189 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:19,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:19,190 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:19,190 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:19,190 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 23:57:19,191 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:57:19,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:19,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:19,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:57:19,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-15 23:57:19,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 507 states and 759 transitions. Complement of second has 13 states. [2019-11-15 23:57:19,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:57:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:57:19,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 23:57:19,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:19,383 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:57:19,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:19,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:57:19,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-15 23:57:19,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 507 states and 759 transitions. Complement of second has 13 states. [2019-11-15 23:57:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:57:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:57:19,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 23:57:19,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:19,593 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:57:19,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:19,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:19,734 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:57:19,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-15 23:57:19,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262. Second operand 5 states. Result 650 states and 920 transitions. Complement of second has 14 states. [2019-11-15 23:57:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:57:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 23:57:19,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 23:57:19,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:19,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-15 23:57:19,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:19,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 8 letters. [2019-11-15 23:57:19,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:19,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 920 transitions. [2019-11-15 23:57:19,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:19,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 548 states and 806 transitions. [2019-11-15 23:57:19,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-11-15 23:57:19,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2019-11-15 23:57:19,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 806 transitions. [2019-11-15 23:57:19,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:19,896 INFO L688 BuchiCegarLoop]: Abstraction has 548 states and 806 transitions. [2019-11-15 23:57:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 806 transitions. [2019-11-15 23:57:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 518. [2019-11-15 23:57:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-15 23:57:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 770 transitions. [2019-11-15 23:57:19,922 INFO L711 BuchiCegarLoop]: Abstraction has 518 states and 770 transitions. [2019-11-15 23:57:19,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 23:57:19,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:57:19,923 INFO L87 Difference]: Start difference. First operand 518 states and 770 transitions. Second operand 20 states. [2019-11-15 23:57:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:20,313 INFO L93 Difference]: Finished difference Result 585 states and 871 transitions. [2019-11-15 23:57:20,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:57:20,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 585 states and 871 transitions. [2019-11-15 23:57:20,324 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:20,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 585 states to 575 states and 857 transitions. [2019-11-15 23:57:20,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-11-15 23:57:20,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-11-15 23:57:20,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 857 transitions. [2019-11-15 23:57:20,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:20,335 INFO L688 BuchiCegarLoop]: Abstraction has 575 states and 857 transitions. [2019-11-15 23:57:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 857 transitions. [2019-11-15 23:57:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 541. [2019-11-15 23:57:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-15 23:57:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 807 transitions. [2019-11-15 23:57:20,357 INFO L711 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-11-15 23:57:20,357 INFO L591 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-11-15 23:57:20,357 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:57:20,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 807 transitions. [2019-11-15 23:57:20,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:20,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:20,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:20,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 7, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:20,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:20,366 INFO L791 eck$LassoCheckResult]: Stem: 8597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8598#L25 call main_#t~ret2 := fibo(main_~x~0);< 8631#fiboENTRY ~n := #in~n; 8671#L6 assume !(~n < 1); 8669#L8 assume !(1 == ~n); 8666#L11 call #t~ret0 := fibo(~n - 1);< 8667#fiboENTRY ~n := #in~n; 8677#L6 assume !(~n < 1); 8676#L8 assume !(1 == ~n); 8653#L11 call #t~ret0 := fibo(~n - 1);< 8675#fiboENTRY ~n := #in~n; 8679#L6 assume !(~n < 1); 8660#L8 assume !(1 == ~n); 8655#L11 call #t~ret0 := fibo(~n - 1);< 8657#fiboENTRY ~n := #in~n; 8711#L6 assume !(~n < 1); 8708#L8 assume !(1 == ~n); 8649#L11 call #t~ret0 := fibo(~n - 1);< 8656#fiboENTRY ~n := #in~n; 8721#L6 assume !(~n < 1); 8710#L8 assume !(1 == ~n); 8648#L11 call #t~ret0 := fibo(~n - 1);< 8656#fiboENTRY ~n := #in~n; 8730#L6 assume !(~n < 1); 8796#L8 assume 1 == ~n;#res := 1; 8794#fiboFINAL assume true; 8793#fiboEXIT >#32#return; 8785#L11-1 call #t~ret1 := fibo(~n - 2);< 8792#fiboENTRY ~n := #in~n; 9030#L6 assume !(~n < 1); 9006#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8639#fiboENTRY ~n := #in~n; 8640#L6 assume !(~n < 1); 9118#L8 assume !(1 == ~n); 8633#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8638#L6 assume !(~n < 1); 9103#L8 assume !(1 == ~n); 8634#L11 [2019-11-15 23:57:20,367 INFO L793 eck$LassoCheckResult]: Loop: 8634#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8638#L6 assume !(~n < 1); 9103#L8 assume !(1 == ~n); 8634#L11 [2019-11-15 23:57:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash -989900256, now seen corresponding path program 2 times [2019-11-15 23:57:20,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:20,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623376651] [2019-11-15 23:57:20,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:20,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623376651] [2019-11-15 23:57:20,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641411181] [2019-11-15 23:57:20,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:20,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:57:20,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:57:20,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:57:20,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 64 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:57:20,756 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:20,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 24 [2019-11-15 23:57:20,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409376233] [2019-11-15 23:57:20,757 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-11-15 23:57:20,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:20,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893916092] [2019-11-15 23:57:20,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:20,762 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:20,814 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:20,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:20,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:20,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:20,814 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:20,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:20,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:20,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:20,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration7_Loop [2019-11-15 23:57:20,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:20,815 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:20,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:20,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:20,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:20,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:20,864 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:20,865 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:20,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:20,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:20,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:20,872 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:20,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:20,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:20,880 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:20,880 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:20,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:20,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:20,889 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:20,889 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:20,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:20,894 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:20,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:20,904 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:27,094 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:27,095 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:27,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:27,096 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:27,096 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:27,096 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:27,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:27,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:27,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:27,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration7_Loop [2019-11-15 23:57:27,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:27,096 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:27,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:27,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:27,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:27,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:27,146 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:27,146 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:27,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:27,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:27,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:27,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:27,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:27,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:27,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:27,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:27,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:27,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:27,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:27,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:27,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:27,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:27,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:27,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:27,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:27,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:27,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:27,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:27,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:27,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:27,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:27,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:27,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:27,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:27,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:27,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:27,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:27,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:27,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:27,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:27,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:27,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:27,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:27,155 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:27,156 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:27,156 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:27,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:27,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:27,157 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:27,157 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:57:27,157 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:27,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:57:27,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:27,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:27,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:27,291 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:27,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-11-15 23:57:27,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276. Second operand 6 states. Result 556 states and 823 transitions. Complement of second has 18 states. [2019-11-15 23:57:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:57:27,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 39 letters. Loop has 4 letters. [2019-11-15 23:57:27,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:27,349 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:27,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:57:27,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:27,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:27,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:27,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-11-15 23:57:27,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276. Second operand 6 states. Result 786 states and 1145 transitions. Complement of second has 22 states. [2019-11-15 23:57:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:57:27,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 4 letters. [2019-11-15 23:57:27,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:27,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-15 23:57:27,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:27,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 8 letters. [2019-11-15 23:57:27,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:27,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1145 transitions. [2019-11-15 23:57:27,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:27,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 719 states and 1073 transitions. [2019-11-15 23:57:27,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-11-15 23:57:27,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-11-15 23:57:27,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 719 states and 1073 transitions. [2019-11-15 23:57:27,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:27,638 INFO L688 BuchiCegarLoop]: Abstraction has 719 states and 1073 transitions. [2019-11-15 23:57:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states and 1073 transitions. [2019-11-15 23:57:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 706. [2019-11-15 23:57:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-15 23:57:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1056 transitions. [2019-11-15 23:57:27,671 INFO L711 BuchiCegarLoop]: Abstraction has 706 states and 1056 transitions. [2019-11-15 23:57:27,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 23:57:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:57:27,672 INFO L87 Difference]: Start difference. First operand 706 states and 1056 transitions. Second operand 24 states. [2019-11-15 23:57:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:28,167 INFO L93 Difference]: Finished difference Result 794 states and 1182 transitions. [2019-11-15 23:57:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:57:28,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 794 states and 1182 transitions. [2019-11-15 23:57:28,182 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:28,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 794 states to 779 states and 1160 transitions. [2019-11-15 23:57:28,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2019-11-15 23:57:28,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-11-15 23:57:28,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 779 states and 1160 transitions. [2019-11-15 23:57:28,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:28,209 INFO L688 BuchiCegarLoop]: Abstraction has 779 states and 1160 transitions. [2019-11-15 23:57:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states and 1160 transitions. [2019-11-15 23:57:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 761. [2019-11-15 23:57:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-15 23:57:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1128 transitions. [2019-11-15 23:57:28,234 INFO L711 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-11-15 23:57:28,234 INFO L591 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-11-15 23:57:28,234 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:57:28,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 761 states and 1128 transitions. [2019-11-15 23:57:28,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:28,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:28,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:28,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 9, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:28,246 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:28,248 INFO L791 eck$LassoCheckResult]: Stem: 12464#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 12465#L25 call main_#t~ret2 := fibo(main_~x~0);< 12492#fiboENTRY ~n := #in~n; 12553#L6 assume !(~n < 1); 12554#L8 assume !(1 == ~n); 12548#L11 call #t~ret0 := fibo(~n - 1);< 12549#fiboENTRY ~n := #in~n; 12574#L6 assume !(~n < 1); 12551#L8 assume !(1 == ~n); 12547#L11 call #t~ret0 := fibo(~n - 1);< 12573#fiboENTRY ~n := #in~n; 12571#L6 assume !(~n < 1); 12569#L8 assume !(1 == ~n); 12556#L11 call #t~ret0 := fibo(~n - 1);< 12566#fiboENTRY ~n := #in~n; 12572#L6 assume !(~n < 1); 12570#L8 assume !(1 == ~n); 12561#L11 call #t~ret0 := fibo(~n - 1);< 12568#fiboENTRY ~n := #in~n; 12600#L6 assume !(~n < 1); 12599#L8 assume !(1 == ~n); 12584#L11 call #t~ret0 := fibo(~n - 1);< 12591#fiboENTRY ~n := #in~n; 12630#L6 assume !(~n < 1); 12621#L8 assume !(1 == ~n); 12586#L11 call #t~ret0 := fibo(~n - 1);< 12595#fiboENTRY ~n := #in~n; 12702#L6 assume !(~n < 1); 12693#L8 assume 1 == ~n;#res := 1; 12692#fiboFINAL assume true; 12685#fiboEXIT >#32#return; 12626#L11-1 call #t~ret1 := fibo(~n - 2);< 12628#fiboENTRY ~n := #in~n; 12664#L6 assume ~n < 1;#res := 0; 12659#fiboFINAL assume true; 12625#fiboEXIT >#34#return; 12620#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 12594#fiboFINAL assume true; 12590#fiboEXIT >#32#return; 12585#L11-1 call #t~ret1 := fibo(~n - 2);< 12588#fiboENTRY ~n := #in~n; 12798#L6 assume !(~n < 1); 12796#L8 assume !(1 == ~n); 12792#L11 call #t~ret0 := fibo(~n - 1);< 12793#fiboENTRY ~n := #in~n; 12861#L6 assume !(~n < 1); 12860#L8 assume !(1 == ~n); 12854#L11 call #t~ret0 := fibo(~n - 1);< 12858#fiboENTRY ~n := #in~n; 12892#L6 assume !(~n < 1); 12890#L8 assume !(1 == ~n); 12852#L11 [2019-11-15 23:57:28,248 INFO L793 eck$LassoCheckResult]: Loop: 12852#L11 call #t~ret0 := fibo(~n - 1);< 12858#fiboENTRY ~n := #in~n; 12892#L6 assume !(~n < 1); 12890#L8 assume !(1 == ~n); 12852#L11 [2019-11-15 23:57:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1997475882, now seen corresponding path program 3 times [2019-11-15 23:57:28,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:28,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137117557] [2019-11-15 23:57:28,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 20 proven. 165 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:57:28,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137117557] [2019-11-15 23:57:28,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430544958] [2019-11-15 23:57:28,601 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:28,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 23:57:28,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:57:28,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:57:28,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 19 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 23:57:28,746 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:28,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 30 [2019-11-15 23:57:28,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626522941] [2019-11-15 23:57:28,746 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-11-15 23:57:28,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:28,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883235477] [2019-11-15 23:57:28,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:28,751 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:28,785 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:28,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:28,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:28,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:28,786 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:28,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:28,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:28,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:28,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration8_Loop [2019-11-15 23:57:28,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:28,786 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:28,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:28,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:28,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:28,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:28,835 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:28,835 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:28,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:28,838 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:28,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:28,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:31,801 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:31,803 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:31,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:31,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:31,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:31,803 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:31,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:31,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:31,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:31,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration8_Loop [2019-11-15 23:57:31,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:31,804 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:31,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:31,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:31,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:31,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:31,862 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:31,862 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:31,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:31,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:31,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:31,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:31,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:31,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:31,863 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:31,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:31,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:31,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:31,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:31,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:31,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:31,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:31,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:31,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:31,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:31,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:31,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:31,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:31,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:31,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:31,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:31,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:31,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:31,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:31,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:31,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:31,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:31,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:31,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:31,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:31,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:31,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:31,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:31,870 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:31,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:31,872 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:31,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:31,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:31,873 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:31,873 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:57:31,874 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:31,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:31,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:57:31,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:31,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:31,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:32,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:32,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:32,053 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:32,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380 Second operand 6 states. [2019-11-15 23:57:32,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380. Second operand 6 states. Result 783 states and 1151 transitions. Complement of second has 18 states. [2019-11-15 23:57:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:57:32,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-15 23:57:32,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:32,125 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:32,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:57:32,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:32,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:32,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:32,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:32,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:32,253 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380 Second operand 6 states. [2019-11-15 23:57:32,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380. Second operand 6 states. Result 964 states and 1362 transitions. Complement of second has 22 states. [2019-11-15 23:57:32,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:57:32,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-15 23:57:32,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:32,349 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:32,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:57:32,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:32,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:32,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:32,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:32,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:32,484 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:32,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380 Second operand 6 states. [2019-11-15 23:57:32,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 761 states and 1128 transitions. cyclomatic complexity: 380. Second operand 6 states. Result 1029 states and 1473 transitions. Complement of second has 27 states. [2019-11-15 23:57:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:57:32,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-15 23:57:32,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:32,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-15 23:57:32,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:32,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 8 letters. [2019-11-15 23:57:32,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:32,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1029 states and 1473 transitions. [2019-11-15 23:57:32,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-15 23:57:32,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1029 states to 761 states and 1128 transitions. [2019-11-15 23:57:32,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2019-11-15 23:57:32,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2019-11-15 23:57:32,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 761 states and 1128 transitions. [2019-11-15 23:57:32,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:32,579 INFO L688 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-11-15 23:57:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states and 1128 transitions. [2019-11-15 23:57:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-11-15 23:57:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-15 23:57:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1128 transitions. [2019-11-15 23:57:32,603 INFO L711 BuchiCegarLoop]: Abstraction has 761 states and 1128 transitions. [2019-11-15 23:57:32,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 23:57:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:57:32,604 INFO L87 Difference]: Start difference. First operand 761 states and 1128 transitions. Second operand 30 states. [2019-11-15 23:57:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:33,198 INFO L93 Difference]: Finished difference Result 395 states and 515 transitions. [2019-11-15 23:57:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:57:33,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 515 transitions. [2019-11-15 23:57:33,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:57:33,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 361 states and 479 transitions. [2019-11-15 23:57:33,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2019-11-15 23:57:33,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-15 23:57:33,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 479 transitions. [2019-11-15 23:57:33,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:33,208 INFO L688 BuchiCegarLoop]: Abstraction has 361 states and 479 transitions. [2019-11-15 23:57:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 479 transitions. [2019-11-15 23:57:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 317. [2019-11-15 23:57:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-15 23:57:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2019-11-15 23:57:33,218 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 424 transitions. [2019-11-15 23:57:33,218 INFO L591 BuchiCegarLoop]: Abstraction has 317 states and 424 transitions. [2019-11-15 23:57:33,218 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:57:33,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 424 transitions. [2019-11-15 23:57:33,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:57:33,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:33,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:33,222 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 11, 10, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-11-15 23:57:33,222 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:33,222 INFO L791 eck$LassoCheckResult]: Stem: 17993#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 17994#L25 call main_#t~ret2 := fibo(main_~x~0);< 18032#fiboENTRY ~n := #in~n; 18115#L6 assume !(~n < 1); 18112#L8 assume !(1 == ~n); 18101#L11 call #t~ret0 := fibo(~n - 1);< 18106#fiboENTRY ~n := #in~n; 18110#L6 assume !(~n < 1); 18108#L8 assume !(1 == ~n); 18103#L11 call #t~ret0 := fibo(~n - 1);< 18104#fiboENTRY ~n := #in~n; 18128#L6 assume !(~n < 1); 18119#L8 assume !(1 == ~n); 18114#L11 call #t~ret0 := fibo(~n - 1);< 18117#fiboENTRY ~n := #in~n; 18138#L6 assume !(~n < 1); 18136#L8 assume !(1 == ~n); 18002#L11 call #t~ret0 := fibo(~n - 1);< 18017#fiboENTRY ~n := #in~n; 18018#L6 assume !(~n < 1); 18001#L8 assume !(1 == ~n); 18003#L11 call #t~ret0 := fibo(~n - 1);< 18131#fiboENTRY ~n := #in~n; 18183#L6 assume !(~n < 1); 18173#L8 assume !(1 == ~n); 18020#L11 call #t~ret0 := fibo(~n - 1);< 18131#fiboENTRY ~n := #in~n; 18183#L6 assume !(~n < 1); 18173#L8 assume !(1 == ~n); 18020#L11 call #t~ret0 := fibo(~n - 1);< 18131#fiboENTRY ~n := #in~n; 18183#L6 assume !(~n < 1); 18173#L8 assume !(1 == ~n); 18020#L11 call #t~ret0 := fibo(~n - 1);< 18168#fiboENTRY ~n := #in~n; 18290#L6 assume !(~n < 1); 18288#L8 assume 1 == ~n;#res := 1; 18287#fiboFINAL assume true; 18286#fiboEXIT >#32#return; 18019#L11-1 call #t~ret1 := fibo(~n - 2);< 18021#fiboENTRY ~n := #in~n; 18222#L6 assume ~n < 1;#res := 0; 18217#fiboFINAL assume true; 18210#fiboEXIT >#34#return; 18197#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 18194#fiboFINAL assume true; 18189#fiboEXIT >#32#return; 18178#L11-1 call #t~ret1 := fibo(~n - 2);< 18181#fiboENTRY ~n := #in~n; 18208#L6 assume !(~n < 1); 18188#L8 assume 1 == ~n;#res := 1; 18185#fiboFINAL assume true; 18177#fiboEXIT >#34#return; 18172#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 18167#fiboFINAL assume true; 18164#fiboEXIT >#32#return; 18123#L11-1 call #t~ret1 := fibo(~n - 2);< 18126#fiboENTRY ~n := #in~n; 18192#L6 assume !(~n < 1); 18187#L8 assume !(1 == ~n); 17986#L11 call #t~ret0 := fibo(~n - 1);< 18086#fiboENTRY ~n := #in~n; 18087#L6 assume !(~n < 1); 18082#L8 assume !(1 == ~n); 18051#L11 call #t~ret0 := fibo(~n - 1);< 18052#fiboENTRY ~n := #in~n; 18071#L6 assume !(~n < 1); 18070#L8 assume !(1 == ~n); 18049#L11 [2019-11-15 23:57:33,222 INFO L793 eck$LassoCheckResult]: Loop: 18049#L11 call #t~ret0 := fibo(~n - 1);< 18052#fiboENTRY ~n := #in~n; 18071#L6 assume !(~n < 1); 18070#L8 assume !(1 == ~n); 18049#L11 [2019-11-15 23:57:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1455011085, now seen corresponding path program 4 times [2019-11-15 23:57:33,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:33,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047825377] [2019-11-15 23:57:33,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:33,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:33,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 37 proven. 271 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:57:33,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047825377] [2019-11-15 23:57:33,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087801359] [2019-11-15 23:57:33,669 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:33,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:57:33,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:57:33,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:57:33,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 120 proven. 179 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:57:33,801 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:33,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 28 [2019-11-15 23:57:33,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712285852] [2019-11-15 23:57:33,802 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:33,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:33,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2019-11-15 23:57:33,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:33,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853945414] [2019-11-15 23:57:33,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:33,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:33,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:33,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:33,851 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:33,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:33,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:33,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:33,851 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:33,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:33,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:33,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:33,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration9_Loop [2019-11-15 23:57:33,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:33,852 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:33,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:33,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:33,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:33,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:33,914 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:33,914 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:57:33,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:33,926 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:33,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:33,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:57:33,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:33,943 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:33,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:33,947 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:33,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:33,959 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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) [2019-11-15 23:57:33,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:33,975 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:36,907 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:36,909 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:36,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:36,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:36,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:36,910 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:36,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:36,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:36,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:36,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration9_Loop [2019-11-15 23:57:36,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:36,910 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:36,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:36,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:36,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:36,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:36,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:36,956 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:36,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:36,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:36,956 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:36,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:36,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:36,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:36,957 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:36,957 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:36,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:36,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:36,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:36,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:36,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:36,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:36,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:36,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:36,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:36,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:36,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:36,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:36,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:36,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:36,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:36,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:36,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:36,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:36,961 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:36,962 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:36,962 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:36,962 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:36,963 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:36,963 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:36,963 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:57:36,963 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:37,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 23:57:37,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:37,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:37,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:37,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:37,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:37,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111 Second operand 6 states. [2019-11-15 23:57:37,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111. Second operand 6 states. Result 336 states and 444 transitions. Complement of second has 18 states. [2019-11-15 23:57:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:57:37,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 68 letters. Loop has 4 letters. [2019-11-15 23:57:37,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:37,183 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:37,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 23:57:37,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:37,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:37,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:37,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:37,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:37,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111 Second operand 6 states. [2019-11-15 23:57:37,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111. Second operand 6 states. Result 342 states and 450 transitions. Complement of second has 17 states. [2019-11-15 23:57:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:57:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 68 letters. Loop has 4 letters. [2019-11-15 23:57:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:37,463 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:37,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 23:57:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:37,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:37,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:37,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:37,640 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:37,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111 Second operand 6 states. [2019-11-15 23:57:37,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 317 states and 424 transitions. cyclomatic complexity: 111. Second operand 6 states. Result 423 states and 554 transitions. Complement of second has 27 states. [2019-11-15 23:57:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:57:37,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2019-11-15 23:57:37,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:37,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 72 letters. Loop has 4 letters. [2019-11-15 23:57:37,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:37,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-15 23:57:37,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:37,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 554 transitions. [2019-11-15 23:57:37,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:57:37,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 325 states and 434 transitions. [2019-11-15 23:57:37,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2019-11-15 23:57:37,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-15 23:57:37,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 325 states and 434 transitions. [2019-11-15 23:57:37,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:37,723 INFO L688 BuchiCegarLoop]: Abstraction has 325 states and 434 transitions. [2019-11-15 23:57:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states and 434 transitions. [2019-11-15 23:57:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 317. [2019-11-15 23:57:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-15 23:57:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2019-11-15 23:57:37,731 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 424 transitions. [2019-11-15 23:57:37,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 23:57:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:57:37,732 INFO L87 Difference]: Start difference. First operand 317 states and 424 transitions. Second operand 28 states. [2019-11-15 23:57:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:38,482 INFO L93 Difference]: Finished difference Result 412 states and 550 transitions. [2019-11-15 23:57:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:57:38,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 550 transitions. [2019-11-15 23:57:38,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:57:38,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 404 states and 536 transitions. [2019-11-15 23:57:38,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-11-15 23:57:38,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-11-15 23:57:38,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 536 transitions. [2019-11-15 23:57:38,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:38,492 INFO L688 BuchiCegarLoop]: Abstraction has 404 states and 536 transitions. [2019-11-15 23:57:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 536 transitions. [2019-11-15 23:57:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 359. [2019-11-15 23:57:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-15 23:57:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 480 transitions. [2019-11-15 23:57:38,506 INFO L711 BuchiCegarLoop]: Abstraction has 359 states and 480 transitions. [2019-11-15 23:57:38,506 INFO L591 BuchiCegarLoop]: Abstraction has 359 states and 480 transitions. [2019-11-15 23:57:38,506 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:57:38,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 480 transitions. [2019-11-15 23:57:38,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:57:38,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:38,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:38,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 12, 11, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-11-15 23:57:38,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:57:38,515 INFO L791 eck$LassoCheckResult]: Stem: 21203#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 21204#L25 call main_#t~ret2 := fibo(main_~x~0);< 21236#fiboENTRY ~n := #in~n; 21340#L6 assume !(~n < 1); 21338#L8 assume !(1 == ~n); 21331#L11 call #t~ret0 := fibo(~n - 1);< 21335#fiboENTRY ~n := #in~n; 21339#L6 assume !(~n < 1); 21336#L8 assume !(1 == ~n); 21315#L11 call #t~ret0 := fibo(~n - 1);< 21333#fiboENTRY ~n := #in~n; 21517#L6 assume !(~n < 1); 21515#L8 assume !(1 == ~n); 21318#L11 call #t~ret0 := fibo(~n - 1);< 21320#fiboENTRY ~n := #in~n; 21358#L6 assume !(~n < 1); 21355#L8 assume !(1 == ~n); 21345#L11 call #t~ret0 := fibo(~n - 1);< 21351#fiboENTRY ~n := #in~n; 21410#L6 assume !(~n < 1); 21399#L8 assume !(1 == ~n); 21392#L11 call #t~ret0 := fibo(~n - 1);< 21395#fiboENTRY ~n := #in~n; 21423#L6 assume !(~n < 1); 21416#L8 assume !(1 == ~n); 21226#L11 call #t~ret0 := fibo(~n - 1);< 21413#fiboENTRY ~n := #in~n; 21433#L6 assume !(~n < 1); 21432#L8 assume !(1 == ~n); 21225#L11 call #t~ret0 := fibo(~n - 1);< 21413#fiboENTRY ~n := #in~n; 21433#L6 assume !(~n < 1); 21432#L8 assume !(1 == ~n); 21225#L11 call #t~ret0 := fibo(~n - 1);< 21413#fiboENTRY ~n := #in~n; 21433#L6 assume !(~n < 1); 21432#L8 assume !(1 == ~n); 21225#L11 call #t~ret0 := fibo(~n - 1);< 21418#fiboENTRY ~n := #in~n; 21551#L6 assume !(~n < 1); 21550#L8 assume 1 == ~n;#res := 1; 21549#fiboFINAL assume true; 21548#fiboEXIT >#32#return; 21224#L11-1 call #t~ret1 := fibo(~n - 2);< 21227#fiboENTRY ~n := #in~n; 21237#L6 assume ~n < 1;#res := 0; 21238#fiboFINAL assume true; 21545#fiboEXIT >#34#return; 21543#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 21542#fiboFINAL assume true; 21541#fiboEXIT >#32#return; 21526#L11-1 call #t~ret1 := fibo(~n - 2);< 21529#fiboENTRY ~n := #in~n; 21539#L6 assume !(~n < 1); 21534#L8 assume 1 == ~n;#res := 1; 21533#fiboFINAL assume true; 21525#fiboEXIT >#34#return; 21524#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 21457#fiboFINAL assume true; 21401#fiboEXIT >#32#return; 21403#L11-1 call #t~ret1 := fibo(~n - 2);< 21408#fiboENTRY ~n := #in~n; 21540#L6 assume !(~n < 1); 21535#L8 assume !(1 == ~n); 21242#L11 call #t~ret0 := fibo(~n - 1);< 21304#fiboENTRY ~n := #in~n; 21297#L6 assume !(~n < 1); 21298#L8 assume !(1 == ~n); 21258#L11 call #t~ret0 := fibo(~n - 1);< 21260#fiboENTRY ~n := #in~n; 21282#L6 assume !(~n < 1); 21278#L8 assume !(1 == ~n); 21259#L11 [2019-11-15 23:57:38,516 INFO L793 eck$LassoCheckResult]: Loop: 21259#L11 call #t~ret0 := fibo(~n - 1);< 21260#fiboENTRY ~n := #in~n; 21282#L6 assume !(~n < 1); 21278#L8 assume !(1 == ~n); 21259#L11 [2019-11-15 23:57:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1736707112, now seen corresponding path program 5 times [2019-11-15 23:57:38,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:38,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968782995] [2019-11-15 23:57:38,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:38,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:38,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 218 proven. 112 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 23:57:38,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968782995] [2019-11-15 23:57:38,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359292181] [2019-11-15 23:57:38,865 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:38,950 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-15 23:57:38,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:57:38,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:57:38,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 179 proven. 18 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-15 23:57:39,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:39,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 25 [2019-11-15 23:57:39,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450602021] [2019-11-15 23:57:39,045 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:57:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2019-11-15 23:57:39,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:39,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131410526] [2019-11-15 23:57:39,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:39,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:39,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:39,052 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:39,093 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:39,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:39,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:39,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:39,093 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:57:39,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:39,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:39,093 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:39,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration10_Loop [2019-11-15 23:57:39,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:39,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:39,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:39,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:39,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:39,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:39,139 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:39,140 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:39,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:39,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:39,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:39,146 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:39,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:39,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:39,153 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:39,153 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:39,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:39,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:39,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:57:39,166 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:39,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:57:39,170 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6a6e695-86ed-4069-b8e1-aeeceeff1f78/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-11-15 23:57:39,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:57:39,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:57:50,020 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:57:50,022 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:50,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:50,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:50,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:50,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:50,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:50,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:50,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:50,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10-2.c_Iteration10_Loop [2019-11-15 23:57:50,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:50,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:50,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-11-15 23:57:50,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:50,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:50,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-11-15 23:57:50,068 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:50,068 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:50,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:50,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:50,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:50,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:50,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:50,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:50,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:50,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:50,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:50,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-11-15 23:57:50,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:50,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:50,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:50,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:50,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:50,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:50,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:50,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:50,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:57:50,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:50,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:50,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:50,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:50,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:50,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:50,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:50,075 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:50,076 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:50,076 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:50,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:50,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:57:50,077 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:50,077 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:57:50,077 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:57:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:50,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 23:57:50,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:50,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:50,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:50,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:50,234 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:50,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125 Second operand 6 states. [2019-11-15 23:57:50,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125. Second operand 6 states. Result 381 states and 503 transitions. Complement of second has 18 states. [2019-11-15 23:57:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-15 23:57:50,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 72 letters. Loop has 4 letters. [2019-11-15 23:57:50,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:50,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:50,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 23:57:50,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:50,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:50,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:50,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:50,484 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:50,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125 Second operand 6 states. [2019-11-15 23:57:50,588 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125. Second operand 6 states. Result 387 states and 509 transitions. Complement of second has 17 states. [2019-11-15 23:57:50,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-15 23:57:50,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 72 letters. Loop has 4 letters. [2019-11-15 23:57:50,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:50,590 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:57:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:50,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 23:57:50,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:50,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:50,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:50,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:50,789 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 23:57:50,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125 Second operand 6 states. [2019-11-15 23:57:50,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 480 transitions. cyclomatic complexity: 125. Second operand 6 states. Result 490 states and 640 transitions. Complement of second has 27 states. [2019-11-15 23:57:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:57:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:57:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:57:50,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 72 letters. Loop has 4 letters. [2019-11-15 23:57:50,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:50,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 76 letters. Loop has 4 letters. [2019-11-15 23:57:50,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:50,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 72 letters. Loop has 8 letters. [2019-11-15 23:57:50,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:50,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 640 transitions. [2019-11-15 23:57:50,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 23:57:50,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 371 states and 494 transitions. [2019-11-15 23:57:50,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2019-11-15 23:57:50,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2019-11-15 23:57:50,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 494 transitions. [2019-11-15 23:57:50,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:57:50,890 INFO L688 BuchiCegarLoop]: Abstraction has 371 states and 494 transitions. [2019-11-15 23:57:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 494 transitions. [2019-11-15 23:57:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2019-11-15 23:57:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-15 23:57:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 480 transitions. [2019-11-15 23:57:50,906 INFO L711 BuchiCegarLoop]: Abstraction has 359 states and 480 transitions. [2019-11-15 23:57:50,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:57:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:57:50,909 INFO L87 Difference]: Start difference. First operand 359 states and 480 transitions. Second operand 25 states. [2019-11-15 23:57:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:51,646 INFO L93 Difference]: Finished difference Result 495 states and 691 transitions. [2019-11-15 23:57:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 23:57:51,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 691 transitions. [2019-11-15 23:57:51,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:57:51,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 0 states and 0 transitions. [2019-11-15 23:57:51,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:57:51,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:57:51,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:57:51,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:57:51,654 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:51,654 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:51,654 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:51,655 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:57:51,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:57:51,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:57:51,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:57:51,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:57:51 BoogieIcfgContainer [2019-11-15 23:57:51,663 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:57:51,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:51,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:51,664 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:51,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:11" (3/4) ... [2019-11-15 23:57:51,669 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:57:51,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:51,671 INFO L168 Benchmark]: Toolchain (without parser) took 40358.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.9 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:51,671 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:51,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:51,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:51,673 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:51,673 INFO L168 Benchmark]: RCFGBuilder took 248.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:51,674 INFO L168 Benchmark]: BuchiAutomizer took 39743.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.7 MB). Peak memory consumption was 171.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:51,674 INFO L168 Benchmark]: Witness Printer took 5.41 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:51,677 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 248.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39743.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.7 MB). Peak memory consumption was 171.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.41 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (9 trivial, 3 deterministic, 5 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 9 modules have a trivial ranking function, the largest among these consists of 30 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.6s and 11 iterations. TraceHistogramMax:15. Analysis of lassos took 29.9s. Construction of modules took 2.8s. Büchi inclusion checks took 6.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 402 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 761 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/26 HoareTripleCheckerStatistics: 350 SDtfs, 971 SDslu, 849 SDs, 0 SdLazy, 2854 SolverSat, 703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf97 lsp96 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp77 dnf100 smp100 tf109 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 24.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...