./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:32:55,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:32:55,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:32:55,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:32:55,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:32:55,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:32:55,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:32:55,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:32:55,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:32:55,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:32:55,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:32:55,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:32:55,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:32:55,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:32:55,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:32:55,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:32:55,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:32:55,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:32:55,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:32:55,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:32:55,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:32:55,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:32:55,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:32:55,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:32:55,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:32:55,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:32:55,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:32:55,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:32:55,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:32:55,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:32:55,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:32:55,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:32:55,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:32:55,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:32:55,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:32:55,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:32:55,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:32:55,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:32:55,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:32:55,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:32:55,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:32:55,199 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:32:55,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:32:55,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:32:55,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:32:55,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:32:55,245 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:32:55,246 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:32:55,246 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:32:55,246 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:32:55,246 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:32:55,247 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:32:55,247 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:32:55,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:32:55,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:32:55,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:32:55,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:32:55,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:32:55,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:32:55,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:32:55,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:32:55,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:32:55,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:32:55,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:32:55,250 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:32:55,251 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:32:55,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:32:55,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:32:55,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:32:55,253 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:32:55,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:32:55,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:32:55,254 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:32:55,255 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:32:55,256 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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 -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2019-11-16 00:32:55,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:32:55,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:32:55,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:32:55,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:32:55,314 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:32:55,315 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2019-11-16 00:32:55,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/data/d3f4486af/acc2e987a0e64fb4855f746350e260d4/FLAG9580ba163 [2019-11-16 00:32:55,861 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:32:55,862 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2019-11-16 00:32:55,868 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/data/d3f4486af/acc2e987a0e64fb4855f746350e260d4/FLAG9580ba163 [2019-11-16 00:32:56,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/data/d3f4486af/acc2e987a0e64fb4855f746350e260d4 [2019-11-16 00:32:56,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:32:56,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:32:56,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:56,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:32:56,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:32:56,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600d7116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56, skipping insertion in model container [2019-11-16 00:32:56,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,374 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:32:56,392 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:32:56,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:56,563 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:32:56,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:56,732 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:32:56,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56 WrapperNode [2019-11-16 00:32:56,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:56,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:56,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:32:56,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:32:56,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:56,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:32:56,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:32:56,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:32:56,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... [2019-11-16 00:32:56,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:32:56,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:32:56,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:32:56,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:32:56,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:32:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:32:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-16 00:32:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-16 00:32:57,053 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:32:57,053 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:32:57,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:57 BoogieIcfgContainer [2019-11-16 00:32:57,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:32:57,055 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:32:57,056 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:32:57,059 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:32:57,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:32:57,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:32:56" (1/3) ... [2019-11-16 00:32:57,061 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@667ff7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:32:57, skipping insertion in model container [2019-11-16 00:32:57,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:32:57,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:56" (2/3) ... [2019-11-16 00:32:57,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@667ff7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:32:57, skipping insertion in model container [2019-11-16 00:32:57,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:32:57,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:57" (3/3) ... [2019-11-16 00:32:57,076 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_7-2.c [2019-11-16 00:32:57,140 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:32:57,140 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:32:57,140 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:32:57,140 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:32:57,141 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:32:57,141 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:32:57,141 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:32:57,141 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:32:57,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-16 00:32:57,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:32:57,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:57,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:57,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:32:57,195 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:32:57,195 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:32:57,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-16 00:32:57,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:32:57,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:57,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:57,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:32:57,199 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:32:57,208 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-11-16 00:32:57,208 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-16 00:32:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-11-16 00:32:57,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:57,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126112576] [2019-11-16 00:32:57,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:57,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:57,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:57,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-11-16 00:32:57,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:57,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344913007] [2019-11-16 00:32:57,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:57,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:57,342 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-11-16 00:32:57,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:57,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127473365] [2019-11-16 00:32:57,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:57,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:57,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:57,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:57,478 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:32:57,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:32:57,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:32:57,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:32:57,481 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:32:57,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:57,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:32:57,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:32:57,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration1_Loop [2019-11-16 00:32:57,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:32:57,482 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:32:57,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,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-16 00:32:57,616 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:32:57,617 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:57,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:32:57,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:32:57,632 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:32:57,633 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:57,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:32:57,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:32:57,644 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:32:57,645 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:57,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:32:57,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:32:57,655 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:32:57,655 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:57,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:32:57,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:32:57,669 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:32:57,669 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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) [2019-11-16 00:32:57,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:32:57,677 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:57,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:32:57,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:32:57,703 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:32:57,706 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:32:57,706 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:32:57,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:32:57,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:32:57,707 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:32:57,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:57,707 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:32:57,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:32:57,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration1_Loop [2019-11-16 00:32:57,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:32:57,708 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:32:57,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:57,817 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:32:57,824 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:32:57,826 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-16 00:32:57,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:57,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:57,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:57,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:57,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:57,844 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:57,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:57,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:32:57,849 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-16 00:32:57,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:57,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:57,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:57,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:57,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:57,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:57,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:57,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:32:57,854 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-16 00:32:57,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:57,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:57,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:57,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:57,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:57,857 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:57,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:57,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:32:57,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:32:57,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:57,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:57,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:57,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:57,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:57,863 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:57,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:57,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:32:57,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-16 00:32:57,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:57,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:57,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:57,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:57,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:57,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:57,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:57,877 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:32:57,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:32:57,884 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:32:57,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:32:57,887 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:32:57,887 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:32:57,887 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-16 00:32:57,890 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:32:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:57,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:32:57,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:57,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:32:57,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:58,018 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-16 00:32:58,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-11-16 00:32:58,171 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-16 00:32:58,172 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-16 00:32:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:32:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-16 00:32:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-16 00:32:58,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:32:58,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:32:58,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:32:58,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-16 00:32:58,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:32:58,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-11-16 00:32:58,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:32:58,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-11-16 00:32:58,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:32:58,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:32:58,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-16 00:32:58,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:32:58,201 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:32:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-16 00:32:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-16 00:32:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:32:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-16 00:32:58,232 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-16 00:32:58,232 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-16 00:32:58,232 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:32:58,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-16 00:32:58,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:32:58,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:58,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:58,235 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:58,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:58,235 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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-16 00:32:58,236 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-16 00:32:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-11-16 00:32:58,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:58,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260984294] [2019-11-16 00:32:58,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,380 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-16 00:32:58,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260984294] [2019-11-16 00:32:58,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650531741] [2019-11-16 00:32:58,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:32:58,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:58,451 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-16 00:32:58,452 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:58,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-16 00:32:58,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750165234] [2019-11-16 00:32:58,454 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:32:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:58,455 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-11-16 00:32:58,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:58,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939255472] [2019-11-16 00:32:58,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,522 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-16 00:32:58,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939255472] [2019-11-16 00:32:58,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:58,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:58,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644883568] [2019-11-16 00:32:58,524 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:32:58,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:32:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:32:58,529 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-16 00:32:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:58,634 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-16 00:32:58,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:32:58,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-16 00:32:58,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:32:58,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-16 00:32:58,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-16 00:32:58,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-16 00:32:58,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-16 00:32:58,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:32:58,640 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-16 00:32:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-16 00:32:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-16 00:32:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-16 00:32:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-16 00:32:58,645 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-16 00:32:58,646 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-16 00:32:58,646 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:32:58,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-16 00:32:58,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:32:58,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:32:58,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:32:58,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:58,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:58,649 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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-16 00:32:58,649 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-16 00:32:58,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:58,649 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-11-16 00:32:58,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:58,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393502462] [2019-11-16 00:32:58,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,725 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-16 00:32:58,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393502462] [2019-11-16 00:32:58,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231911726] [2019-11-16 00:32:58,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:32:58,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:58,791 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-16 00:32:58,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:58,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-16 00:32:58,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136572584] [2019-11-16 00:32:58,792 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:32:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-11-16 00:32:58,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:58,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891002566] [2019-11-16 00:32:58,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:58,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:32:58,806 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:32:58,957 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:32:58,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:32:58,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:32:58,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:32:58,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:32:58,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:58,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:32:58,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:32:58,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration3_Loop [2019-11-16 00:32:58,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:32:58,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:32:58,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:58,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:58,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:58,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:59,053 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:32:59,053 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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) [2019-11-16 00:32:59,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:32:59,069 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:32:59,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:32:59,094 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-16 00:32:59,740 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:32:59,743 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:32:59,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:32:59,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:32:59,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:32:59,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:32:59,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:32:59,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:32:59,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:32:59,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration3_Loop [2019-11-16 00:32:59,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:32:59,745 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:32:59,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:59,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:59,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:59,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:32:59,830 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:32:59,831 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:32:59,831 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-16 00:32:59,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:59,832 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:59,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:59,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:59,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:59,833 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:59,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:59,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:32:59,836 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-16 00:32:59,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:32:59,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:32:59,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:32:59,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:32:59,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:32:59,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:32:59,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:32:59,857 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:32:59,868 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:32:59,871 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:32:59,872 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:32:59,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:32:59,873 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:32:59,873 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-16 00:32:59,874 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:32:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:59,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:32:59,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:33:00,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:00,089 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-16 00:33:00,090 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-16 00:33:00,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-16 00:33:00,327 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-16 00:33:00,329 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-16 00:33:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:33:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-11-16 00:33:00,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-16 00:33:00,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:00,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-16 00:33:00,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:00,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-11-16 00:33:00,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:00,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-16 00:33:00,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:33:00,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-16 00:33:00,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-16 00:33:00,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-16 00:33:00,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-16 00:33:00,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:00,351 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-16 00:33:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-16 00:33:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-16 00:33:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-16 00:33:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-16 00:33:00,369 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-16 00:33:00,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:33:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:33:00,370 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-16 00:33:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:00,489 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-16 00:33:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:33:00,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-16 00:33:00,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:33:00,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-16 00:33:00,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-16 00:33:00,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-16 00:33:00,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-16 00:33:00,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:00,503 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-16 00:33:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-16 00:33:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-16 00:33:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-16 00:33:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-16 00:33:00,518 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-16 00:33:00,518 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-16 00:33:00,518 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:33:00,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-16 00:33:00,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:33:00,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:00,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:00,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:00,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-16 00:33:00,524 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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-16 00:33:00,525 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-16 00:33:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-11-16 00:33:00,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:00,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508604594] [2019-11-16 00:33:00,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:00,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:00,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,678 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-16 00:33:00,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508604594] [2019-11-16 00:33:00,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108783814] [2019-11-16 00:33:00,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:33:00,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:00,763 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-16 00:33:00,764 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:00,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-16 00:33:00,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549636133] [2019-11-16 00:33:00,765 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1408722332, now seen corresponding path program 1 times [2019-11-16 00:33:00,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:00,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41572896] [2019-11-16 00:33:00,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:00,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:00,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,919 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-16 00:33:00,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41572896] [2019-11-16 00:33:00,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970178587] [2019-11-16 00:33:00,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:33:00,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:01,008 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-16 00:33:01,008 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:01,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-16 00:33:01,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478586190] [2019-11-16 00:33:01,009 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:33:01,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:33:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:33:01,010 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-16 00:33:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:01,267 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2019-11-16 00:33:01,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:33:01,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 157 transitions. [2019-11-16 00:33:01,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-16 00:33:01,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 155 transitions. [2019-11-16 00:33:01,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-16 00:33:01,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-16 00:33:01,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 155 transitions. [2019-11-16 00:33:01,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:01,277 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-16 00:33:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 155 transitions. [2019-11-16 00:33:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-16 00:33:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-16 00:33:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-16 00:33:01,295 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-16 00:33:01,295 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-16 00:33:01,295 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:33:01,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 155 transitions. [2019-11-16 00:33:01,299 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-16 00:33:01,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:01,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:01,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:01,301 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-16 00:33:01,301 INFO L791 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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-16 00:33:01,302 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-16 00:33:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:01,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292419, now seen corresponding path program 2 times [2019-11-16 00:33:01,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:01,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652259870] [2019-11-16 00:33:01,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:01,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:01,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:01,480 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-16 00:33:01,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652259870] [2019-11-16 00:33:01,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774919843] [2019-11-16 00:33:01,481 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:01,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:33:01,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:01,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:33:01,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:01,577 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-16 00:33:01,579 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:01,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-16 00:33:01,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935130558] [2019-11-16 00:33:01,582 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash 22774646, now seen corresponding path program 2 times [2019-11-16 00:33:01,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:01,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551122003] [2019-11-16 00:33:01,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:01,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:01,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:01,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:01,923 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:01,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:01,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:01,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:01,923 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:01,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:01,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:01,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:01,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration5_Loop [2019-11-16 00:33:01,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:01,924 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:01,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:01,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-16 00:33:01,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:01,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:02,004 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:02,004 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:02,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:02,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:02,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:02,017 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:02,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:02,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:02,025 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:02,025 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:02,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:02,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:02,035 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:02,035 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:02,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:02,041 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:02,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:02,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:02,697 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:02,700 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:02,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:02,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:02,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:02,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:02,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:02,701 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:02,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:02,701 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration5_Loop [2019-11-16 00:33:02,701 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:02,701 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:02,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:02,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:02,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:02,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:02,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:02,798 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:02,798 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-16 00:33:02,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:02,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:02,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:02,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:02,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:02,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:02,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:02,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:02,803 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-16 00:33:02,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:02,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:02,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:02,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:02,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:02,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:02,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:02,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:02,805 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-16 00:33:02,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:02,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:02,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:02,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:02,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:02,807 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:02,807 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:02,811 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:02,816 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:02,816 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:02,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:02,817 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:02,817 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:02,817 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-16 00:33:02,818 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:02,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:33:02,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:02,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:02,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:02,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:33:02,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:03,047 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-16 00:33:03,047 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-16 00:33:03,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-16 00:33:03,324 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-16 00:33:03,325 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-16 00:33:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:33:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-16 00:33:03,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-16 00:33:03,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:03,327 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:03,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:33:03,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:03,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:33:03,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:03,580 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-16 00:33:03,581 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-16 00:33:03,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-16 00:33:03,792 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-16 00:33:03,796 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-16 00:33:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:33:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-16 00:33:03,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-16 00:33:03,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:03,798 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:03,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:33:03,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:03,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:03,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:33:03,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:04,022 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-16 00:33:04,022 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-16 00:33:04,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 155 transitions. cyclomatic complexity: 48 Second operand 8 states. [2019-11-16 00:33:04,345 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-16 00:33:04,346 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-16 00:33:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:33:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-16 00:33:04,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-16 00:33:04,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:04,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 53 letters. Loop has 22 letters. [2019-11-16 00:33:04,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:04,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 44 letters. [2019-11-16 00:33:04,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:04,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1512 transitions. [2019-11-16 00:33:04,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-16 00:33:04,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 604 states and 935 transitions. [2019-11-16 00:33:04,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-16 00:33:04,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2019-11-16 00:33:04,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 935 transitions. [2019-11-16 00:33:04,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:04,429 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 935 transitions. [2019-11-16 00:33:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 935 transitions. [2019-11-16 00:33:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 477. [2019-11-16 00:33:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-16 00:33:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 725 transitions. [2019-11-16 00:33:04,525 INFO L711 BuchiCegarLoop]: Abstraction has 477 states and 725 transitions. [2019-11-16 00:33:04,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:33:04,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:33:04,527 INFO L87 Difference]: Start difference. First operand 477 states and 725 transitions. Second operand 14 states. [2019-11-16 00:33:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:04,959 INFO L93 Difference]: Finished difference Result 537 states and 809 transitions. [2019-11-16 00:33:04,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:33:04,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 809 transitions. [2019-11-16 00:33:04,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-16 00:33:04,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 534 states and 802 transitions. [2019-11-16 00:33:04,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-11-16 00:33:04,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-11-16 00:33:04,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 802 transitions. [2019-11-16 00:33:04,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:04,986 INFO L688 BuchiCegarLoop]: Abstraction has 534 states and 802 transitions. [2019-11-16 00:33:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 802 transitions. [2019-11-16 00:33:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 494. [2019-11-16 00:33:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-16 00:33:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 746 transitions. [2019-11-16 00:33:05,014 INFO L711 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-16 00:33:05,014 INFO L591 BuchiCegarLoop]: Abstraction has 494 states and 746 transitions. [2019-11-16 00:33:05,014 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:33:05,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 746 transitions. [2019-11-16 00:33:05,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-16 00:33:05,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:05,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:05,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:05,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:33:05,022 INFO L791 eck$LassoCheckResult]: Stem: 4807#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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-16 00:33:05,022 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-16 00:33:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash 116207529, now seen corresponding path program 1 times [2019-11-16 00:33:05,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:05,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269273718] [2019-11-16 00:33:05,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:05,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:05,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:05,319 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-16 00:33:05,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269273718] [2019-11-16 00:33:05,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068436500] [2019-11-16 00:33:05,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:05,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:33:05,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:05,433 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-16 00:33:05,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:05,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 20 [2019-11-16 00:33:05,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207088060] [2019-11-16 00:33:05,434 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-11-16 00:33:05,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:05,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617048708] [2019-11-16 00:33:05,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:05,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:05,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:05,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:05,484 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:05,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:05,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:05,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:05,485 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:05,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:05,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:05,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:05,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration6_Loop [2019-11-16 00:33:05,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:05,485 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:05,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,566 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:05,566 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:05,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:05,574 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-16 00:33:05,582 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:05,583 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:05,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:05,600 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-16 00:33:05,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:05,608 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:05,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:05,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:05,638 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:05,638 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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) [2019-11-16 00:33:05,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:05,650 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:05,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:05,669 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-16 00:33:05,726 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:05,728 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:05,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:05,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:05,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:05,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:05,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:05,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:05,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:05,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration6_Loop [2019-11-16 00:33:05,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:05,729 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:05,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:05,807 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:05,807 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:05,808 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-16 00:33:05,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:05,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:05,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:05,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:05,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:05,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:05,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:05,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:05,810 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-16 00:33:05,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:05,811 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:05,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:05,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:05,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:05,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:05,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:05,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:05,813 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-16 00:33:05,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:05,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:05,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:05,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:05,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:05,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:05,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:05,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:05,815 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-16 00:33:05,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:05,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:05,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:05,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:05,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:05,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:05,819 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:05,822 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:05,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:05,826 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:05,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:05,827 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:05,827 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:05,827 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-16 00:33:05,828 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:05,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:33:05,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:05,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:05,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:05,972 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-16 00:33:05,973 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-16 00:33:05,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-16 00:33:06,053 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-16 00:33:06,054 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-16 00:33:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:33:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-16 00:33:06,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-16 00:33:06,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:06,056 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:06,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:33:06,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:06,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:06,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:06,199 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-16 00:33:06,199 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-16 00:33:06,199 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-16 00:33:06,283 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-16 00:33:06,284 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-16 00:33:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:33:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-16 00:33:06,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-16 00:33:06,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:06,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:06,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:33:06,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:06,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:06,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:06,413 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-16 00:33:06,414 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-16 00:33:06,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 746 transitions. cyclomatic complexity: 262 Second operand 5 states. [2019-11-16 00:33:06,542 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-16 00:33:06,548 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-16 00:33:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:33:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-16 00:33:06,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-16 00:33:06,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:06,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-16 00:33:06,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:06,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 8 letters. [2019-11-16 00:33:06,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:06,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 920 transitions. [2019-11-16 00:33:06,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-16 00:33:06,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 548 states and 806 transitions. [2019-11-16 00:33:06,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-11-16 00:33:06,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2019-11-16 00:33:06,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 806 transitions. [2019-11-16 00:33:06,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:06,580 INFO L688 BuchiCegarLoop]: Abstraction has 548 states and 806 transitions. [2019-11-16 00:33:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 806 transitions. [2019-11-16 00:33:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 518. [2019-11-16 00:33:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-16 00:33:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 770 transitions. [2019-11-16 00:33:06,607 INFO L711 BuchiCegarLoop]: Abstraction has 518 states and 770 transitions. [2019-11-16 00:33:06,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:33:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:33:06,609 INFO L87 Difference]: Start difference. First operand 518 states and 770 transitions. Second operand 20 states. [2019-11-16 00:33:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:07,076 INFO L93 Difference]: Finished difference Result 585 states and 871 transitions. [2019-11-16 00:33:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:33:07,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 585 states and 871 transitions. [2019-11-16 00:33:07,086 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-16 00:33:07,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 585 states to 575 states and 857 transitions. [2019-11-16 00:33:07,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-11-16 00:33:07,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-11-16 00:33:07,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 857 transitions. [2019-11-16 00:33:07,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:07,099 INFO L688 BuchiCegarLoop]: Abstraction has 575 states and 857 transitions. [2019-11-16 00:33:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 857 transitions. [2019-11-16 00:33:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 541. [2019-11-16 00:33:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-16 00:33:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 807 transitions. [2019-11-16 00:33:07,129 INFO L711 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-11-16 00:33:07,129 INFO L591 BuchiCegarLoop]: Abstraction has 541 states and 807 transitions. [2019-11-16 00:33:07,130 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:33:07,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 807 transitions. [2019-11-16 00:33:07,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-16 00:33:07,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:07,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:07,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 7, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:07,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:33:07,140 INFO L791 eck$LassoCheckResult]: Stem: 8597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 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-16 00:33:07,140 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-16 00:33:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash -989900256, now seen corresponding path program 2 times [2019-11-16 00:33:07,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:07,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998127827] [2019-11-16 00:33:07,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:07,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:07,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:07,523 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-16 00:33:07,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998127827] [2019-11-16 00:33:07,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188196825] [2019-11-16 00:33:07,524 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:07,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:33:07,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:07,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:33:07,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:07,612 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-16 00:33:07,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:07,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 23 [2019-11-16 00:33:07,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241945932] [2019-11-16 00:33:07,614 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2019-11-16 00:33:07,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:07,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166051614] [2019-11-16 00:33:07,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:07,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:07,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:07,618 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:07,663 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:07,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:07,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:07,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:07,664 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:07,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:07,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:07,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:07,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration7_Loop [2019-11-16 00:33:07,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:07,664 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:07,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:07,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:07,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:07,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:07,723 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:07,723 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:07,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:07,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:07,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:07,731 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:07,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:07,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:07,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:07,740 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:07,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:07,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:07,750 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:33:07,750 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_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:07,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:07,755 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:07,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:07,767 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-16 00:33:14,906 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:14,908 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:14,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:14,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:14,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:14,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:14,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:14,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:14,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:14,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration7_Loop [2019-11-16 00:33:14,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:14,909 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:14,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-16 00:33:14,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:14,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:14,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-16 00:33:14,977 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:14,977 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:14,978 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-16 00:33:14,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:14,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:14,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:14,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:14,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:14,979 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:14,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:14,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:14,981 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-16 00:33:14,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:14,981 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:14,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:14,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:14,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:14,982 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:14,982 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:14,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:14,983 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-16 00:33:14,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:14,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:14,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:14,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:14,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:14,985 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:14,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:14,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:14,986 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-16 00:33:14,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:14,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:14,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:14,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:14,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:14,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:14,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:14,992 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:14,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:14,994 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:14,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:14,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:14,995 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:14,996 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-16 00:33:14,996 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:15,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:33:15,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:15,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:15,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:15,196 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-16 00:33:15,197 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-16 00:33:15,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-11-16 00:33:15,331 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-16 00:33:15,331 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-16 00:33:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:33:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-16 00:33:15,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 39 letters. Loop has 4 letters. [2019-11-16 00:33:15,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:15,333 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:15,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:15,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:33:15,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:15,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:15,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:15,519 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-16 00:33:15,519 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-16 00:33:15,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 807 transitions. cyclomatic complexity: 276 Second operand 6 states. [2019-11-16 00:33:15,649 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-16 00:33:15,650 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-16 00:33:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:33:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-16 00:33:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 4 letters. [2019-11-16 00:33:15,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 43 letters. Loop has 4 letters. [2019-11-16 00:33:15,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 39 letters. Loop has 8 letters. [2019-11-16 00:33:15,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:15,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1145 transitions. [2019-11-16 00:33:15,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2019-11-16 00:33:15,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 719 states and 1073 transitions. [2019-11-16 00:33:15,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-11-16 00:33:15,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-11-16 00:33:15,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 719 states and 1073 transitions. [2019-11-16 00:33:15,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:15,685 INFO L688 BuchiCegarLoop]: Abstraction has 719 states and 1073 transitions. [2019-11-16 00:33:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states and 1073 transitions. [2019-11-16 00:33:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 706. [2019-11-16 00:33:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-16 00:33:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1056 transitions. [2019-11-16 00:33:15,713 INFO L711 BuchiCegarLoop]: Abstraction has 706 states and 1056 transitions. [2019-11-16 00:33:15,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:33:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:33:15,714 INFO L87 Difference]: Start difference. First operand 706 states and 1056 transitions. Second operand 23 states. [2019-11-16 00:33:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:16,572 INFO L93 Difference]: Finished difference Result 1715 states and 3613 transitions. [2019-11-16 00:33:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:33:16,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1715 states and 3613 transitions. [2019-11-16 00:33:16,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 156 [2019-11-16 00:33:16,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1715 states to 1469 states and 3094 transitions. [2019-11-16 00:33:16,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2019-11-16 00:33:16,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 533 [2019-11-16 00:33:16,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1469 states and 3094 transitions. [2019-11-16 00:33:16,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:16,654 INFO L688 BuchiCegarLoop]: Abstraction has 1469 states and 3094 transitions. [2019-11-16 00:33:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states and 3094 transitions. [2019-11-16 00:33:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1302. [2019-11-16 00:33:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-11-16 00:33:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2622 transitions. [2019-11-16 00:33:16,739 INFO L711 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-16 00:33:16,739 INFO L591 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-16 00:33:16,739 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:33:16,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1302 states and 2622 transitions. [2019-11-16 00:33:16,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-11-16 00:33:16,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:16,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:16,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 9, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:16,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:33:16,760 INFO L791 eck$LassoCheckResult]: Stem: 13389#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 13390#L25 call main_#t~ret2 := fibo(main_~x~0);< 13429#fiboENTRY ~n := #in~n; 13471#L6 assume !(~n < 1); 13470#L8 assume !(1 == ~n); 13466#L11 call #t~ret0 := fibo(~n - 1);< 13469#fiboENTRY ~n := #in~n; 13468#L6 assume !(~n < 1); 13467#L8 assume !(1 == ~n); 13462#L11 call #t~ret0 := fibo(~n - 1);< 13465#fiboENTRY ~n := #in~n; 13464#L6 assume !(~n < 1); 13463#L8 assume !(1 == ~n); 13415#L11 call #t~ret0 := fibo(~n - 1);< 13461#fiboENTRY ~n := #in~n; 13460#L6 assume !(~n < 1); 13459#L8 assume !(1 == ~n); 13454#L11 call #t~ret0 := fibo(~n - 1);< 13458#fiboENTRY ~n := #in~n; 13456#L6 assume !(~n < 1); 13457#L8 assume !(1 == ~n); 13450#L11 call #t~ret0 := fibo(~n - 1);< 13449#fiboENTRY ~n := #in~n; 13452#L6 assume !(~n < 1); 13455#L8 assume !(1 == ~n); 13451#L11 call #t~ret0 := fibo(~n - 1);< 13492#fiboENTRY ~n := #in~n; 13510#L6 assume !(~n < 1); 13507#L8 assume 1 == ~n;#res := 1; 13504#fiboFINAL assume true; 13500#fiboEXIT >#32#return; 13484#L11-1 call #t~ret1 := fibo(~n - 2);< 13485#fiboENTRY ~n := #in~n; 14590#L6 assume ~n < 1;#res := 0; 14589#fiboFINAL assume true; 14588#fiboEXIT >#34#return; 14553#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14587#fiboFINAL assume true; 14512#fiboEXIT >#32#return; 13557#L11-1 call #t~ret1 := fibo(~n - 2);< 14498#fiboENTRY ~n := #in~n; 14660#L6 assume !(~n < 1); 13555#L8 assume !(1 == ~n); 13446#L11 call #t~ret0 := fibo(~n - 1);< 14101#fiboENTRY ~n := #in~n; 14099#L6 assume !(~n < 1); 14097#L8 assume !(1 == ~n); 13400#L11 call #t~ret0 := fibo(~n - 1);< 13474#fiboENTRY ~n := #in~n; 13476#L6 assume !(~n < 1); 14039#L8 assume !(1 == ~n); 13402#L11 [2019-11-16 00:33:16,760 INFO L793 eck$LassoCheckResult]: Loop: 13402#L11 call #t~ret0 := fibo(~n - 1);< 13474#fiboENTRY ~n := #in~n; 13476#L6 assume !(~n < 1); 14039#L8 assume !(1 == ~n); 13402#L11 [2019-11-16 00:33:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1997475882, now seen corresponding path program 3 times [2019-11-16 00:33:16,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:16,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535883171] [2019-11-16 00:33:16,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:16,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:16,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 129 proven. 47 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:33:17,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535883171] [2019-11-16 00:33:17,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978096882] [2019-11-16 00:33:17,010 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:17,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-16 00:33:17,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:17,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:33:17,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:17,149 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-16 00:33:17,149 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:17,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 22 [2019-11-16 00:33:17,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381165715] [2019-11-16 00:33:17,150 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2019-11-16 00:33:17,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:17,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412685393] [2019-11-16 00:33:17,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:17,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:17,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:17,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:17,210 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:17,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:17,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:17,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:17,211 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:17,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:17,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:17,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:17,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration8_Loop [2019-11-16 00:33:17,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:17,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:17,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:17,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:17,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:17,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:17,270 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:17,270 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:17,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:17,274 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0aed37c-1a3c-43eb-b7e5-a14726d37641/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-16 00:33:17,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:17,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:20,739 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:20,741 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:20,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:20,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:20,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:20,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:20,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:20,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:20,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:20,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7-2.c_Iteration8_Loop [2019-11-16 00:33:20,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:20,742 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:20,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:20,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:20,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:20,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:20,807 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:20,807 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:20,807 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-16 00:33:20,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:20,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:20,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:20,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:20,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:20,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:20,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:20,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:20,809 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-16 00:33:20,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:20,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:20,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:20,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:20,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:20,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:20,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:20,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:20,811 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-16 00:33:20,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:20,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:20,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:20,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:20,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:20,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:20,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:20,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:20,813 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-16 00:33:20,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:20,814 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:20,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:20,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:20,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:20,815 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:20,815 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:20,817 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:20,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:20,819 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:33:20,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:20,819 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:20,820 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:20,821 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-16 00:33:20,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:20,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:33:20,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:20,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:20,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:20,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:20,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:21,002 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-16 00:33:21,002 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-16 00:33:21,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333 Second operand 6 states. [2019-11-16 00:33:21,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333. Second operand 6 states. Result 1324 states and 2645 transitions. Complement of second has 18 states. [2019-11-16 00:33:21,082 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-16 00:33:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:33:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-16 00:33:21,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-16 00:33:21,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:21,083 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:21,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:33:21,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:21,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:21,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:21,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:21,277 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-16 00:33:21,277 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-16 00:33:21,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333 Second operand 6 states. [2019-11-16 00:33:21,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333. Second operand 6 states. Result 1505 states and 2854 transitions. Complement of second has 22 states. [2019-11-16 00:33:21,435 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-16 00:33:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:33:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-16 00:33:21,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-16 00:33:21,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:21,437 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:33:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:21,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:33:21,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:21,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:21,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:33:21,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:21,626 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-16 00:33:21,627 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-16 00:33:21,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333 Second operand 6 states. [2019-11-16 00:33:21,808 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 2622 transitions. cyclomatic complexity: 1333. Second operand 6 states. Result 1635 states and 3078 transitions. Complement of second has 27 states. [2019-11-16 00:33:21,809 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-16 00:33:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:33:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-16 00:33:21,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2019-11-16 00:33:21,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:21,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 55 letters. Loop has 4 letters. [2019-11-16 00:33:21,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:21,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 8 letters. [2019-11-16 00:33:21,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:21,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1635 states and 3078 transitions. [2019-11-16 00:33:21,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-11-16 00:33:21,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1635 states to 1302 states and 2622 transitions. [2019-11-16 00:33:21,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2019-11-16 00:33:21,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2019-11-16 00:33:21,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1302 states and 2622 transitions. [2019-11-16 00:33:21,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:33:21,878 INFO L688 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-16 00:33:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states and 2622 transitions. [2019-11-16 00:33:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2019-11-16 00:33:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-11-16 00:33:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2622 transitions. [2019-11-16 00:33:21,953 INFO L711 BuchiCegarLoop]: Abstraction has 1302 states and 2622 transitions. [2019-11-16 00:33:21,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:33:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:33:21,954 INFO L87 Difference]: Start difference. First operand 1302 states and 2622 transitions. Second operand 22 states. [2019-11-16 00:33:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:22,547 INFO L93 Difference]: Finished difference Result 400 states and 513 transitions. [2019-11-16 00:33:22,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:33:22,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 513 transitions. [2019-11-16 00:33:22,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:22,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 0 states and 0 transitions. [2019-11-16 00:33:22,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:33:22,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:33:22,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:33:22,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:33:22,553 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:22,554 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:22,554 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:22,554 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:33:22,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:33:22,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:22,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:33:22,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:33:22 BoogieIcfgContainer [2019-11-16 00:33:22,564 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:33:22,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:33:22,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:33:22,565 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:33:22,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:57" (3/4) ... [2019-11-16 00:33:22,571 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:33:22,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:33:22,574 INFO L168 Benchmark]: Toolchain (without parser) took 26219.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -281.7 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:22,576 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:22,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -221.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:22,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:22,580 INFO L168 Benchmark]: Boogie Preprocessor took 22.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:22,582 INFO L168 Benchmark]: RCFGBuilder took 258.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:22,583 INFO L168 Benchmark]: BuchiAutomizer took 25508.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.6 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:22,583 INFO L168 Benchmark]: Witness Printer took 7.52 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-16 00:33:22,591 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -221.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 258.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25508.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.6 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.52 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 13 terminating modules (7 trivial, 3 deterministic, 3 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. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.4s and 9 iterations. TraceHistogramMax:11. Analysis of lassos took 16.9s. Construction of modules took 2.3s. Büchi inclusion checks took 5.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 442 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1302 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/26 HoareTripleCheckerStatistics: 242 SDtfs, 659 SDslu, 475 SDs, 0 SdLazy, 1881 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf98 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf93 smp78 dnf100 smp100 tf109 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 12.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...