./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e21c3699338992ddad7e6d15f4351c8cc3315b0b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:37:19,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:37:19,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:37:19,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:37:19,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:37:19,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:37:19,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:37:19,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:37:19,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:37:19,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:37:19,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:37:19,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:37:19,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:37:19,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:37:19,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:37:19,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:37:19,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:37:19,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:37:19,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:37:19,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:37:19,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:37:19,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:37:19,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:37:19,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:37:19,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:37:19,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:37:19,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:37:19,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:37:19,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:37:19,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:37:19,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:37:19,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:37:19,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:37:19,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:37:19,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:37:19,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:37:19,651 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:37:19,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:37:19,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:37:19,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:37:19,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:37:19,663 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:37:19,663 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:37:19,663 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:37:19,663 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:37:19,664 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:37:19,664 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:37:19,664 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:37:19,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:37:19,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:37:19,665 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:37:19,665 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:37:19,665 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:37:19,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:37:19,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:37:19,666 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:37:19,666 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:37:19,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:37:19,666 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:37:19,666 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:37:19,667 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:37:19,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:37:19,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:37:19,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:37:19,667 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:37:19,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:37:19,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:37:19,668 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:37:19,669 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:37:19,669 INFO L133 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/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-11-18 11:37:19,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:37:19,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:37:19,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:37:19,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:37:19,709 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:37:19,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 11:37:19,745 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/data/4d3dbe3f3/62656ad7534840d3bc29292f978325e8/FLAGc6365bd73 [2018-11-18 11:37:20,038 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:37:20,038 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 11:37:20,042 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/data/4d3dbe3f3/62656ad7534840d3bc29292f978325e8/FLAGc6365bd73 [2018-11-18 11:37:20,051 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/data/4d3dbe3f3/62656ad7534840d3bc29292f978325e8 [2018-11-18 11:37:20,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:37:20,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:37:20,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:37:20,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:37:20,056 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:37:20,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f35898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20, skipping insertion in model container [2018-11-18 11:37:20,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:37:20,074 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:37:20,178 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:37:20,180 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:37:20,190 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:37:20,198 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:37:20,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20 WrapperNode [2018-11-18 11:37:20,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:37:20,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:37:20,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:37:20,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:37:20,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:37:20,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:37:20,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:37:20,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:37:20,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... [2018-11-18 11:37:20,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:37:20,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:37:20,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:37:20,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:37:20,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:37:20,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:37:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-18 11:37:20,313 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-18 11:37:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-18 11:37:20,313 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-18 11:37:20,423 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:37:20,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:20 BoogieIcfgContainer [2018-11-18 11:37:20,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:37:20,424 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:37:20,424 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:37:20,427 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:37:20,427 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:37:20,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:37:20" (1/3) ... [2018-11-18 11:37:20,428 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d03501b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:37:20, skipping insertion in model container [2018-11-18 11:37:20,429 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:37:20,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:20" (2/3) ... [2018-11-18 11:37:20,429 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d03501b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:37:20, skipping insertion in model container [2018-11-18 11:37:20,429 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:37:20,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:20" (3/3) ... [2018-11-18 11:37:20,431 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 11:37:20,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:37:20,480 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:37:20,480 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:37:20,480 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:37:20,480 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:37:20,480 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:37:20,480 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:37:20,480 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:37:20,480 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:37:20,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 11:37:20,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 11:37:20,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:20,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:20,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:37:20,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:20,526 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:37:20,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 11:37:20,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 11:37:20,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:20,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:20,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:37:20,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:20,535 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 17#L37true call main_#t~ret4 := fibo1(main_~x~0);< 25#fibo1ENTRYtrue [2018-11-18 11:37:20,536 INFO L796 eck$LassoCheckResult]: Loop: 25#fibo1ENTRYtrue ~n := #in~n; 13#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 19#L13true call #t~ret0 := fibo2(~n - 1);< 11#fibo2ENTRYtrue ~n := #in~n; 28#L18true assume !(~n < 1); 26#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 25#fibo1ENTRYtrue [2018-11-18 11:37:20,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2018-11-18 11:37:20,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:20,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:20,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:20,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2018-11-18 11:37:20,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:20,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:20,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:20,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:20,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2018-11-18 11:37:20,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:20,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:20,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:20,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:20,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:20,791 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:20,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:20,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:20,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:20,792 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:37:20,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:20,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:20,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:20,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-18 11:37:20,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:20,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:20,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:20,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:20,938 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:20,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:20,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:20,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:20,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:20,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:20,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:20,998 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:20,998 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,027 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,027 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,071 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,092 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,093 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,125 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,149 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,178 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:21,178 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:21,193 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:37:21,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:21,250 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:37:21,251 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:21,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:21,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:21,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:21,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:37:21,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:21,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:21,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:21,252 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-18 11:37:21,252 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:21,252 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:21,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:21,319 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:21,323 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:37:21,325 INFO L122 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 [2018-11-18 11:37:21,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,333 INFO L122 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 [2018-11-18 11:37:21,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,336 INFO L122 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 [2018-11-18 11:37:21,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,339 INFO L122 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 [2018-11-18 11:37:21,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,343 INFO L122 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 [2018-11-18 11:37:21,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,346 INFO L122 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 [2018-11-18 11:37:21,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,349 INFO L122 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 [2018-11-18 11:37:21,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,352 INFO L122 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 [2018-11-18 11:37:21,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:21,356 INFO L122 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 [2018-11-18 11:37:21,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:21,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:21,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:21,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:21,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:21,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:21,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:21,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:37:21,365 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:37:21,366 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:37:21,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:37:21,368 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:37:21,368 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:37:21,368 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-18 11:37:21,369 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:37:21,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:21,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:21,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 11:37:21,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 6 states. [2018-11-18 11:37:21,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 6 states. Result 84 states and 116 transitions. Complement of second has 24 states. [2018-11-18 11:37:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 11:37:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 11:37:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-18 11:37:21,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 11:37:21,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:21,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-18 11:37:21,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:21,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2018-11-18 11:37:21,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:21,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2018-11-18 11:37:21,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 11:37:21,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2018-11-18 11:37:21,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 11:37:21,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 11:37:21,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2018-11-18 11:37:21,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:21,718 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-18 11:37:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2018-11-18 11:37:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-18 11:37:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 11:37:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-18 11:37:21,741 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-18 11:37:21,742 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-18 11:37:21,742 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:37:21,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2018-11-18 11:37:21,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 11:37:21,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:21,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:21,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:21,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:21,745 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 214#L37 call main_#t~ret4 := fibo1(main_~x~0);< 216#fibo1ENTRY ~n := #in~n; 228#L8 assume !(~n < 1); 213#L10 assume !(1 == ~n); 205#L13 call #t~ret0 := fibo2(~n - 1);< 221#fibo2ENTRY ~n := #in~n; 248#L18 assume !(~n < 1); 249#L20 assume !(1 == ~n); 200#L23 call #t~ret2 := fibo1(~n - 1);< 203#fibo1ENTRY ~n := #in~n; 229#L8 assume ~n < 1;#res := 0; 212#fibo1FINAL assume true; 219#fibo1EXIT >#46#return; 215#L23-1 [2018-11-18 11:37:21,745 INFO L796 eck$LassoCheckResult]: Loop: 215#L23-1 call #t~ret3 := fibo1(~n - 2);< 199#fibo1ENTRY ~n := #in~n; 244#L8 assume !(~n < 1); 242#L10 assume !(1 == ~n); 198#L13 call #t~ret0 := fibo2(~n - 1);< 222#fibo2ENTRY ~n := #in~n; 241#L18 assume !(~n < 1); 237#L20 assume !(1 == ~n); 196#L23 call #t~ret2 := fibo1(~n - 1);< 199#fibo1ENTRY ~n := #in~n; 244#L8 assume ~n < 1;#res := 0; 224#fibo1FINAL assume true; 225#fibo1EXIT >#46#return; 215#L23-1 [2018-11-18 11:37:21,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2018-11-18 11:37:21,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:21,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:37:21,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:37:21,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:37:21,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:21,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2018-11-18 11:37:21,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:37:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:37:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:37:21,853 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:37:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:37:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:37:21,856 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-11-18 11:37:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:21,920 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-18 11:37:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:37:21,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-11-18 11:37:21,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 11:37:21,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2018-11-18 11:37:21,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-18 11:37:21,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-18 11:37:21,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2018-11-18 11:37:21,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:21,926 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-11-18 11:37:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2018-11-18 11:37:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-18 11:37:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 11:37:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-11-18 11:37:21,932 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-18 11:37:21,932 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2018-11-18 11:37:21,933 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:37:21,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2018-11-18 11:37:21,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 11:37:21,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:21,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:21,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:21,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:21,935 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 343#L37 call main_#t~ret4 := fibo1(main_~x~0);< 344#fibo1ENTRY ~n := #in~n; 372#L8 assume !(~n < 1); 348#L10 assume !(1 == ~n); 339#L13 call #t~ret0 := fibo2(~n - 1);< 358#fibo2ENTRY ~n := #in~n; 388#L18 assume !(~n < 1); 389#L20 assume !(1 == ~n); 337#L23 call #t~ret2 := fibo1(~n - 1);< 342#fibo1ENTRY ~n := #in~n; 367#L8 assume !(~n < 1); 383#L10 assume 1 == ~n;#res := 1; 382#fibo1FINAL assume true; 378#fibo1EXIT >#46#return; 346#L23-1 [2018-11-18 11:37:21,935 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 336#fibo1ENTRY ~n := #in~n; 366#L8 assume !(~n < 1); 345#L10 assume !(1 == ~n); 335#L13 call #t~ret0 := fibo2(~n - 1);< 381#fibo2ENTRY ~n := #in~n; 386#L18 assume !(~n < 1); 376#L20 assume !(1 == ~n); 333#L23 call #t~ret2 := fibo1(~n - 1);< 336#fibo1ENTRY ~n := #in~n; 366#L8 assume !(~n < 1); 345#L10 assume 1 == ~n;#res := 1; 347#fibo1FINAL assume true; 362#fibo1EXIT >#46#return; 346#L23-1 [2018-11-18 11:37:21,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2018-11-18 11:37:21,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:21,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:21,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:21,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:21,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:21,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:22,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:22,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-18 11:37:22,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:22,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2018-11-18 11:37:22,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:22,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:22,119 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:22,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:22,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:22,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:22,119 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:37:22,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:22,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:22,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:22,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-18 11:37:22,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:22,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:22,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:22,156 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:22,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:22,158 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:22,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:22,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:22,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:22,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:22,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:22,179 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:22,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:22,195 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:22,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:37:22,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:22,880 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:37:22,882 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:22,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:22,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:22,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:22,883 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:37:22,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:22,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:22,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:22,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-18 11:37:22,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:22,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:22,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:22,927 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:22,927 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:37:22,928 INFO L122 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 [2018-11-18 11:37:22,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:22,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:22,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:22,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:22,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:22,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:22,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:22,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:22,932 INFO L122 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 [2018-11-18 11:37:22,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:22,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:22,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:22,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:22,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:22,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:22,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:22,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:22,936 INFO L122 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 [2018-11-18 11:37:22,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:22,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:22,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:22,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:22,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:22,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:22,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:22,940 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:37:22,943 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:37:22,943 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:37:22,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:37:22,944 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:37:22,944 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:37:22,944 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-11-18 11:37:22,944 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:37:22,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:22,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:22,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:23,067 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-18 11:37:23,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-18 11:37:23,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 191 states and 263 transitions. Complement of second has 26 states. [2018-11-18 11:37:23,246 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 [2018-11-18 11:37:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 11:37:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-18 11:37:23,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-18 11:37:23,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:23,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 30 letters. Loop has 14 letters. [2018-11-18 11:37:23,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:23,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 16 letters. Loop has 28 letters. [2018-11-18 11:37:23,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:23,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. [2018-11-18 11:37:23,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 11:37:23,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2018-11-18 11:37:23,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-18 11:37:23,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-18 11:37:23,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2018-11-18 11:37:23,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:23,256 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2018-11-18 11:37:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2018-11-18 11:37:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-18 11:37:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 11:37:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2018-11-18 11:37:23,264 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2018-11-18 11:37:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:37:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:37:23,264 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand 9 states. [2018-11-18 11:37:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:23,340 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2018-11-18 11:37:23,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:37:23,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 244 transitions. [2018-11-18 11:37:23,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 11:37:23,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 180 states and 240 transitions. [2018-11-18 11:37:23,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-18 11:37:23,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-18 11:37:23,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 240 transitions. [2018-11-18 11:37:23,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:23,349 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 240 transitions. [2018-11-18 11:37:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 240 transitions. [2018-11-18 11:37:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-11-18 11:37:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-18 11:37:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2018-11-18 11:37:23,359 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-18 11:37:23,359 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 225 transitions. [2018-11-18 11:37:23,359 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:37:23,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 225 transitions. [2018-11-18 11:37:23,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 11:37:23,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:23,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:23,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 11:37:23,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 11:37:23,365 INFO L794 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1154#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1155#fibo1ENTRY ~n := #in~n; 1219#L8 assume !(~n < 1); 1218#L10 assume !(1 == ~n); 1132#L13 call #t~ret0 := fibo2(~n - 1);< 1164#fibo2ENTRY ~n := #in~n; 1281#L18 assume !(~n < 1); 1280#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1216#L8 assume !(~n < 1); 1215#L10 assume !(1 == ~n); 1128#L13 call #t~ret0 := fibo2(~n - 1);< 1208#fibo2ENTRY ~n := #in~n; 1212#L18 assume !(~n < 1); 1213#L20 assume !(1 == ~n); 1127#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1216#L8 assume !(~n < 1); 1215#L10 assume !(1 == ~n); 1128#L13 call #t~ret0 := fibo2(~n - 1);< 1208#fibo2ENTRY ~n := #in~n; 1212#L18 assume ~n < 1;#res := 0; 1211#fibo2FINAL assume true; 1207#fibo2EXIT >#50#return; 1129#L13-1 call #t~ret1 := fibo2(~n - 2);< 1168#fibo2ENTRY ~n := #in~n; 1178#L18 assume !(~n < 1); 1185#L20 assume !(1 == ~n); 1127#L23 call #t~ret2 := fibo1(~n - 1);< 1130#fibo1ENTRY ~n := #in~n; 1217#L8 assume !(~n < 1); 1223#L10 assume 1 == ~n;#res := 1; 1222#fibo1FINAL assume true; 1220#fibo1EXIT >#46#return; 1204#L23-1 call #t~ret3 := fibo1(~n - 2);< 1136#fibo1ENTRY ~n := #in~n; 1210#L8 assume !(~n < 1); 1206#L10 assume !(1 == ~n); 1134#L13 call #t~ret0 := fibo2(~n - 1);< 1203#fibo2ENTRY ~n := #in~n; 1200#L18 assume ~n < 1;#res := 0; 1201#fibo2FINAL assume true; 1209#fibo2EXIT >#50#return; 1135#L13-1 call #t~ret1 := fibo2(~n - 2);< 1203#fibo2ENTRY ~n := #in~n; 1200#L18 assume !(~n < 1); 1196#L20 assume 1 == ~n;#res := 1; 1137#fibo2FINAL assume true; 1138#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-18 11:37:23,366 INFO L796 eck$LassoCheckResult]: Loop: 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(1 == ~n); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume !(~n < 1); 1183#L20 assume !(1 == ~n); 1122#L23 call #t~ret2 := fibo1(~n - 1);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#46#return; 1162#L23-1 call #t~ret3 := fibo1(~n - 2);< 1126#fibo1ENTRY ~n := #in~n; 1263#L8 assume !(~n < 1); 1260#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#50#return; 1125#L13-1 call #t~ret1 := fibo2(~n - 2);< 1163#fibo2ENTRY ~n := #in~n; 1177#L18 assume ~n < 1;#res := 0; 1184#fibo2FINAL assume true; 1269#fibo2EXIT >#52#return; 1266#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1279#fibo1FINAL assume true; 1276#fibo1EXIT >#48#return; 1274#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1271#fibo2FINAL assume true; 1268#fibo2EXIT >#50#return; 1125#L13-1 [2018-11-18 11:37:23,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash 376035563, now seen corresponding path program 1 times [2018-11-18 11:37:23,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:23,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:23,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-18 11:37:23,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:23,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:23,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:23,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-18 11:37:23,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:23,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2018-11-18 11:37:23,569 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:23,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 36254641, now seen corresponding path program 1 times [2018-11-18 11:37:23,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 11:37:23,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:23,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:23,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:23,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:37:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:37:23,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-18 11:37:23,659 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:37:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:37:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:37:23,659 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-11-18 11:37:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:23,688 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2018-11-18 11:37:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:37:23,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 236 transitions. [2018-11-18 11:37:23,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 11:37:23,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 172 states and 222 transitions. [2018-11-18 11:37:23,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-18 11:37:23,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-18 11:37:23,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 222 transitions. [2018-11-18 11:37:23,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:23,695 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 222 transitions. [2018-11-18 11:37:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 222 transitions. [2018-11-18 11:37:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2018-11-18 11:37:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 11:37:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2018-11-18 11:37:23,704 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-18 11:37:23,704 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 206 transitions. [2018-11-18 11:37:23,705 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:37:23,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 206 transitions. [2018-11-18 11:37:23,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 11:37:23,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:23,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:23,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 11:37:23,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:23,708 INFO L794 eck$LassoCheckResult]: Stem: 1933#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1928#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1908#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1910#fibo1ENTRY ~n := #in~n; 1941#L8 assume !(~n < 1); 1907#L10 assume !(1 == ~n); 1909#L13 call #t~ret0 := fibo2(~n - 1);< 1918#fibo2ENTRY ~n := #in~n; 2020#L18 assume !(~n < 1); 2019#L20 assume !(1 == ~n); 1923#L23 call #t~ret2 := fibo1(~n - 1);< 1891#fibo1ENTRY ~n := #in~n; 1973#L8 assume !(~n < 1); 1971#L10 assume !(1 == ~n); 1889#L13 call #t~ret0 := fibo2(~n - 1);< 1968#fibo2ENTRY ~n := #in~n; 1974#L18 assume !(~n < 1); 1972#L20 assume !(1 == ~n); 1888#L23 call #t~ret2 := fibo1(~n - 1);< 1891#fibo1ENTRY ~n := #in~n; 1973#L8 assume !(~n < 1); 1971#L10 assume !(1 == ~n); 1889#L13 call #t~ret0 := fibo2(~n - 1);< 1968#fibo2ENTRY ~n := #in~n; 1974#L18 assume !(~n < 1); 1972#L20 assume 1 == ~n;#res := 1; 1970#fibo2FINAL assume true; 1967#fibo2EXIT >#50#return; 1890#L13-1 call #t~ret1 := fibo2(~n - 2);< 1924#fibo2ENTRY ~n := #in~n; 1937#L18 assume !(~n < 1); 1943#L20 assume !(1 == ~n); 1888#L23 call #t~ret2 := fibo1(~n - 1);< 1891#fibo1ENTRY ~n := #in~n; 1975#L8 assume !(~n < 1); 1979#L10 assume 1 == ~n;#res := 1; 1980#fibo1FINAL assume true; 1976#fibo1EXIT >#46#return; 1963#L23-1 call #t~ret3 := fibo1(~n - 2);< 1903#fibo1ENTRY ~n := #in~n; 1969#L8 assume !(~n < 1); 1964#L10 assume !(1 == ~n); 1902#L13 call #t~ret0 := fibo2(~n - 1);< 1961#fibo2ENTRY ~n := #in~n; 1959#L18 assume !(~n < 1); 1952#L20 assume 1 == ~n;#res := 1; 1953#fibo2FINAL assume true; 2004#fibo2EXIT >#50#return; 1934#L13-1 call #t~ret1 := fibo2(~n - 2);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume ~n < 1;#res := 0; 2018#fibo2FINAL assume true; 2023#fibo2EXIT >#52#return; 1996#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2021#fibo1FINAL assume true; 2010#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2002#fibo2FINAL assume true; 1997#fibo2EXIT >#52#return; 1996#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2021#fibo1FINAL assume true; 2010#fibo1EXIT >#46#return; 1999#L23-1 call #t~ret3 := fibo1(~n - 2);< 2012#fibo1ENTRY ~n := #in~n; 2031#L8 assume !(~n < 1); 2013#L10 assume !(1 == ~n); 1935#L13 call #t~ret0 := fibo2(~n - 1);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 2017#L20 assume 1 == ~n;#res := 1; 2015#fibo2FINAL assume true; 2003#fibo2EXIT >#50#return; 1934#L13-1 call #t~ret1 := fibo2(~n - 2);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume ~n < 1;#res := 0; 2018#fibo2FINAL assume true; 2023#fibo2EXIT >#52#return; 1996#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2021#fibo1FINAL assume true; 2010#fibo1EXIT >#48#return; 2006#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2002#fibo2FINAL assume true; 1997#fibo2EXIT >#50#return; 1934#L13-1 [2018-11-18 11:37:23,708 INFO L796 eck$LassoCheckResult]: Loop: 1934#L13-1 call #t~ret1 := fibo2(~n - 2);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 2017#L20 assume !(1 == ~n); 1998#L23 call #t~ret2 := fibo1(~n - 1);< 2012#fibo1ENTRY ~n := #in~n; 2031#L8 assume !(~n < 1); 2013#L10 assume !(1 == ~n); 1935#L13 call #t~ret0 := fibo2(~n - 1);< 1922#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 2017#L20 assume 1 == ~n;#res := 1; 2015#fibo2FINAL assume true; 2003#fibo2EXIT >#50#return; 1934#L13-1 [2018-11-18 11:37:23,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 821073247, now seen corresponding path program 2 times [2018-11-18 11:37:23,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:23,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-18 11:37:23,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:23,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:23,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 11:37:23,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:37:23,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:37:23,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-18 11:37:23,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:23,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-11-18 11:37:23,903 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:23,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2018-11-18 11:37:23,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:37:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:23,991 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:23,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:23,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:23,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:23,992 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:37:23,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:23,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:23,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:23,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-18 11:37:23,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:23,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:23,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:23,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:23,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:23,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:23,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:24,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:24,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:24,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:24,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:24,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:24,050 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:24,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,060 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:24,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:24,062 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:24,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:24,079 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:24,079 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:24,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:24,098 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:24,098 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:24,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:24,116 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:24,116 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/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 [2018-11-18 11:37:24,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:24,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:24,133 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:24,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:24,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:37:24,151 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:24,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:24,166 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:24,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:37:24,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:25,275 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:37:25,277 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:25,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:25,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:25,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:25,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:37:25,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:25,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:25,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:25,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-18 11:37:25,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:25,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:25,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:25,326 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:25,326 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:37:25,327 INFO L122 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 [2018-11-18 11:37:25,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:25,329 INFO L122 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 [2018-11-18 11:37:25,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:25,337 INFO L122 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 [2018-11-18 11:37:25,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:25,339 INFO L122 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 [2018-11-18 11:37:25,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:25,341 INFO L122 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 [2018-11-18 11:37:25,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:25,344 INFO L122 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 [2018-11-18 11:37:25,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:37:25,345 INFO L122 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 [2018-11-18 11:37:25,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:25,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:25,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:25,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:25,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:25,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:25,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:25,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:37:25,353 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:37:25,353 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:37:25,353 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:37:25,353 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:37:25,354 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:37:25,354 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-11-18 11:37:25,355 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:37:25,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:25,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:25,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:25,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-18 11:37:25,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-18 11:37:25,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 880 states and 1168 transitions. Complement of second has 26 states. [2018-11-18 11:37:25,793 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 [2018-11-18 11:37:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 11:37:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-11-18 11:37:25,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-18 11:37:25,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:25,794 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:37:25,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:25,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:25,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:26,018 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-18 11:37:26,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-18 11:37:26,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 670 states and 943 transitions. Complement of second has 24 states. [2018-11-18 11:37:26,204 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 [2018-11-18 11:37:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 11:37:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-18 11:37:26,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-18 11:37:26,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:26,206 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:37:26,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:26,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:26,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:26,362 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 7 loop predicates [2018-11-18 11:37:26,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-11-18 11:37:26,541 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 206 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1661 states and 2157 transitions. Complement of second has 90 states. [2018-11-18 11:37:26,544 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 [2018-11-18 11:37:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 11:37:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2018-11-18 11:37:26,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 14 letters. [2018-11-18 11:37:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 97 letters. Loop has 14 letters. [2018-11-18 11:37:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 83 letters. Loop has 28 letters. [2018-11-18 11:37:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:26,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1661 states and 2157 transitions. [2018-11-18 11:37:26,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-18 11:37:26,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1661 states to 1189 states and 1644 transitions. [2018-11-18 11:37:26,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2018-11-18 11:37:26,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-18 11:37:26,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1189 states and 1644 transitions. [2018-11-18 11:37:26,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:26,573 INFO L705 BuchiCegarLoop]: Abstraction has 1189 states and 1644 transitions. [2018-11-18 11:37:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states and 1644 transitions. [2018-11-18 11:37:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1042. [2018-11-18 11:37:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2018-11-18 11:37:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1431 transitions. [2018-11-18 11:37:26,611 INFO L728 BuchiCegarLoop]: Abstraction has 1042 states and 1431 transitions. [2018-11-18 11:37:26,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 11:37:26,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:37:26,612 INFO L87 Difference]: Start difference. First operand 1042 states and 1431 transitions. Second operand 17 states. [2018-11-18 11:37:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:26,889 INFO L93 Difference]: Finished difference Result 417 states and 563 transitions. [2018-11-18 11:37:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 11:37:26,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 563 transitions. [2018-11-18 11:37:26,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 11:37:26,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 368 states and 505 transitions. [2018-11-18 11:37:26,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2018-11-18 11:37:26,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2018-11-18 11:37:26,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 505 transitions. [2018-11-18 11:37:26,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:26,896 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 505 transitions. [2018-11-18 11:37:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 505 transitions. [2018-11-18 11:37:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 333. [2018-11-18 11:37:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-18 11:37:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 445 transitions. [2018-11-18 11:37:26,903 INFO L728 BuchiCegarLoop]: Abstraction has 333 states and 445 transitions. [2018-11-18 11:37:26,903 INFO L608 BuchiCegarLoop]: Abstraction has 333 states and 445 transitions. [2018-11-18 11:37:26,904 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:37:26,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 445 transitions. [2018-11-18 11:37:26,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 11:37:26,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:26,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:26,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:26,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2018-11-18 11:37:26,908 INFO L794 eck$LassoCheckResult]: Stem: 8140#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8102#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8103#fibo1ENTRY ~n := #in~n; 8212#L8 assume !(~n < 1); 8207#L10 assume !(1 == ~n); 8075#L13 call #t~ret0 := fibo2(~n - 1);< 8202#fibo2ENTRY ~n := #in~n; 8186#L18 assume !(~n < 1); 8187#L20 assume !(1 == ~n); 8074#L23 call #t~ret2 := fibo1(~n - 1);< 8076#fibo1ENTRY ~n := #in~n; 8211#L8 assume !(~n < 1); 8206#L10 assume !(1 == ~n); 8183#L13 call #t~ret0 := fibo2(~n - 1);< 8192#fibo2ENTRY ~n := #in~n; 8193#L18 assume !(~n < 1); 8182#L20 assume !(1 == ~n); 8185#L23 call #t~ret2 := fibo1(~n - 1);< 8214#fibo1ENTRY ~n := #in~n; 8210#L8 assume !(~n < 1); 8205#L10 assume !(1 == ~n); 8184#L13 call #t~ret0 := fibo2(~n - 1);< 8192#fibo2ENTRY ~n := #in~n; 8193#L18 assume !(~n < 1); 8182#L20 assume !(1 == ~n); 8185#L23 call #t~ret2 := fibo1(~n - 1);< 8214#fibo1ENTRY ~n := #in~n; 8215#L8 assume !(~n < 1); 8300#L10 assume 1 == ~n;#res := 1; 8294#fibo1FINAL assume true; 8264#fibo1EXIT >#46#return; 8256#L23-1 call #t~ret3 := fibo1(~n - 2);< 8258#fibo1ENTRY ~n := #in~n; 8266#L8 assume ~n < 1;#res := 0; 8263#fibo1FINAL assume true; 8255#fibo1EXIT >#48#return; 8253#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8219#fibo2FINAL assume true; 8220#fibo2EXIT >#50#return; 8177#L13-1 [2018-11-18 11:37:26,908 INFO L796 eck$LassoCheckResult]: Loop: 8177#L13-1 call #t~ret1 := fibo2(~n - 2);< 8131#fibo2ENTRY ~n := #in~n; 8179#L18 assume !(~n < 1); 8178#L20 assume !(1 == ~n); 8130#L23 call #t~ret2 := fibo1(~n - 1);< 8174#fibo1ENTRY ~n := #in~n; 8173#L8 assume !(~n < 1); 8169#L10 assume !(1 == ~n); 8171#L13 call #t~ret0 := fibo2(~n - 1);< 8247#fibo2ENTRY ~n := #in~n; 8262#L18 assume !(~n < 1); 8261#L20 assume !(1 == ~n); 8121#L23 call #t~ret2 := fibo1(~n - 1);< 8073#fibo1ENTRY ~n := #in~n; 8376#L8 assume !(~n < 1); 8374#L10 assume 1 == ~n;#res := 1; 8375#fibo1FINAL assume true; 8379#fibo1EXIT >#46#return; 8315#L23-1 call #t~ret3 := fibo1(~n - 2);< 8080#fibo1ENTRY ~n := #in~n; 8392#L8 assume ~n < 1;#res := 0; 8377#fibo1FINAL assume true; 8314#fibo1EXIT >#48#return; 8303#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8295#fibo2FINAL assume true; 8246#fibo2EXIT >#50#return; 8238#L13-1 call #t~ret1 := fibo2(~n - 2);< 8239#fibo2ENTRY ~n := #in~n; 8299#L18 assume ~n < 1;#res := 0; 8249#fibo2FINAL assume true; 8251#fibo2EXIT >#52#return; 8233#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8230#fibo1FINAL assume true; 8221#fibo1EXIT >#46#return; 8199#L23-1 call #t~ret3 := fibo1(~n - 2);< 8213#fibo1ENTRY ~n := #in~n; 8208#L8 assume !(~n < 1); 8203#L10 assume !(1 == ~n); 8195#L13 call #t~ret0 := fibo2(~n - 1);< 8201#fibo2ENTRY ~n := #in~n; 8218#L18 assume !(~n < 1); 8216#L20 assume !(1 == ~n); 8200#L23 call #t~ret2 := fibo1(~n - 1);< 8213#fibo1ENTRY ~n := #in~n; 8208#L8 assume !(~n < 1); 8203#L10 assume !(1 == ~n); 8195#L13 call #t~ret0 := fibo2(~n - 1);< 8201#fibo2ENTRY ~n := #in~n; 8218#L18 assume !(~n < 1); 8216#L20 assume 1 == ~n;#res := 1; 8217#fibo2FINAL assume true; 8272#fibo2EXIT >#50#return; 8270#L13-1 call #t~ret1 := fibo2(~n - 2);< 8271#fibo2ENTRY ~n := #in~n; 8284#L18 assume ~n < 1;#res := 0; 8283#fibo2FINAL assume true; 8269#fibo2EXIT >#52#return; 8268#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8265#fibo1FINAL assume true; 8260#fibo1EXIT >#46#return; 8243#L23-1 call #t~ret3 := fibo1(~n - 2);< 8248#fibo1ENTRY ~n := #in~n; 8290#L8 assume !(~n < 1); 8286#L10 assume !(1 == ~n); 8273#L13 call #t~ret0 := fibo2(~n - 1);< 8276#fibo2ENTRY ~n := #in~n; 8292#L18 assume !(~n < 1); 8288#L20 assume 1 == ~n;#res := 1; 8217#fibo2FINAL assume true; 8272#fibo2EXIT >#50#return; 8270#L13-1 call #t~ret1 := fibo2(~n - 2);< 8271#fibo2ENTRY ~n := #in~n; 8284#L18 assume ~n < 1;#res := 0; 8283#fibo2FINAL assume true; 8269#fibo2EXIT >#52#return; 8268#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8265#fibo1FINAL assume true; 8260#fibo1EXIT >#48#return; 8244#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8240#fibo2FINAL assume true; 8194#fibo2EXIT >#50#return; 8177#L13-1 [2018-11-18 11:37:26,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1448014817, now seen corresponding path program 1 times [2018-11-18 11:37:26,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:26,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:37:27,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:27,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:27,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:27,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:37:27,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:27,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-18 11:37:27,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:27,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1739702963, now seen corresponding path program 1 times [2018-11-18 11:37:27,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:27,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:27,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-18 11:37:27,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:27,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:27,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:27,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 109 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 11:37:27,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:27,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-18 11:37:27,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:37:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 11:37:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:37:27,230 INFO L87 Difference]: Start difference. First operand 333 states and 445 transitions. cyclomatic complexity: 116 Second operand 17 states. [2018-11-18 11:37:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:27,510 INFO L93 Difference]: Finished difference Result 419 states and 601 transitions. [2018-11-18 11:37:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 11:37:27,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 601 transitions. [2018-11-18 11:37:27,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 11:37:27,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 416 states and 597 transitions. [2018-11-18 11:37:27,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2018-11-18 11:37:27,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2018-11-18 11:37:27,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 597 transitions. [2018-11-18 11:37:27,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:27,519 INFO L705 BuchiCegarLoop]: Abstraction has 416 states and 597 transitions. [2018-11-18 11:37:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 597 transitions. [2018-11-18 11:37:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 394. [2018-11-18 11:37:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-18 11:37:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 559 transitions. [2018-11-18 11:37:27,529 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 559 transitions. [2018-11-18 11:37:27,529 INFO L608 BuchiCegarLoop]: Abstraction has 394 states and 559 transitions. [2018-11-18 11:37:27,529 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:37:27,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 559 transitions. [2018-11-18 11:37:27,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 11:37:27,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:27,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:27,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:27,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1] [2018-11-18 11:37:27,533 INFO L794 eck$LassoCheckResult]: Stem: 9277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 9238#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9239#fibo1ENTRY ~n := #in~n; 9403#L8 assume !(~n < 1); 9416#L10 assume !(1 == ~n); 9417#L13 call #t~ret0 := fibo2(~n - 1);< 9424#fibo2ENTRY ~n := #in~n; 9423#L18 assume !(~n < 1); 9422#L20 assume !(1 == ~n); 9259#L23 call #t~ret2 := fibo1(~n - 1);< 9421#fibo1ENTRY ~n := #in~n; 9418#L8 assume !(~n < 1); 9419#L10 assume !(1 == ~n); 9231#L13 call #t~ret0 := fibo2(~n - 1);< 9260#fibo2ENTRY ~n := #in~n; 9460#L18 assume !(~n < 1); 9459#L20 assume !(1 == ~n); 9230#L23 call #t~ret2 := fibo1(~n - 1);< 9232#fibo1ENTRY ~n := #in~n; 9276#L8 assume !(~n < 1); 9236#L10 assume !(1 == ~n); 9237#L13 call #t~ret0 := fibo2(~n - 1);< 9279#fibo2ENTRY ~n := #in~n; 9281#L18 assume !(~n < 1); 9288#L20 assume !(1 == ~n); 9289#L23 call #t~ret2 := fibo1(~n - 1);< 9454#fibo1ENTRY ~n := #in~n; 9514#L8 assume !(~n < 1); 9513#L10 assume !(1 == ~n); 9280#L13 call #t~ret0 := fibo2(~n - 1);< 9279#fibo2ENTRY ~n := #in~n; 9281#L18 assume !(~n < 1); 9288#L20 assume !(1 == ~n); 9289#L23 call #t~ret2 := fibo1(~n - 1);< 9454#fibo1ENTRY ~n := #in~n; 9515#L8 assume !(~n < 1); 9567#L10 assume 1 == ~n;#res := 1; 9566#fibo1FINAL assume true; 9500#fibo1EXIT >#46#return; 9457#L23-1 call #t~ret3 := fibo1(~n - 2);< 9464#fibo1ENTRY ~n := #in~n; 9553#L8 assume ~n < 1;#res := 0; 9550#fibo1FINAL assume true; 9497#fibo1EXIT >#48#return; 9494#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9491#fibo2FINAL assume true; 9409#fibo2EXIT >#50#return; 9345#L13-1 [2018-11-18 11:37:27,534 INFO L796 eck$LassoCheckResult]: Loop: 9345#L13-1 call #t~ret1 := fibo2(~n - 2);< 9265#fibo2ENTRY ~n := #in~n; 9461#L18 assume !(~n < 1); 9343#L20 assume !(1 == ~n); 9264#L23 call #t~ret2 := fibo1(~n - 1);< 9455#fibo1ENTRY ~n := #in~n; 9509#L8 assume !(~n < 1); 9330#L10 assume !(1 == ~n); 9332#L13 call #t~ret0 := fibo2(~n - 1);< 9506#fibo2ENTRY ~n := #in~n; 9538#L18 assume !(~n < 1); 9536#L20 assume !(1 == ~n); 9526#L23 call #t~ret2 := fibo1(~n - 1);< 9547#fibo1ENTRY ~n := #in~n; 9564#L8 assume !(~n < 1); 9563#L10 assume 1 == ~n;#res := 1; 9549#fibo1FINAL assume true; 9546#fibo1EXIT >#46#return; 9274#L23-1 call #t~ret3 := fibo1(~n - 2);< 9248#fibo1ENTRY ~n := #in~n; 9275#L8 assume ~n < 1;#res := 0; 9565#fibo1FINAL assume true; 9544#fibo1EXIT >#48#return; 9542#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9540#fibo2FINAL assume true; 9539#fibo2EXIT >#50#return; 9479#L13-1 call #t~ret1 := fibo2(~n - 2);< 9482#fibo2ENTRY ~n := #in~n; 9590#L18 assume ~n < 1;#res := 0; 9537#fibo2FINAL assume true; 9531#fibo2EXIT >#52#return; 9481#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9571#fibo1FINAL assume true; 9452#fibo1EXIT >#46#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume !(1 == ~n); 9405#L13 call #t~ret0 := fibo2(~n - 1);< 9413#fibo2ENTRY ~n := #in~n; 9429#L18 assume !(~n < 1); 9427#L20 assume !(1 == ~n); 9412#L23 call #t~ret2 := fibo1(~n - 1);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume !(1 == ~n); 9405#L13 call #t~ret0 := fibo2(~n - 1);< 9413#fibo2ENTRY ~n := #in~n; 9429#L18 assume !(~n < 1); 9427#L20 assume !(1 == ~n); 9412#L23 call #t~ret2 := fibo1(~n - 1);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume 1 == ~n;#res := 1; 9493#fibo1FINAL assume true; 9507#fibo1EXIT >#46#return; 9446#L23-1 call #t~ret3 := fibo1(~n - 2);< 9499#fibo1ENTRY ~n := #in~n; 9495#L8 assume !(~n < 1); 9492#L10 assume !(1 == ~n); 9486#L13 call #t~ret0 := fibo2(~n - 1);< 9489#fibo2ENTRY ~n := #in~n; 9517#L18 assume !(~n < 1); 9516#L20 assume 1 == ~n;#res := 1; 9428#fibo2FINAL assume true; 9485#fibo2EXIT >#50#return; 9469#L13-1 call #t~ret1 := fibo2(~n - 2);< 9472#fibo2ENTRY ~n := #in~n; 9477#L18 assume ~n < 1;#res := 0; 9475#fibo2FINAL assume true; 9468#fibo2EXIT >#52#return; 9465#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9462#fibo1FINAL assume true; 9456#fibo1EXIT >#48#return; 9448#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9430#fibo2FINAL assume true; 9404#fibo2EXIT >#50#return; 9345#L13-1 call #t~ret1 := fibo2(~n - 2);< 9431#fibo2ENTRY ~n := #in~n; 9574#L18 assume ~n < 1;#res := 0; 9475#fibo2FINAL assume true; 9468#fibo2EXIT >#52#return; 9471#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9569#fibo1FINAL assume true; 9451#fibo1EXIT >#46#return; 9410#L23-1 call #t~ret3 := fibo1(~n - 2);< 9425#fibo1ENTRY ~n := #in~n; 9426#L8 assume !(~n < 1); 9510#L10 assume !(1 == ~n); 9405#L13 call #t~ret0 := fibo2(~n - 1);< 9413#fibo2ENTRY ~n := #in~n; 9429#L18 assume !(~n < 1); 9427#L20 assume 1 == ~n;#res := 1; 9428#fibo2FINAL assume true; 9485#fibo2EXIT >#50#return; 9469#L13-1 call #t~ret1 := fibo2(~n - 2);< 9472#fibo2ENTRY ~n := #in~n; 9477#L18 assume ~n < 1;#res := 0; 9475#fibo2FINAL assume true; 9468#fibo2EXIT >#52#return; 9465#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9462#fibo1FINAL assume true; 9456#fibo1EXIT >#48#return; 9443#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9441#fibo2FINAL assume true; 9440#fibo2EXIT >#50#return; 9345#L13-1 [2018-11-18 11:37:27,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1654199334, now seen corresponding path program 2 times [2018-11-18 11:37:27,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:27,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:27,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:37:27,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:27,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:27,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 11:37:27,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:37:27,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:37:27,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:37:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:27,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-11-18 11:37:27,802 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:27,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 197922261, now seen corresponding path program 2 times [2018-11-18 11:37:27,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:27,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:27,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:37:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 80 proven. 25 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-11-18 11:37:27,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:27,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:27,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 11:37:27,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:37:27,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:37:27,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 162 proven. 3 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-18 11:37:27,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:27,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-18 11:37:27,959 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:37:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 11:37:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-18 11:37:27,960 INFO L87 Difference]: Start difference. First operand 394 states and 559 transitions. cyclomatic complexity: 169 Second operand 23 states. [2018-11-18 11:37:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:28,311 INFO L93 Difference]: Finished difference Result 504 states and 669 transitions. [2018-11-18 11:37:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 11:37:28,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 504 states and 669 transitions. [2018-11-18 11:37:28,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 11:37:28,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 504 states to 454 states and 592 transitions. [2018-11-18 11:37:28,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2018-11-18 11:37:28,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 [2018-11-18 11:37:28,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 592 transitions. [2018-11-18 11:37:28,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:37:28,324 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 592 transitions. [2018-11-18 11:37:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 592 transitions. [2018-11-18 11:37:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 428. [2018-11-18 11:37:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 11:37:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 551 transitions. [2018-11-18 11:37:28,333 INFO L728 BuchiCegarLoop]: Abstraction has 428 states and 551 transitions. [2018-11-18 11:37:28,333 INFO L608 BuchiCegarLoop]: Abstraction has 428 states and 551 transitions. [2018-11-18 11:37:28,334 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:37:28,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 551 transitions. [2018-11-18 11:37:28,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 11:37:28,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:37:28,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:37:28,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:28,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:37:28,337 INFO L794 eck$LassoCheckResult]: Stem: 10719#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10714#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10690#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10691#fibo1ENTRY ~n := #in~n; 10793#L8 assume !(~n < 1); 10792#L10 assume !(1 == ~n); 10790#L13 call #t~ret0 := fibo2(~n - 1);< 10791#fibo2ENTRY ~n := #in~n; 10811#L18 assume !(~n < 1); 10810#L20 assume !(1 == ~n); 10807#L23 call #t~ret2 := fibo1(~n - 1);< 10808#fibo1ENTRY ~n := #in~n; 10871#L8 assume !(~n < 1); 10867#L10 assume !(1 == ~n); 10721#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10722#L18 assume !(~n < 1); 10731#L20 assume !(1 == ~n); 10858#L23 call #t~ret2 := fibo1(~n - 1);< 10859#fibo1ENTRY ~n := #in~n; 11079#L8 assume !(~n < 1); 11078#L10 assume !(1 == ~n); 10676#L13 call #t~ret0 := fibo2(~n - 1);< 10923#fibo2ENTRY ~n := #in~n; 10962#L18 assume !(~n < 1); 10945#L20 assume !(1 == ~n); 10942#L23 call #t~ret2 := fibo1(~n - 1);< 10943#fibo1ENTRY ~n := #in~n; 10967#L8 assume !(~n < 1); 10963#L10 assume !(1 == ~n); 10954#L13 call #t~ret0 := fibo2(~n - 1);< 10955#fibo2ENTRY ~n := #in~n; 10979#L18 assume !(~n < 1); 10977#L20 assume 1 == ~n;#res := 1; 10976#fibo2FINAL assume true; 10953#fibo2EXIT >#50#return; 10950#L13-1 call #t~ret1 := fibo2(~n - 2);< 10951#fibo2ENTRY ~n := #in~n; 10980#L18 assume ~n < 1;#res := 0; 10978#fibo2FINAL assume true; 10949#fibo2EXIT >#52#return; 10947#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10946#fibo1FINAL assume true; 10941#fibo1EXIT >#46#return; 10684#L23-1 call #t~ret3 := fibo1(~n - 2);< 10940#fibo1ENTRY ~n := #in~n; 10991#L8 assume ~n < 1;#res := 0; 10990#fibo1FINAL assume true; 10988#fibo1EXIT >#48#return; 10986#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10985#fibo2FINAL assume true; 10922#fibo2EXIT >#50#return; 10674#L13-1 call #t~ret1 := fibo2(~n - 2);< 10870#fibo2ENTRY ~n := #in~n; 10936#L18 assume !(~n < 1); 10934#L20 assume !(1 == ~n); 10930#L23 call #t~ret2 := fibo1(~n - 1);< 10932#fibo1ENTRY ~n := #in~n; 10974#L8 assume !(~n < 1); 10970#L10 assume !(1 == ~n); 10667#L13 call #t~ret0 := fibo2(~n - 1);< 10966#fibo2ENTRY ~n := #in~n; 10975#L18 assume !(~n < 1); 10972#L20 assume !(1 == ~n); 10973#L23 call #t~ret2 := fibo1(~n - 1);< 11027#fibo1ENTRY [2018-11-18 11:37:28,337 INFO L796 eck$LassoCheckResult]: Loop: 11027#fibo1ENTRY ~n := #in~n; 11049#L8 assume !(~n < 1); 11048#L10 assume !(1 == ~n); 11010#L13 call #t~ret0 := fibo2(~n - 1);< 11017#fibo2ENTRY ~n := #in~n; 11047#L18 assume !(~n < 1); 11046#L20 assume !(1 == ~n); 11035#L23 call #t~ret2 := fibo1(~n - 1);< 11027#fibo1ENTRY [2018-11-18 11:37:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 746131068, now seen corresponding path program 1 times [2018-11-18 11:37:28,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:28,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:28,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:37:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-18 11:37:28,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:37:28,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:37:28,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:28,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 60 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 11:37:28,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:37:28,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 22 [2018-11-18 11:37:28,551 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:37:28,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 2 times [2018-11-18 11:37:28,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:37:28,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:37:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:28,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:37:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:37:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:37:28,599 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:28,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:28,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:28,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:28,599 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:37:28,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:28,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:28,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:28,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-18 11:37:28,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:28,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:28,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,667 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:28,667 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:28,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:37:28,674 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531557ef-7ba8-454a-85a0-d905d140af5f/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:28,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:37:28,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:37:28,730 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:37:28,731 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:37:28,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:37:28,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:37:28,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:37:28,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:37:28,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:37:28,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:37:28,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:37:28,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-18 11:37:28,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:37:28,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:37:28,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:37:28,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:37:28,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:37:28,770 INFO L122 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 [2018-11-18 11:37:28,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:37:28,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:37:28,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:37:28,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:37:28,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:37:28,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:37:28,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:37:28,772 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:37:28,773 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:37:28,774 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:37:28,774 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:37:28,774 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:37:28,774 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:37:28,774 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-11-18 11:37:28,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:37:28,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:28,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:28,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:28,852 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 [2018-11-18 11:37:28,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-18 11:37:28,916 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 455 states and 578 transitions. Complement of second has 22 states. [2018-11-18 11:37:28,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 11:37:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:37:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-11-18 11:37:28,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-18 11:37:28,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:28,917 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:37:28,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:28,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:28,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:28,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 11:37:28,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-18 11:37:29,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 455 states and 578 transitions. Complement of second has 22 states. [2018-11-18 11:37:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 11:37:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:37:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-11-18 11:37:29,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-18 11:37:29,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:29,060 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:37:29,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:37:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:29,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:37:29,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:37:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:37:29,160 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 5 loop predicates [2018-11-18 11:37:29,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126 Second operand 7 states. [2018-11-18 11:37:29,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 551 transitions. cyclomatic complexity: 126. Second operand 7 states. Result 755 states and 917 transitions. Complement of second has 25 states. [2018-11-18 11:37:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 11:37:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:37:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-18 11:37:29,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-18 11:37:29,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:29,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 73 letters. Loop has 8 letters. [2018-11-18 11:37:29,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:29,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 65 letters. Loop has 16 letters. [2018-11-18 11:37:29,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:37:29,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 917 transitions. [2018-11-18 11:37:29,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:37:29,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 0 states and 0 transitions. [2018-11-18 11:37:29,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:37:29,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:37:29,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:37:29,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:37:29,277 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:37:29,277 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:37:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 11:37:29,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-11-18 11:37:29,277 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 22 states. [2018-11-18 11:37:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:37:29,277 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 11:37:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:37:29,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:37:29,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:37:29,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:37:29,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:37:29,278 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:37:29,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:37:29,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:37:29,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:37:29,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:37:29 BoogieIcfgContainer [2018-11-18 11:37:29,284 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:37:29,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:37:29,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:37:29,285 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:37:29,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:20" (3/4) ... [2018-11-18 11:37:29,288 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:37:29,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:37:29,289 INFO L168 Benchmark]: Toolchain (without parser) took 9235.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.4 MB). Free memory was 958.0 MB in the beginning and 1.4 GB in the end (delta: -400.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:37:29,290 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:37:29,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.77 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:29,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.84 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:29,291 INFO L168 Benchmark]: Boogie Preprocessor took 10.47 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:37:29,291 INFO L168 Benchmark]: RCFGBuilder took 188.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:29,292 INFO L168 Benchmark]: BuchiAutomizer took 8860.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -235.1 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:37:29,292 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:37:29,294 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.77 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.84 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.47 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8860.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -235.1 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 5.0s. Construction of modules took 1.0s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 428 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 328 SDtfs, 759 SDslu, 926 SDs, 0 SdLazy, 2077 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...