./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_5-1.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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_5-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/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 c7b71b458b3f08f188a62c7539b715f43fd7f97d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:54:20,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:54:20,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:54:20,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:54:20,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:54:20,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:54:20,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:54:20,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:54:20,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:54:20,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:54:20,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:54:20,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:54:20,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:54:20,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:54:20,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:54:20,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:54:20,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:54:20,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:54:20,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:54:20,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:54:20,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:54:20,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:54:20,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:54:20,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:54:20,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:54:20,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:54:20,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:54:20,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:54:20,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:54:20,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:54:20,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:54:20,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:54:20,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:54:20,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:54:20,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:54:20,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:54:20,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:54:20,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:54:20,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:54:20,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:54:20,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:54:20,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:54:20,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:54:20,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:54:20,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:54:20,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:54:20,281 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:54:20,282 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:54:20,282 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:54:20,282 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:54:20,282 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:54:20,283 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:54:20,283 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:54:20,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:54:20,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:54:20,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:54:20,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:54:20,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:54:20,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:54:20,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:54:20,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:54:20,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:54:20,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:54:20,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:54:20,287 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:54:20,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:54:20,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:54:20,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:54:20,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:54:20,288 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:54:20,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:54:20,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:54:20,289 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:54:20,289 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:54:20,291 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_7d756567-acf0-4e43-8809-1a327b756398/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 -> c7b71b458b3f08f188a62c7539b715f43fd7f97d [2019-11-15 23:54:20,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:54:20,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:54:20,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:54:20,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:54:20,332 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:54:20,333 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_5-1.c [2019-11-15 23:54:20,393 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/data/eab427023/63e186f1f7de42098dc01c004f724fe4/FLAGeb85821c3 [2019-11-15 23:54:20,780 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:54:20,780 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/sv-benchmarks/c/recursive-simple/fibo_5-1.c [2019-11-15 23:54:20,787 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/data/eab427023/63e186f1f7de42098dc01c004f724fe4/FLAGeb85821c3 [2019-11-15 23:54:20,805 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/data/eab427023/63e186f1f7de42098dc01c004f724fe4 [2019-11-15 23:54:20,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:54:20,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:54:20,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:20,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:54:20,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:54:20,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:20" (1/1) ... [2019-11-15 23:54:20,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5366b4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:20, skipping insertion in model container [2019-11-15 23:54:20,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:20" (1/1) ... [2019-11-15 23:54:20,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:54:20,840 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:54:21,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:21,083 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:54:21,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:21,103 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:54:21,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21 WrapperNode [2019-11-15 23:54:21,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:21,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:21,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:54:21,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:54:21,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:21,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:54:21,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:54:21,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:54:21,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... [2019-11-15 23:54:21,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:54:21,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:54:21,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:54:21,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:54:21,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:54:21,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:54:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-15 23:54:21,206 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-15 23:54:21,357 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:54:21,358 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:54:21,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:21 BoogieIcfgContainer [2019-11-15 23:54:21,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:54:21,359 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:54:21,359 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:54:21,362 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:54:21,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:54:21,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:54:20" (1/3) ... [2019-11-15 23:54:21,364 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d1e3463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:54:21, skipping insertion in model container [2019-11-15 23:54:21,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:54:21,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:21" (2/3) ... [2019-11-15 23:54:21,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d1e3463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:54:21, skipping insertion in model container [2019-11-15 23:54:21,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:54:21,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:21" (3/3) ... [2019-11-15 23:54:21,383 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_5-1.c [2019-11-15 23:54:21,454 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:54:21,454 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:54:21,454 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:54:21,454 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:54:21,455 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:54:21,455 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:54:21,455 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:54:21,455 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:54:21,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:54:21,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:54:21,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:21,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:21,496 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:54:21,496 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:54:21,497 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:54:21,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:54:21,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:54:21,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:21,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:21,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:54:21,513 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:54:21,520 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2019-11-15 23:54:21,521 INFO L793 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2019-11-15 23:54:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2019-11-15 23:54:21,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:21,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899299784] [2019-11-15 23:54:21,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:21,655 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:21,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2019-11-15 23:54:21,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:21,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795128836] [2019-11-15 23:54:21,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:21,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:21,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2019-11-15 23:54:21,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:21,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375366532] [2019-11-15 23:54:21,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:21,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:21,797 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:21,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:21,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:21,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:21,798 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:54:21,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:21,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:21,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:21,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration1_Loop [2019-11-15 23:54:21,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:21,799 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:21,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:21,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:21,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:21,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:21,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:21,908 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:21,908 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/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-15 23:54:21,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:21,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:21,921 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:21,921 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:21,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:21,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:21,935 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:21,935 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_7d756567-acf0-4e43-8809-1a327b756398/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) [2019-11-15 23:54:21,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:21,954 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:21,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:21,961 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_7d756567-acf0-4e43-8809-1a327b756398/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) [2019-11-15 23:54:21,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:21,986 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:21,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:21,991 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_7d756567-acf0-4e43-8809-1a327b756398/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-15 23:54:22,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:22,010 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:54:22,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:54:22,034 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:22,045 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:54:22,047 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:22,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:22,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:22,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:22,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:54:22,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:22,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:22,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:22,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration1_Loop [2019-11-15 23:54:22,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:22,048 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:22,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:22,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:22,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:22,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:22,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:22,137 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:22,142 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:54:22,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:22,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:22,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:22,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:22,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:22,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:22,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:22,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:22,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:22,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:22,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:22,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:22,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:22,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:22,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:22,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:22,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:22,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:22,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:22,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:22,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:22,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:22,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:22,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:22,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:22,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:22,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:22,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:22,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:22,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:22,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:22,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:22,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:22,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:22,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:22,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:22,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:22,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:22,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:22,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:22,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:22,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:22,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:22,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:22,178 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:54:22,184 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:54:22,184 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:54:22,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:54:22,187 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:54:22,187 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:54:22,188 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 23:54:22,191 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:54:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:54:22,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:54:22,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:22,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:54:22,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-11-15 23:54:22,454 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2019-11-15 23:54:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:54:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 23:54:22,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:54:22,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:22,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:54:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 23:54:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:22,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-11-15 23:54:22,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:54:22,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2019-11-15 23:54:22,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:54:22,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:54:22,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-15 23:54:22,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:22,474 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:54:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-15 23:54:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-15 23:54:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:54:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 23:54:22,497 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:54:22,497 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:54:22,497 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:54:22,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 23:54:22,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:54:22,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:22,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:22,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:22,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:22,500 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 23:54:22,501 INFO L793 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2019-11-15 23:54:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2019-11-15 23:54:22,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:22,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702342918] [2019-11-15 23:54:22,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:22,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702342918] [2019-11-15 23:54:22,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274936380] [2019-11-15 23:54:22,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:54:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:22,649 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:22,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:54:22,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530557823] [2019-11-15 23:54:22,651 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:54:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2019-11-15 23:54:22,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:22,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239306257] [2019-11-15 23:54:22,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:54:22,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239306257] [2019-11-15 23:54:22,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:22,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:22,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912285779] [2019-11-15 23:54:22,717 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:54:22,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:22,721 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 23:54:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:22,813 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-11-15 23:54:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:54:22,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-15 23:54:22,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:54:22,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-15 23:54:22,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:54:22,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:54:22,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 23:54:22,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:22,820 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:54:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 23:54:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:54:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:54:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 23:54:22,825 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:54:22,825 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 23:54:22,825 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:54:22,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 23:54:22,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:54:22,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:22,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:22,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:22,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:22,828 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 221#L25 call main_#t~ret2 := fibo(main_~x~0);< 225#fiboENTRY ~n := #in~n; 226#L6 assume !(~n < 1); 224#L8 assume !(1 == ~n); 218#L11 call #t~ret0 := fibo(~n - 1);< 227#fiboENTRY ~n := #in~n; 228#L6 assume !(~n < 1); 222#L8 assume 1 == ~n;#res := 1; 223#fiboFINAL assume true; 217#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 23:54:22,829 INFO L793 eck$LassoCheckResult]: Loop: 219#L11-1 call #t~ret1 := fibo(~n - 2);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume !(1 == ~n); 230#L11 call #t~ret0 := fibo(~n - 1);< 232#fiboENTRY ~n := #in~n; 239#L6 assume !(~n < 1); 238#L8 assume 1 == ~n;#res := 1; 236#fiboFINAL assume true; 234#fiboEXIT >#32#return; 219#L11-1 [2019-11-15 23:54:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2019-11-15 23:54:22,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:22,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595964463] [2019-11-15 23:54:22,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:22,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595964463] [2019-11-15 23:54:22,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314781058] [2019-11-15 23:54:22,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:22,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:54:22,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:22,963 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:22,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:54:22,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317892720] [2019-11-15 23:54:22,964 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:54:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2019-11-15 23:54:22,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:22,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201805085] [2019-11-15 23:54:22,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:22,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:22,984 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:23,104 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:23,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:23,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:23,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:23,104 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:54:23,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:23,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:23,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:23,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration3_Loop [2019-11-15 23:54:23,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:23,105 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:23,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,178 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:23,178 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/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-15 23:54:23,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:23,187 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:54:23,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:54:23,211 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:23,642 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:54:23,644 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:23,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:23,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:23,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:23,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:54:23,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:23,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:23,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:23,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration3_Loop [2019-11-15 23:54:23,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:23,645 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:23,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,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-15 23:54:23,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:23,741 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:23,741 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:54:23,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:23,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:23,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:23,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:23,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:23,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:23,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:23,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:23,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:23,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:23,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:23,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:23,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:23,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:23,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:23,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:23,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:23,756 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:54:23,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:54:23,761 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:54:23,762 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:54:23,762 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:54:23,762 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:54:23,762 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:54:23,763 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:54:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:23,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:54:23,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:23,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:54:23,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:23,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-15 23:54:23,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-15 23:54:24,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2019-11-15 23:54:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:54:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-11-15 23:54:24,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 23:54:24,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:24,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-15 23:54:24,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:24,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2019-11-15 23:54:24,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:24,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2019-11-15 23:54:24,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:54:24,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2019-11-15 23:54:24,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-15 23:54:24,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:54:24,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2019-11-15 23:54:24,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:24,093 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2019-11-15 23:54:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2019-11-15 23:54:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2019-11-15 23:54:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:54:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2019-11-15 23:54:24,107 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2019-11-15 23:54:24,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:54:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:24,108 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 8 states. [2019-11-15 23:54:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:24,208 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2019-11-15 23:54:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:54:24,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2019-11-15 23:54:24,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:54:24,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2019-11-15 23:54:24,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:54:24,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 23:54:24,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2019-11-15 23:54:24,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:24,223 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-11-15 23:54:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2019-11-15 23:54:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-15 23:54:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:54:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 23:54:24,246 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:54:24,246 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:54:24,246 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:54:24,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2019-11-15 23:54:24,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:54:24,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:24,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:24,255 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:24,255 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1] [2019-11-15 23:54:24,255 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 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~ret0;havoc #t~ret1; 812#fiboFINAL assume true; 802#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 23:54:24,256 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~ret0;havoc #t~ret1; 811#fiboFINAL assume true; 807#fiboEXIT >#34#return; 809#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 811#fiboFINAL assume true; 807#fiboEXIT >#32#return; 804#L11-1 [2019-11-15 23:54:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2019-11-15 23:54:24,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:24,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795360315] [2019-11-15 23:54:24,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:24,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:24,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:54:24,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795360315] [2019-11-15 23:54:24,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732016778] [2019-11-15 23:54:24,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:54:24,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:54:24,516 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:24,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-15 23:54:24,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020220913] [2019-11-15 23:54:24,517 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:54:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1408722332, now seen corresponding path program 1 times [2019-11-15 23:54:24,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:24,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190010192] [2019-11-15 23:54:24,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:24,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:24,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:54:24,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190010192] [2019-11-15 23:54:24,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067506525] [2019-11-15 23:54:24,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:24,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:54:24,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:54:24,756 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:24,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 23:54:24,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266204907] [2019-11-15 23:54:24,757 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:54:24,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:24,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:54:24,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:54:24,758 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 12 states. [2019-11-15 23:54:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:24,970 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2019-11-15 23:54:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:54:24,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 158 transitions. [2019-11-15 23:54:24,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:54:24,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 113 states and 156 transitions. [2019-11-15 23:54:24,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-15 23:54:24,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 23:54:24,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 156 transitions. [2019-11-15 23:54:24,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:24,982 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-11-15 23:54:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 156 transitions. [2019-11-15 23:54:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 23:54:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 23:54:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2019-11-15 23:54:24,993 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-11-15 23:54:24,993 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-11-15 23:54:24,993 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:54:24,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 156 transitions. [2019-11-15 23:54:24,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:54:24,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:24,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:24,997 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:24,997 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:54:24,997 INFO L791 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 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~ret0;havoc #t~ret1; 1339#fiboFINAL assume true; 1332#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 23:54:24,997 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~ret0;havoc #t~ret1; 1258#fiboFINAL assume true; 1264#fiboEXIT >#32#return; 1260#L11-1 [2019-11-15 23:54:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292419, now seen corresponding path program 2 times [2019-11-15 23:54:24,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:24,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123613010] [2019-11-15 23:54:24,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:24,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:24,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:25,014 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash 22774646, now seen corresponding path program 2 times [2019-11-15 23:54:25,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:25,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098470419] [2019-11-15 23:54:25,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:25,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:25,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:25,025 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:25,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:25,026 INFO L82 PathProgramCache]: Analyzing trace with hash 560101880, now seen corresponding path program 3 times [2019-11-15 23:54:25,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:25,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103250717] [2019-11-15 23:54:25,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:25,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:25,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 52 proven. 67 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 23:54:25,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103250717] [2019-11-15 23:54:25,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137017387] [2019-11-15 23:54:25,182 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:25,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 23:54:25,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:54:25,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:54:25,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 63 proven. 69 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 23:54:25,356 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:25,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-15 23:54:25,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899623067] [2019-11-15 23:54:25,605 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:25,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:25,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:25,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:25,605 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:54:25,605 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:25,605 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:25,605 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:25,605 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration5_Loop [2019-11-15 23:54:25,605 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:25,606 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:25,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:25,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:25,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:25,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:25,684 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:25,684 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:25,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:25,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:25,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:25,692 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:25,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:25,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:25,699 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:25,700 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:25,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:25,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:25,713 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:25,713 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:25,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:25,721 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:25,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:54:25,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:26,284 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:54:26,297 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:26,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:26,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:26,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:26,298 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:54:26,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:26,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:26,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:26,298 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration5_Loop [2019-11-15 23:54:26,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:26,299 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:26,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:26,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:26,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:26,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:26,377 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:26,377 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:54:26,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:26,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:26,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:26,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:26,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:26,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:26,379 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:26,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:26,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:26,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:26,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:26,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:26,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:26,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:26,382 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:26,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:26,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:26,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:26,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:26,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:26,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:26,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:26,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:26,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:26,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:26,384 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:26,388 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:54:26,392 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:54:26,392 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:54:26,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:54:26,393 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:54:26,393 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:54:26,393 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2019-11-15 23:54:26,393 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:54:26,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:54:26,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:26,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:26,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:54:26,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:54:26,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:54:26,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49 Second operand 8 states. [2019-11-15 23:54:26,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49. Second operand 8 states. Result 182 states and 248 transitions. Complement of second has 33 states. [2019-11-15 23:54:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:54:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2019-11-15 23:54:26,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 23:54:26,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:26,840 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:54:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:54:26,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:26,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:54:26,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:54:26,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:54:26,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49 Second operand 8 states. [2019-11-15 23:54:27,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49. Second operand 8 states. Result 307 states and 417 transitions. Complement of second has 25 states. [2019-11-15 23:54:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:54:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 23:54:27,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 23:54:27,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:27,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:54:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:27,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:54:27,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:27,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:54:27,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:54:27,392 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:54:27,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49 Second operand 8 states. [2019-11-15 23:54:27,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 156 transitions. cyclomatic complexity: 49. Second operand 8 states. Result 1077 states and 1514 transitions. Complement of second has 130 states. [2019-11-15 23:54:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:54:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-15 23:54:27,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 22 letters. [2019-11-15 23:54:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 53 letters. Loop has 22 letters. [2019-11-15 23:54:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 31 letters. Loop has 44 letters. [2019-11-15 23:54:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:27,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1514 transitions. [2019-11-15 23:54:27,692 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2019-11-15 23:54:27,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 604 states and 937 transitions. [2019-11-15 23:54:27,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2019-11-15 23:54:27,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2019-11-15 23:54:27,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 937 transitions. [2019-11-15 23:54:27,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:27,721 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 937 transitions. [2019-11-15 23:54:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 937 transitions. [2019-11-15 23:54:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 475. [2019-11-15 23:54:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-11-15 23:54:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 723 transitions. [2019-11-15 23:54:27,782 INFO L711 BuchiCegarLoop]: Abstraction has 475 states and 723 transitions. [2019-11-15 23:54:27,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:27,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:54:27,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:54:27,783 INFO L87 Difference]: Start difference. First operand 475 states and 723 transitions. Second operand 16 states. [2019-11-15 23:54:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:28,152 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2019-11-15 23:54:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:54:28,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 188 transitions. [2019-11-15 23:54:28,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:54:28,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 188 transitions. [2019-11-15 23:54:28,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2019-11-15 23:54:28,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-15 23:54:28,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 188 transitions. [2019-11-15 23:54:28,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:28,160 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 188 transitions. [2019-11-15 23:54:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 188 transitions. [2019-11-15 23:54:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-11-15 23:54:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:54:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2019-11-15 23:54:28,165 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-11-15 23:54:28,165 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-11-15 23:54:28,165 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:54:28,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 142 transitions. [2019-11-15 23:54:28,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:54:28,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:28,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:28,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2019-11-15 23:54:28,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:54:28,168 INFO L791 eck$LassoCheckResult]: Stem: 4528#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 4529#L25 call main_#t~ret2 := fibo(main_~x~0);< 4551#fiboENTRY ~n := #in~n; 4549#L6 assume !(~n < 1); 4550#L8 assume !(1 == ~n); 4540#L11 call #t~ret0 := fibo(~n - 1);< 4539#fiboENTRY ~n := #in~n; 4541#L6 assume !(~n < 1); 4574#L8 assume !(1 == ~n); 4533#L11 call #t~ret0 := fibo(~n - 1);< 4548#fiboENTRY ~n := #in~n; 4572#L6 assume !(~n < 1); 4532#L8 assume !(1 == ~n); 4534#L11 call #t~ret0 := fibo(~n - 1);< 4548#fiboENTRY ~n := #in~n; 4572#L6 assume !(~n < 1); 4532#L8 assume !(1 == ~n); 4534#L11 call #t~ret0 := fibo(~n - 1);< 4548#fiboENTRY ~n := #in~n; 4573#L6 assume !(~n < 1); 4610#L8 assume 1 == ~n;#res := 1; 4609#fiboFINAL assume true; 4608#fiboEXIT >#32#return; 4605#L11-1 call #t~ret1 := fibo(~n - 2);< 4607#fiboENTRY ~n := #in~n; 4629#L6 assume ~n < 1;#res := 0; 4627#fiboFINAL assume true; 4625#fiboEXIT >#34#return; 4624#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 4623#fiboFINAL assume true; 4595#fiboEXIT >#32#return; 4576#L11-1 call #t~ret1 := fibo(~n - 2);< 4587#fiboENTRY ~n := #in~n; 4628#L6 assume ~n < 1;#res := 0; 4626#fiboFINAL assume true; 4585#fiboEXIT >#34#return; 4583#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 4581#fiboFINAL assume true; 4575#fiboEXIT >#32#return; 4562#L11-1 call #t~ret1 := fibo(~n - 2);< 4568#fiboENTRY ~n := #in~n; 4567#L6 assume !(~n < 1); 4564#L8 assume !(1 == ~n); 4566#L11 call #t~ret0 := fibo(~n - 1);< 4620#fiboENTRY ~n := #in~n; 4633#L6 assume !(~n < 1); 4634#L8 assume !(1 == ~n); 4520#L11 call #t~ret0 := fibo(~n - 1);< 4547#fiboENTRY [2019-11-15 23:54:28,168 INFO L793 eck$LassoCheckResult]: Loop: 4547#fiboENTRY ~n := #in~n; 4636#L6 assume !(~n < 1); 4631#L8 assume !(1 == ~n); 4519#L11 call #t~ret0 := fibo(~n - 1);< 4547#fiboENTRY [2019-11-15 23:54:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -918730881, now seen corresponding path program 4 times [2019-11-15 23:54:28,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:28,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974712678] [2019-11-15 23:54:28,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 23:54:28,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974712678] [2019-11-15 23:54:28,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667421024] [2019-11-15 23:54:28,340 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:28,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:54:28,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:54:28,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:54:28,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 23:54:28,513 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:28,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-11-15 23:54:28,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121639817] [2019-11-15 23:54:28,514 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:54:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2019-11-15 23:54:28,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:28,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529146763] [2019-11-15 23:54:28,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:28,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:28,564 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:28,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:28,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:28,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:28,565 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:54:28,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:28,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:28,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration6_Loop [2019-11-15 23:54:28,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:28,565 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:28,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,619 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:28,619 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:54:28,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:28,630 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,634 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:28,634 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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:28,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:28,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:28,647 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_7d756567-acf0-4e43-8809-1a327b756398/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:28,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:28,655 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:54:28,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_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:54:28,660 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d756567-acf0-4e43-8809-1a327b756398/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:54:28,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:54:28,711 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:54:28,713 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:28,713 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:28,713 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:28,713 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:28,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:54:28,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:28,714 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:28,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:28,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5-1.c_Iteration6_Loop [2019-11-15 23:54:28,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:28,714 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:28,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:28,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-15 23:54:28,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-15 23:54:28,757 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:54:28,758 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:54:28,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:28,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:28,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:28,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:28,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:28,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:28,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:28,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:28,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:28,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:28,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:28,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:28,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:28,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:28,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:28,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:28,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:28,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:28,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:28,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:28,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:28,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:28,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:28,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:28,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:28,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:28,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:54:28,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:54:28,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:54:28,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:54:28,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:54:28,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:54:28,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:54:28,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:54:28,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:54:28,766 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:54:28,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:54:28,768 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:54:28,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:54:28,768 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:54:28,768 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:54:28,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2019-11-15 23:54:28,769 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:54:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:54:28,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:28,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:28,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:28,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:28,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:54:28,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:28,898 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:54:28,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-15 23:54:28,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 131 states and 152 transitions. Complement of second has 13 states. [2019-11-15 23:54:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:54:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:54:28,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-15 23:54:28,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:28,966 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:54:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:54:29,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:29,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:54:29,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:29,100 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:54:29,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-15 23:54:29,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 131 states and 152 transitions. Complement of second has 13 states. [2019-11-15 23:54:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:54:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:54:29,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-15 23:54:29,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:29,180 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:54:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:54:29,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:54:29,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:29,317 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:54:29,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24 Second operand 5 states. [2019-11-15 23:54:29,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 142 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 170 states and 193 transitions. Complement of second has 14 states. [2019-11-15 23:54:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:54:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:54:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 23:54:29,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-15 23:54:29,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:29,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 52 letters. Loop has 4 letters. [2019-11-15 23:54:29,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:29,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 48 letters. Loop has 8 letters. [2019-11-15 23:54:29,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:54:29,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 193 transitions. [2019-11-15 23:54:29,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:54:29,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 0 states and 0 transitions. [2019-11-15 23:54:29,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:54:29,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:54:29,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:54:29,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:54:29,416 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:29,417 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:29,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:54:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:54:29,417 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 19 states. [2019-11-15 23:54:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:29,417 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 23:54:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:54:29,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:54:29,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:54:29,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:54:29,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:54:29,418 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:54:29,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:54:29,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:54:29,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:54:29,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:54:29 BoogieIcfgContainer [2019-11-15 23:54:29,423 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:54:29,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:54:29,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:54:29,425 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:54:29,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:21" (3/4) ... [2019-11-15 23:54:29,437 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:54:29,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:54:29,439 INFO L168 Benchmark]: Toolchain (without parser) took 8629.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.8 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:29,439 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:29,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:29,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:29,440 INFO L168 Benchmark]: Boogie Preprocessor took 17.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:29,440 INFO L168 Benchmark]: RCFGBuilder took 209.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:29,441 INFO L168 Benchmark]: BuchiAutomizer took 8063.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:29,441 INFO L168 Benchmark]: Witness Printer took 12.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-15 23:54:29,444 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8063.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. * Witness Printer took 12.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 9 terminating modules (5 trivial, 2 deterministic, 2 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 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. 5 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 7 iterations. TraceHistogramMax:9. Analysis of lassos took 4.3s. Construction of modules took 0.7s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 189 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 121 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/26 HoareTripleCheckerStatistics: 144 SDtfs, 387 SDslu, 153 SDs, 0 SdLazy, 699 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI2 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf93 smp79 dnf100 smp100 tf110 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...