./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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 fe571d33601eb001defa960d70b02ea99b59263c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 13:46:05,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:46:05,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:46:05,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:46:05,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:46:05,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:46:05,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:46:05,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:46:05,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:46:05,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:46:05,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:46:05,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:46:05,027 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:46:05,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:46:05,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:46:05,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:46:05,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:46:05,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:46:05,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:46:05,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:46:05,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:46:05,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:46:05,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:46:05,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:46:05,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:46:05,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:46:05,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:46:05,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:46:05,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:46:05,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:46:05,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:46:05,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:46:05,037 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:46:05,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:46:05,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:46:05,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:46:05,038 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 13:46:05,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:46:05,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:46:05,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:46:05,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:46:05,047 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 13:46:05,047 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 13:46:05,047 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 13:46:05,047 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 13:46:05,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 13:46:05,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 13:46:05,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 13:46:05,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 13:46:05,049 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 13:46:05,050 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 13:46:05,050 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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 -> fe571d33601eb001defa960d70b02ea99b59263c [2018-12-08 13:46:05,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:46:05,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:46:05,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:46:05,076 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:46:05,076 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:46:05,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-08 13:46:05,111 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/data/18425edd2/5a52df43131b4f77826b6a1c0c68782d/FLAG9017cc3cb [2018-12-08 13:46:05,527 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:46:05,528 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-08 13:46:05,531 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/data/18425edd2/5a52df43131b4f77826b6a1c0c68782d/FLAG9017cc3cb [2018-12-08 13:46:05,539 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/data/18425edd2/5a52df43131b4f77826b6a1c0c68782d [2018-12-08 13:46:05,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:46:05,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:46:05,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:46:05,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:46:05,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:46:05,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05, skipping insertion in model container [2018-12-08 13:46:05,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:46:05,559 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:46:05,642 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:46:05,644 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:46:05,653 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:46:05,661 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:46:05,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05 WrapperNode [2018-12-08 13:46:05,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:46:05,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:46:05,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:46:05,662 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:46:05,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:46:05,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:46:05,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:46:05,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:46:05,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... [2018-12-08 13:46:05,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:46:05,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:46:05,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:46:05,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:46:05,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:46:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:46:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-08 13:46:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-08 13:46:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-08 13:46:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-08 13:46:05,837 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:46:05,837 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 13:46:05,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:46:05 BoogieIcfgContainer [2018-12-08 13:46:05,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:46:05,838 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 13:46:05,838 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 13:46:05,842 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 13:46:05,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:46:05,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 01:46:05" (1/3) ... [2018-12-08 13:46:05,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1844874f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 01:46:05, skipping insertion in model container [2018-12-08 13:46:05,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:46:05,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:46:05" (2/3) ... [2018-12-08 13:46:05,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1844874f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 01:46:05, skipping insertion in model container [2018-12-08 13:46:05,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:46:05,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:46:05" (3/3) ... [2018-12-08 13:46:05,845 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-12-08 13:46:05,886 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 13:46:05,886 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 13:46:05,886 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 13:46:05,886 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 13:46:05,886 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 13:46:05,886 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 13:46:05,886 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 13:46:05,886 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 13:46:05,887 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 13:46:05,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-08 13:46:05,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 13:46:05,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:05,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:05,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 13:46:05,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:05,922 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 13:46:05,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-08 13:46:05,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 13:46:05,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:05,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:05,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 13:46:05,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:05,932 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2018-12-08 13:46:05,932 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2018-12-08 13:46:05,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2018-12-08 13:46:05,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:05,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:05,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:05,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:05,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:06,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2018-12-08 13:46:06,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:06,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2018-12-08 13:46:06,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:06,125 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:06,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:06,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:06,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:06,127 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 13:46:06,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:06,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:06,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:06,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-12-08 13:46:06,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:06,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:06,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,206 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:06,207 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,215 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,215 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,233 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,248 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,250 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,267 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,283 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,283 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,301 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,301 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,318 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,318 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,344 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,344 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,361 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:06,361 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:06,375 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:06,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 13:46:06,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:06,429 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 13:46:06,430 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:06,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:06,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:06,430 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:06,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:46:06,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:06,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:06,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:06,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration1_Loop [2018-12-08 13:46:06,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:06,430 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:06,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:06,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:06,481 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:46:06,482 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-12-08 13:46:06,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,488 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-12-08 13:46:06,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,490 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-12-08 13:46:06,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,493 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-12-08 13:46:06,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,495 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-12-08 13:46:06,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,497 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-12-08 13:46:06,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,499 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-12-08 13:46:06,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,502 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-12-08 13:46:06,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:06,504 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-12-08 13:46:06,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:06,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:06,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:06,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:06,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:06,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:06,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:06,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:46:06,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:46:06,511 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:46:06,513 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:46:06,513 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:46:06,513 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:46:06,513 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2018-12-08 13:46:06,514 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 13:46:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:06,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:06,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:06,645 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-12-08 13:46:06,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-12-08 13:46:06,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2018-12-08 13:46:06,797 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-12-08 13:46:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 13:46:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-12-08 13:46:06,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-08 13:46:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:06,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-08 13:46:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:06,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-12-08 13:46:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:06,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2018-12-08 13:46:06,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 13:46:06,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2018-12-08 13:46:06,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-08 13:46:06,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-08 13:46:06,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-12-08 13:46:06,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:06,816 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-12-08 13:46:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-12-08 13:46:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-12-08 13:46:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 13:46:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-12-08 13:46:06,840 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-12-08 13:46:06,840 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-12-08 13:46:06,840 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 13:46:06,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2018-12-08 13:46:06,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 13:46:06,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:06,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:06,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:06,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:06,842 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2018-12-08 13:46:06,842 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2018-12-08 13:46:06,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2018-12-08 13:46:06,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:06,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 13:46:06,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:46:06,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 13:46:06,890 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:06,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2018-12-08 13:46:06,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:06,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:06,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 13:46:06,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:46:06,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 13:46:06,916 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:46:06,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:46:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:46:06,918 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2018-12-08 13:46:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:06,964 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-12-08 13:46:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:46:06,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2018-12-08 13:46:06,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 13:46:06,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2018-12-08 13:46:06,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-08 13:46:06,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-08 13:46:06,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2018-12-08 13:46:06,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:06,971 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2018-12-08 13:46:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2018-12-08 13:46:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-12-08 13:46:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 13:46:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-12-08 13:46:06,977 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-12-08 13:46:06,977 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-12-08 13:46:06,977 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 13:46:06,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-12-08 13:46:06,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 13:46:06,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:06,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:06,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:06,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:06,979 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 336#L37 call main_#t~ret4 := fibo1(main_~x~0);< 337#fibo1ENTRY ~n := #in~n; 359#L8 assume !(~n < 1); 377#L10 assume !(1 == ~n); 333#L13 call #t~ret0 := fibo2(~n - 1);< 351#fibo2ENTRY ~n := #in~n; 379#L18 assume !(~n < 1); 380#L20 assume !(1 == ~n); 330#L23 call #t~ret2 := fibo1(~n - 1);< 335#fibo1ENTRY ~n := #in~n; 361#L8 assume !(~n < 1); 338#L10 assume 1 == ~n;#res := 1; 339#fibo1FINAL assume true; 355#fibo1EXIT >#45#return; 346#L23-1 [2018-12-08 13:46:06,980 INFO L796 eck$LassoCheckResult]: Loop: 346#L23-1 call #t~ret3 := fibo1(~n - 2);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume !(1 == ~n); 328#L13 call #t~ret0 := fibo2(~n - 1);< 373#fibo2ENTRY ~n := #in~n; 378#L18 assume !(~n < 1); 369#L20 assume !(1 == ~n); 326#L23 call #t~ret2 := fibo1(~n - 1);< 329#fibo1ENTRY ~n := #in~n; 375#L8 assume !(~n < 1); 374#L10 assume 1 == ~n;#res := 1; 357#fibo1FINAL assume true; 370#fibo1EXIT >#45#return; 346#L23-1 [2018-12-08 13:46:06,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2018-12-08 13:46:06,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:06,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:06,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:06,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:07,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:07,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:07,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:07,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:07,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-08 13:46:07,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:07,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2018-12-08 13:46:07,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:07,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:07,172 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:07,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:07,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:07,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:07,172 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 13:46:07,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:07,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:07,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:07,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-12-08 13:46:07,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:07,173 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:07,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:07,210 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:07,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:07,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:07,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:07,214 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:07,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:07,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:07,230 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:07,230 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:07,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:07,245 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:07,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 13:46:07,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:07,921 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 13:46:07,922 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:07,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:07,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:07,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:07,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:46:07,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:07,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:07,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:07,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration3_Loop [2018-12-08 13:46:07,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:07,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:07,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:07,973 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:07,974 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:46:07,974 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-12-08 13:46:07,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:07,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:07,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:07,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:07,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:07,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:07,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:07,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:07,977 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-12-08 13:46:07,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:07,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:07,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:07,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:07,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:07,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:07,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:07,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:07,979 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-12-08 13:46:07,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:07,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:07,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:07,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:07,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:07,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:07,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:07,983 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:46:07,985 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:46:07,985 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:46:07,985 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:46:07,985 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:46:07,985 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:46:07,985 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-12-08 13:46:07,985 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 13:46:07,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:08,092 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-12-08 13:46:08,092 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-12-08 13:46:08,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2018-12-08 13:46:08,254 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-12-08 13:46:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 13:46:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-12-08 13:46:08,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2018-12-08 13:46:08,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:08,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2018-12-08 13:46:08,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:08,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2018-12-08 13:46:08,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:08,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2018-12-08 13:46:08,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-08 13:46:08,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2018-12-08 13:46:08,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-12-08 13:46:08,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-12-08 13:46:08,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2018-12-08 13:46:08,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:08,262 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2018-12-08 13:46:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2018-12-08 13:46:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-12-08 13:46:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-08 13:46:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2018-12-08 13:46:08,270 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2018-12-08 13:46:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 13:46:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 13:46:08,270 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 9 states. [2018-12-08 13:46:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:08,344 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2018-12-08 13:46:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 13:46:08,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2018-12-08 13:46:08,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-08 13:46:08,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2018-12-08 13:46:08,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-08 13:46:08,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-08 13:46:08,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2018-12-08 13:46:08,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:08,350 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2018-12-08 13:46:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2018-12-08 13:46:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2018-12-08 13:46:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-08 13:46:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2018-12-08 13:46:08,357 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-12-08 13:46:08,357 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2018-12-08 13:46:08,357 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 13:46:08,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2018-12-08 13:46:08,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-08 13:46:08,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:08,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:08,361 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] [2018-12-08 13:46:08,361 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-12-08 13:46:08,361 INFO L794 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1131#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1132#fibo1ENTRY ~n := #in~n; 1202#L8 assume !(~n < 1); 1200#L10 assume !(1 == ~n); 1123#L13 call #t~ret0 := fibo2(~n - 1);< 1143#fibo2ENTRY ~n := #in~n; 1161#L18 assume !(~n < 1); 1167#L20 assume !(1 == ~n); 1147#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume !(~n < 1); 1199#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1194#L8 assume !(~n < 1); 1192#L10 assume !(1 == ~n); 1111#L13 call #t~ret0 := fibo2(~n - 1);< 1191#fibo2ENTRY ~n := #in~n; 1198#L18 assume ~n < 1;#res := 0; 1125#fibo2FINAL assume true; 1126#fibo2EXIT >#49#return; 1112#L13-1 call #t~ret1 := fibo2(~n - 2);< 1148#fibo2ENTRY ~n := #in~n; 1169#L18 assume !(~n < 1); 1170#L20 assume !(1 == ~n); 1110#L23 call #t~ret2 := fibo1(~n - 1);< 1113#fibo1ENTRY ~n := #in~n; 1196#L8 assume !(~n < 1); 1205#L10 assume 1 == ~n;#res := 1; 1206#fibo1FINAL assume true; 1201#fibo1EXIT >#45#return; 1186#L23-1 call #t~ret3 := fibo1(~n - 2);< 1130#fibo1ENTRY ~n := #in~n; 1195#L8 assume !(~n < 1); 1193#L10 assume !(1 == ~n); 1129#L13 call #t~ret0 := fibo2(~n - 1);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1187#fibo2EXIT >#49#return; 1128#L13-1 call #t~ret1 := fibo2(~n - 2);< 1184#fibo2ENTRY ~n := #in~n; 1181#L18 assume !(~n < 1); 1176#L20 assume 1 == ~n;#res := 1; 1177#fibo2FINAL assume true; 1162#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-12-08 13:46:08,361 INFO L796 eck$LassoCheckResult]: Loop: 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume !(~n < 1); 1165#L20 assume !(1 == ~n); 1105#L23 call #t~ret2 := fibo1(~n - 1);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#45#return; 1115#L23-1 call #t~ret3 := fibo1(~n - 2);< 1109#fibo1ENTRY ~n := #in~n; 1151#L8 assume !(~n < 1); 1114#L10 assume !(1 == ~n); 1107#L13 call #t~ret0 := fibo2(~n - 1);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#49#return; 1106#L13-1 call #t~ret1 := fibo2(~n - 2);< 1142#fibo2ENTRY ~n := #in~n; 1223#L18 assume ~n < 1;#res := 0; 1166#fibo2FINAL assume true; 1258#fibo2EXIT >#51#return; 1163#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1266#fibo1FINAL assume true; 1264#fibo1EXIT >#47#return; 1140#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1263#fibo2FINAL assume true; 1257#fibo2EXIT >#49#return; 1106#L13-1 [2018-12-08 13:46:08,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2018-12-08 13:46:08,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:08,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-12-08 13:46:08,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:08,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:08,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 23 proven. 71 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-08 13:46:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2018-12-08 13:46:08,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:08,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:08,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2018-12-08 13:46:08,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:08,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 13:46:08,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:08,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:08,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 13:46:08,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 13:46:08,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-12-08 13:46:08,609 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:46:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:46:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:46:08,610 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2018-12-08 13:46:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:08,640 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2018-12-08 13:46:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:46:08,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2018-12-08 13:46:08,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-08 13:46:08,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2018-12-08 13:46:08,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-12-08 13:46:08,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-12-08 13:46:08,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2018-12-08 13:46:08,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:08,645 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2018-12-08 13:46:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2018-12-08 13:46:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2018-12-08 13:46:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-08 13:46:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-12-08 13:46:08,651 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-12-08 13:46:08,651 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-12-08 13:46:08,651 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 13:46:08,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2018-12-08 13:46:08,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-08 13:46:08,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:08,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:08,653 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] [2018-12-08 13:46:08,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:08,654 INFO L794 eck$LassoCheckResult]: Stem: 1917#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 1880#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1886#fibo1ENTRY ~n := #in~n; 1923#L8 assume !(~n < 1); 1879#L10 assume !(1 == ~n); 1881#L13 call #t~ret0 := fibo2(~n - 1);< 1900#fibo2ENTRY ~n := #in~n; 1921#L18 assume !(~n < 1); 1994#L20 assume !(1 == ~n); 1905#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1947#L8 assume !(~n < 1); 1946#L10 assume !(1 == ~n); 1869#L13 call #t~ret0 := fibo2(~n - 1);< 1944#fibo2ENTRY ~n := #in~n; 1969#L18 assume !(~n < 1); 1959#L20 assume !(1 == ~n); 1868#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1947#L8 assume !(~n < 1); 1946#L10 assume !(1 == ~n); 1869#L13 call #t~ret0 := fibo2(~n - 1);< 1944#fibo2ENTRY ~n := #in~n; 1969#L18 assume !(~n < 1); 1959#L20 assume 1 == ~n;#res := 1; 1874#fibo2FINAL assume true; 1875#fibo2EXIT >#49#return; 1870#L13-1 call #t~ret1 := fibo2(~n - 2);< 1906#fibo2ENTRY ~n := #in~n; 1927#L18 assume !(~n < 1); 1925#L20 assume !(1 == ~n); 1868#L23 call #t~ret2 := fibo1(~n - 1);< 1871#fibo1ENTRY ~n := #in~n; 1948#L8 assume !(~n < 1); 1955#L10 assume 1 == ~n;#res := 1; 1956#fibo1FINAL assume true; 1949#fibo1EXIT >#45#return; 1877#L23-1 call #t~ret3 := fibo1(~n - 2);< 1885#fibo1ENTRY ~n := #in~n; 1945#L8 assume !(~n < 1); 1942#L10 assume !(1 == ~n); 1884#L13 call #t~ret0 := fibo2(~n - 1);< 1938#fibo2ENTRY ~n := #in~n; 1936#L18 assume !(~n < 1); 1931#L20 assume 1 == ~n;#res := 1; 1932#fibo2FINAL assume true; 1922#fibo2EXIT >#49#return; 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume ~n < 1;#res := 0; 1998#fibo2FINAL assume true; 2001#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#47#return; 1990#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1980#fibo2FINAL assume true; 1974#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#45#return; 1977#L23-1 call #t~ret3 := fibo1(~n - 2);< 1987#fibo1ENTRY ~n := #in~n; 1985#L8 assume !(~n < 1); 1982#L10 assume !(1 == ~n); 1918#L13 call #t~ret0 := fibo2(~n - 1);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume 1 == ~n;#res := 1; 1997#fibo2FINAL assume true; 1989#fibo2EXIT >#49#return; 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume ~n < 1;#res := 0; 1998#fibo2FINAL assume true; 2001#fibo2EXIT >#51#return; 1975#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1999#fibo1FINAL assume true; 1991#fibo1EXIT >#47#return; 1990#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1980#fibo2FINAL assume true; 1974#fibo2EXIT >#49#return; 1919#L13-1 [2018-12-08 13:46:08,654 INFO L796 eck$LassoCheckResult]: Loop: 1919#L13-1 call #t~ret1 := fibo2(~n - 2);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume !(1 == ~n); 1979#L23 call #t~ret2 := fibo1(~n - 1);< 1987#fibo1ENTRY ~n := #in~n; 1985#L8 assume !(~n < 1); 1982#L10 assume !(1 == ~n); 1918#L13 call #t~ret0 := fibo2(~n - 1);< 1904#fibo2ENTRY ~n := #in~n; 1920#L18 assume !(~n < 1); 1996#L20 assume 1 == ~n;#res := 1; 1997#fibo2FINAL assume true; 1989#fibo2EXIT >#49#return; 1919#L13-1 [2018-12-08 13:46:08,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2018-12-08 13:46:08,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-08 13:46:08,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:08,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:08,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 13:46:08,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 13:46:08,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 13:46:08,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 75 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-08 13:46:08,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:08,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-12-08 13:46:08,839 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:08,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 321897904, now seen corresponding path program 1 times [2018-12-08 13:46:08,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:08,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:46:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:08,939 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:08,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:08,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:08,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:08,939 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 13:46:08,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:08,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:08,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:08,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-12-08 13:46:08,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:08,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:08,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:08,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:08,979 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:08,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:08,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:08,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:08,985 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:09,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:09,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:09,001 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:09,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:09,019 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:09,019 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:09,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:09,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:09,036 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:09,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:09,052 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:09,052 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:09,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:09,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:09,069 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_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:09,084 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:09,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 13:46:09,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:10,175 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 13:46:10,176 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:10,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:10,177 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:10,177 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:10,177 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:46:10,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:10,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:10,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:10,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration5_Loop [2018-12-08 13:46:10,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:10,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:10,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:10,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:10,215 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:46:10,215 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-12-08 13:46:10,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:10,216 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-12-08 13:46:10,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:10,218 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-12-08 13:46:10,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:10,219 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-12-08 13:46:10,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:10,220 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-12-08 13:46:10,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:10,222 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-12-08 13:46:10,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:46:10,223 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-12-08 13:46:10,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:10,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:10,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:10,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:10,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:10,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:10,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:10,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:46:10,228 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:46:10,228 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:46:10,229 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:46:10,229 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:46:10,229 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:46:10,229 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-12-08 13:46:10,229 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 13:46:10,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:10,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:10,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:10,369 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-12-08 13:46:10,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-12-08 13:46:10,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 879 states and 1167 transitions. Complement of second has 26 states. [2018-12-08 13:46:10,576 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-12-08 13:46:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 13:46:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-12-08 13:46:10,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 82 letters. Loop has 14 letters. [2018-12-08 13:46:10,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:10,577 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:46:10,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:10,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:10,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:10,693 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-12-08 13:46:10,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-12-08 13:46:10,830 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 669 states and 942 transitions. Complement of second has 24 states. [2018-12-08 13:46:10,830 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-12-08 13:46:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 13:46:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-12-08 13:46:10,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 82 letters. Loop has 14 letters. [2018-12-08 13:46:10,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:10,832 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:46:10,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:10,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:10,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:10,944 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-12-08 13:46:10,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 9 states. [2018-12-08 13:46:11,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 205 transitions. cyclomatic complexity: 53. Second operand 9 states. Result 1660 states and 2156 transitions. Complement of second has 90 states. [2018-12-08 13:46:11,133 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-12-08 13:46:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 13:46:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-12-08 13:46:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 14 letters. [2018-12-08 13:46:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:11,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 96 letters. Loop has 14 letters. [2018-12-08 13:46:11,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 82 letters. Loop has 28 letters. [2018-12-08 13:46:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:11,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1660 states and 2156 transitions. [2018-12-08 13:46:11,152 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-12-08 13:46:11,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1660 states to 1188 states and 1643 transitions. [2018-12-08 13:46:11,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-12-08 13:46:11,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2018-12-08 13:46:11,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1643 transitions. [2018-12-08 13:46:11,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:11,167 INFO L705 BuchiCegarLoop]: Abstraction has 1188 states and 1643 transitions. [2018-12-08 13:46:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1643 transitions. [2018-12-08 13:46:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1041. [2018-12-08 13:46:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-12-08 13:46:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2018-12-08 13:46:11,196 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2018-12-08 13:46:11,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 13:46:11,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-08 13:46:11,196 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 transitions. Second operand 17 states. [2018-12-08 13:46:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:11,370 INFO L93 Difference]: Finished difference Result 1248 states and 1763 transitions. [2018-12-08 13:46:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 13:46:11,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1763 transitions. [2018-12-08 13:46:11,376 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2018-12-08 13:46:11,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 608 states and 744 transitions. [2018-12-08 13:46:11,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2018-12-08 13:46:11,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2018-12-08 13:46:11,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 608 states and 744 transitions. [2018-12-08 13:46:11,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:11,380 INFO L705 BuchiCegarLoop]: Abstraction has 608 states and 744 transitions. [2018-12-08 13:46:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states and 744 transitions. [2018-12-08 13:46:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 590. [2018-12-08 13:46:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-08 13:46:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 726 transitions. [2018-12-08 13:46:11,388 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2018-12-08 13:46:11,388 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 726 transitions. [2018-12-08 13:46:11,388 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 13:46:11,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 726 transitions. [2018-12-08 13:46:11,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-12-08 13:46:11,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:11,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:11,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:11,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:11,391 INFO L794 eck$LassoCheckResult]: Stem: 8925#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 8891#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8892#fibo1ENTRY ~n := #in~n; 9055#L8 assume !(~n < 1); 9054#L10 assume !(1 == ~n); 9051#L13 call #t~ret0 := fibo2(~n - 1);< 9053#fibo2ENTRY ~n := #in~n; 9052#L18 assume !(~n < 1); 9050#L20 assume !(1 == ~n); 9036#L23 call #t~ret2 := fibo1(~n - 1);< 9045#fibo1ENTRY ~n := #in~n; 9043#L8 assume !(~n < 1); 9041#L10 assume !(1 == ~n); 9009#L13 call #t~ret0 := fibo2(~n - 1);< 9039#fibo2ENTRY ~n := #in~n; 9044#L18 assume !(~n < 1); 9042#L20 assume !(1 == ~n); 9035#L23 call #t~ret2 := fibo1(~n - 1);< 9045#fibo1ENTRY ~n := #in~n; 9046#L8 assume !(~n < 1); 9144#L10 assume 1 == ~n;#res := 1; 9145#fibo1FINAL assume true; 9138#fibo1EXIT >#45#return; 8994#L23-1 call #t~ret3 := fibo1(~n - 2);< 9119#fibo1ENTRY ~n := #in~n; 9131#L8 assume ~n < 1;#res := 0; 9128#fibo1FINAL assume true; 9118#fibo1EXIT >#47#return; 9107#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9104#fibo2FINAL assume true; 9095#fibo2EXIT >#49#return; 9080#L13-1 [2018-12-08 13:46:11,391 INFO L796 eck$LassoCheckResult]: Loop: 9080#L13-1 call #t~ret1 := fibo2(~n - 2);< 9084#fibo2ENTRY ~n := #in~n; 9085#L18 assume !(~n < 1); 9078#L20 assume !(1 == ~n); 9063#L23 call #t~ret2 := fibo1(~n - 1);< 9156#fibo1ENTRY ~n := #in~n; 9071#L8 assume !(~n < 1); 9072#L10 assume !(1 == ~n); 8881#L13 call #t~ret0 := fibo2(~n - 1);< 9314#fibo2ENTRY ~n := #in~n; 9394#L18 assume !(~n < 1); 9342#L20 assume 1 == ~n;#res := 1; 9340#fibo2FINAL assume true; 9312#fibo2EXIT >#49#return; 9310#L13-1 call #t~ret1 := fibo2(~n - 2);< 9311#fibo2ENTRY ~n := #in~n; 9333#L18 assume ~n < 1;#res := 0; 9332#fibo2FINAL assume true; 9309#fibo2EXIT >#51#return; 9308#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 9307#fibo1FINAL assume true; 9303#fibo1EXIT >#45#return; 9114#L23-1 call #t~ret3 := fibo1(~n - 2);< 9117#fibo1ENTRY ~n := #in~n; 9167#L8 assume !(~n < 1); 9163#L10 assume !(1 == ~n); 9157#L13 call #t~ret0 := fibo2(~n - 1);< 9161#fibo2ENTRY ~n := #in~n; 9160#L18 assume !(~n < 1); 9158#L20 assume 1 == ~n;#res := 1; 9159#fibo2FINAL assume true; 9185#fibo2EXIT >#49#return; 9080#L13-1 [2018-12-08 13:46:11,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2018-12-08 13:46:11,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:11,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2128758661, now seen corresponding path program 1 times [2018-12-08 13:46:11,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:11,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 13:46:11,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:11,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:11,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:11,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 13:46:11,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:11,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-08 13:46:11,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:46:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 13:46:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 13:46:11,477 INFO L87 Difference]: Start difference. First operand 590 states and 726 transitions. cyclomatic complexity: 145 Second operand 10 states. [2018-12-08 13:46:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:11,567 INFO L93 Difference]: Finished difference Result 377 states and 480 transitions. [2018-12-08 13:46:11,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 13:46:11,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 480 transitions. [2018-12-08 13:46:11,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-12-08 13:46:11,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 276 states and 335 transitions. [2018-12-08 13:46:11,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-12-08 13:46:11,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2018-12-08 13:46:11,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 276 states and 335 transitions. [2018-12-08 13:46:11,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:11,571 INFO L705 BuchiCegarLoop]: Abstraction has 276 states and 335 transitions. [2018-12-08 13:46:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 335 transitions. [2018-12-08 13:46:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2018-12-08 13:46:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-08 13:46:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 324 transitions. [2018-12-08 13:46:11,575 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2018-12-08 13:46:11,575 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 324 transitions. [2018-12-08 13:46:11,575 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 13:46:11,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 324 transitions. [2018-12-08 13:46:11,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-12-08 13:46:11,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:11,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:11,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:11,576 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:11,576 INFO L794 eck$LassoCheckResult]: Stem: 9999#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 9972#L37 call main_#t~ret4 := fibo1(main_~x~0);< 9973#fibo1ENTRY ~n := #in~n; 10078#L8 assume !(~n < 1); 10077#L10 assume !(1 == ~n); 10074#L13 call #t~ret0 := fibo2(~n - 1);< 10076#fibo2ENTRY ~n := #in~n; 10075#L18 assume !(~n < 1); 10073#L20 assume !(1 == ~n); 10051#L23 call #t~ret2 := fibo1(~n - 1);< 10062#fibo1ENTRY ~n := #in~n; 10060#L8 assume !(~n < 1); 10058#L10 assume !(1 == ~n); 10055#L13 call #t~ret0 := fibo2(~n - 1);< 10056#fibo2ENTRY ~n := #in~n; 10061#L18 assume !(~n < 1); 10059#L20 assume 1 == ~n;#res := 1; 10057#fibo2FINAL assume true; 10054#fibo2EXIT >#49#return; 10039#L13-1 call #t~ret1 := fibo2(~n - 2);< 10049#fibo2ENTRY ~n := #in~n; 10047#L18 assume !(~n < 1); 10045#L20 assume !(1 == ~n); 10028#L23 call #t~ret2 := fibo1(~n - 1);< 10037#fibo1ENTRY ~n := #in~n; 10035#L8 assume !(~n < 1); 10030#L10 assume !(1 == ~n); 10011#L13 call #t~ret0 := fibo2(~n - 1);< 10026#fibo2ENTRY ~n := #in~n; 10022#L18 assume !(~n < 1); 10016#L20 assume !(1 == ~n); 10008#L23 call #t~ret2 := fibo1(~n - 1);< 10012#fibo1ENTRY ~n := #in~n; 10024#L8 assume !(~n < 1); 10020#L10 assume 1 == ~n;#res := 1; 10014#fibo1FINAL assume true; 10007#fibo1EXIT >#45#return; 10009#L23-1 call #t~ret3 := fibo1(~n - 2);< 10071#fibo1ENTRY ~n := #in~n; 10064#L8 assume ~n < 1;#res := 0; 10065#fibo1FINAL assume true; 10070#fibo1EXIT >#47#return; 10069#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10068#fibo2FINAL assume true; 10066#fibo2EXIT >#49#return; 10040#L13-1 call #t~ret1 := fibo2(~n - 2);< 10050#fibo2ENTRY ~n := #in~n; 10048#L18 assume !(~n < 1); 10046#L20 assume !(1 == ~n); 10029#L23 [2018-12-08 13:46:11,577 INFO L796 eck$LassoCheckResult]: Loop: 10029#L23 call #t~ret2 := fibo1(~n - 1);< 10038#fibo1ENTRY ~n := #in~n; 10036#L8 assume !(~n < 1); 10032#L10 assume !(1 == ~n); 9970#L13 call #t~ret0 := fibo2(~n - 1);< 10027#fibo2ENTRY ~n := #in~n; 10023#L18 assume !(~n < 1); 10018#L20 assume !(1 == ~n); 9982#L23 call #t~ret2 := fibo1(~n - 1);< 10013#fibo1ENTRY ~n := #in~n; 10025#L8 assume !(~n < 1); 10021#L10 assume 1 == ~n;#res := 1; 10015#fibo1FINAL assume true; 10010#fibo1EXIT >#45#return; 9969#L23-1 call #t~ret3 := fibo1(~n - 2);< 9971#fibo1ENTRY ~n := #in~n; 10072#L8 assume ~n < 1;#res := 0; 9993#fibo1FINAL assume true; 9981#fibo1EXIT >#47#return; 9976#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 9977#fibo2FINAL assume true; 10124#fibo2EXIT >#49#return; 10040#L13-1 call #t~ret1 := fibo2(~n - 2);< 10050#fibo2ENTRY ~n := #in~n; 10048#L18 assume !(~n < 1); 10046#L20 assume !(1 == ~n); 10029#L23 [2018-12-08 13:46:11,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash -582096202, now seen corresponding path program 1 times [2018-12-08 13:46:11,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 13:46:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:11,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:11,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 13:46:11,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:11,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-12-08 13:46:11,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:11,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 1 times [2018-12-08 13:46:11,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:11,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:11,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 13:46:11,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:11,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:11,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:11,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 13:46:11,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:11,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-08 13:46:11,810 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:46:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 13:46:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 13:46:11,811 INFO L87 Difference]: Start difference. First operand 270 states and 324 transitions. cyclomatic complexity: 59 Second operand 10 states. [2018-12-08 13:46:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:11,885 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-12-08 13:46:11,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 13:46:11,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 190 transitions. [2018-12-08 13:46:11,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-12-08 13:46:11,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 128 states and 145 transitions. [2018-12-08 13:46:11,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-12-08 13:46:11,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-12-08 13:46:11,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2018-12-08 13:46:11,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:11,887 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-12-08 13:46:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2018-12-08 13:46:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-12-08 13:46:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 13:46:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-08 13:46:11,891 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-08 13:46:11,891 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-08 13:46:11,891 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 13:46:11,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 138 transitions. [2018-12-08 13:46:11,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-12-08 13:46:11,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:11,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:11,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:11,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:11,893 INFO L794 eck$LassoCheckResult]: Stem: 10683#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 10661#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10663#fibo1ENTRY ~n := #in~n; 10696#L8 assume !(~n < 1); 10660#L10 assume !(1 == ~n); 10662#L13 call #t~ret0 := fibo2(~n - 1);< 10674#fibo2ENTRY ~n := #in~n; 10688#L18 assume !(~n < 1); 10692#L20 assume !(1 == ~n); 10658#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10681#L8 assume !(~n < 1); 10690#L10 assume !(1 == ~n); 10650#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10694#L18 assume !(~n < 1); 10695#L20 assume !(1 == ~n); 10649#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10681#L8 assume !(~n < 1); 10690#L10 assume !(1 == ~n); 10650#L13 call #t~ret0 := fibo2(~n - 1);< 10720#fibo2ENTRY ~n := #in~n; 10694#L18 assume !(~n < 1); 10695#L20 assume !(1 == ~n); 10649#L23 call #t~ret2 := fibo1(~n - 1);< 10651#fibo1ENTRY ~n := #in~n; 10682#L8 assume !(~n < 1); 10657#L10 assume 1 == ~n;#res := 1; 10659#fibo1FINAL assume true; 10737#fibo1EXIT >#45#return; 10735#L23-1 call #t~ret3 := fibo1(~n - 2);< 10736#fibo1ENTRY ~n := #in~n; 10742#L8 assume ~n < 1;#res := 0; 10741#fibo1FINAL assume true; 10734#fibo1EXIT >#47#return; 10727#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10723#fibo2FINAL assume true; 10718#fibo2EXIT >#49#return; 10686#L13-1 call #t~ret1 := fibo2(~n - 2);< 10684#fibo2ENTRY ~n := #in~n; 10687#L18 assume ~n < 1;#res := 0; 10766#fibo2FINAL assume true; 10714#fibo2EXIT >#51#return; 10711#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10708#fibo1FINAL assume true; 10706#fibo1EXIT >#45#return; 10668#L23-1 [2018-12-08 13:46:11,894 INFO L796 eck$LassoCheckResult]: Loop: 10668#L23-1 call #t~ret3 := fibo1(~n - 2);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume !(1 == ~n); 10647#L13 call #t~ret0 := fibo2(~n - 1);< 10713#fibo2ENTRY ~n := #in~n; 10712#L18 assume !(~n < 1); 10709#L20 assume !(1 == ~n); 10646#L23 call #t~ret2 := fibo1(~n - 1);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume !(1 == ~n); 10647#L13 call #t~ret0 := fibo2(~n - 1);< 10713#fibo2ENTRY ~n := #in~n; 10712#L18 assume !(~n < 1); 10709#L20 assume !(1 == ~n); 10646#L23 call #t~ret2 := fibo1(~n - 1);< 10648#fibo1ENTRY ~n := #in~n; 10721#L8 assume !(~n < 1); 10716#L10 assume 1 == ~n;#res := 1; 10717#fibo1FINAL assume true; 10761#fibo1EXIT >#45#return; 10652#L23-1 call #t~ret3 := fibo1(~n - 2);< 10653#fibo1ENTRY ~n := #in~n; 10680#L8 assume ~n < 1;#res := 0; 10675#fibo1FINAL assume true; 10666#fibo1EXIT >#47#return; 10664#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10665#fibo2FINAL assume true; 10719#fibo2EXIT >#49#return; 10686#L13-1 call #t~ret1 := fibo2(~n - 2);< 10684#fibo2ENTRY ~n := #in~n; 10687#L18 assume ~n < 1;#res := 0; 10766#fibo2FINAL assume true; 10714#fibo2EXIT >#51#return; 10711#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 10708#fibo1FINAL assume true; 10706#fibo1EXIT >#45#return; 10668#L23-1 [2018-12-08 13:46:11,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash -444366370, now seen corresponding path program 1 times [2018-12-08 13:46:11,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:11,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:11,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:11,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 13:46:12,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:12,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:12,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:12,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 13:46:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:12,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-12-08 13:46:12,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:12,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1179096830, now seen corresponding path program 1 times [2018-12-08 13:46:12,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:12,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 13:46:12,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:12,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:12,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:12,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 13:46:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:12,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-08 13:46:12,186 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:46:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 13:46:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 13:46:12,187 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. cyclomatic complexity: 19 Second operand 11 states. [2018-12-08 13:46:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:12,267 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-12-08 13:46:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 13:46:12,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2018-12-08 13:46:12,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-12-08 13:46:12,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 127 states and 141 transitions. [2018-12-08 13:46:12,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2018-12-08 13:46:12,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2018-12-08 13:46:12,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 141 transitions. [2018-12-08 13:46:12,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:12,270 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-12-08 13:46:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 141 transitions. [2018-12-08 13:46:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-12-08 13:46:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-08 13:46:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2018-12-08 13:46:12,273 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2018-12-08 13:46:12,273 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 138 transitions. [2018-12-08 13:46:12,273 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 13:46:12,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 138 transitions. [2018-12-08 13:46:12,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-12-08 13:46:12,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:12,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:12,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:12,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:12,275 INFO L794 eck$LassoCheckResult]: Stem: 11219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 11193#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11194#fibo1ENTRY ~n := #in~n; 11230#L8 assume !(~n < 1); 11198#L10 assume !(1 == ~n); 11199#L13 call #t~ret0 := fibo2(~n - 1);< 11211#fibo2ENTRY ~n := #in~n; 11225#L18 assume !(~n < 1); 11233#L20 assume !(1 == ~n); 11196#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11222#L8 assume !(~n < 1); 11310#L10 assume !(1 == ~n); 11191#L13 call #t~ret0 := fibo2(~n - 1);< 11254#fibo2ENTRY ~n := #in~n; 11256#L18 assume !(~n < 1); 11255#L20 assume !(1 == ~n); 11190#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11222#L8 assume !(~n < 1); 11310#L10 assume !(1 == ~n); 11191#L13 call #t~ret0 := fibo2(~n - 1);< 11254#fibo2ENTRY ~n := #in~n; 11256#L18 assume !(~n < 1); 11255#L20 assume !(1 == ~n); 11190#L23 call #t~ret2 := fibo1(~n - 1);< 11192#fibo1ENTRY ~n := #in~n; 11223#L8 assume !(~n < 1); 11195#L10 assume 1 == ~n;#res := 1; 11197#fibo1FINAL assume true; 11206#fibo1EXIT >#45#return; 11207#L23-1 call #t~ret3 := fibo1(~n - 2);< 11278#fibo1ENTRY ~n := #in~n; 11296#L8 assume ~n < 1;#res := 0; 11294#fibo1FINAL assume true; 11277#fibo1EXIT >#47#return; 11275#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11273#fibo2FINAL assume true; 11253#fibo2EXIT >#49#return; 11228#L13-1 call #t~ret1 := fibo2(~n - 2);< 11250#fibo2ENTRY ~n := #in~n; 11287#L18 assume !(~n < 1); 11286#L20 assume 1 == ~n;#res := 1; 11257#fibo2FINAL assume true; 11249#fibo2EXIT >#51#return; 11247#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11244#fibo1FINAL assume true; 11242#fibo1EXIT >#45#return; 11214#L23-1 [2018-12-08 13:46:12,275 INFO L796 eck$LassoCheckResult]: Loop: 11214#L23-1 call #t~ret3 := fibo1(~n - 2);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume !(1 == ~n); 11188#L13 call #t~ret0 := fibo2(~n - 1);< 11251#fibo2ENTRY ~n := #in~n; 11248#L18 assume !(~n < 1); 11245#L20 assume !(1 == ~n); 11187#L23 call #t~ret2 := fibo1(~n - 1);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume !(1 == ~n); 11188#L13 call #t~ret0 := fibo2(~n - 1);< 11251#fibo2ENTRY ~n := #in~n; 11248#L18 assume !(~n < 1); 11245#L20 assume !(1 == ~n); 11187#L23 call #t~ret2 := fibo1(~n - 1);< 11189#fibo1ENTRY ~n := #in~n; 11268#L8 assume !(~n < 1); 11267#L10 assume 1 == ~n;#res := 1; 11265#fibo1FINAL assume true; 11264#fibo1EXIT >#45#return; 11262#L23-1 call #t~ret3 := fibo1(~n - 2);< 11263#fibo1ENTRY ~n := #in~n; 11269#L8 assume ~n < 1;#res := 0; 11266#fibo1FINAL assume true; 11261#fibo1EXIT >#47#return; 11260#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11259#fibo2FINAL assume true; 11252#fibo2EXIT >#49#return; 11228#L13-1 call #t~ret1 := fibo2(~n - 2);< 11250#fibo2ENTRY ~n := #in~n; 11287#L18 assume !(~n < 1); 11286#L20 assume 1 == ~n;#res := 1; 11257#fibo2FINAL assume true; 11249#fibo2EXIT >#51#return; 11247#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11244#fibo1FINAL assume true; 11242#fibo1EXIT >#45#return; 11214#L23-1 [2018-12-08 13:46:12,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -167011978, now seen corresponding path program 1 times [2018-12-08 13:46:12,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:12,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:12,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:12,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:46:12,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:12,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:12,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:12,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:46:12,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:12,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-12-08 13:46:12,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:12,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1468819758, now seen corresponding path program 1 times [2018-12-08 13:46:12,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:12,658 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:12,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:12,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:12,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:12,658 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 13:46:12,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:12,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:12,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:12,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration9_Loop [2018-12-08 13:46:12,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:12,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:12,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:12,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:12,717 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/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-12-08 13:46:12,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:12,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:12,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 13:46:12,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=2} Honda state: {fibo2_#t~ret2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:12,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:12,745 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:12,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 13:46:12,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:13,276 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 13:46:13,278 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:13,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:13,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:13,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:13,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:46:13,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:13,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:13,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:13,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration9_Loop [2018-12-08 13:46:13,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:13,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:13,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-12-08 13:46:13,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-12-08 13:46:13,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-12-08 13:46:13,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:13,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:13,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:13,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:13,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:13,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-12-08 13:46:13,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:13,328 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:46:13,328 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-12-08 13:46:13,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:13,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:13,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:13,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:13,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:13,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:13,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:13,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:46:13,332 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:46:13,332 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:46:13,332 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:46:13,332 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:46:13,332 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:46:13,332 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2018-12-08 13:46:13,332 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 13:46:13,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:13,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:13,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 13:46:13,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-12-08 13:46:13,467 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-12-08 13:46:13,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 131 states and 145 transitions. Complement of second has 11 states. [2018-12-08 13:46:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 13:46:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 13:46:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-12-08 13:46:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2018-12-08 13:46:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:13,534 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:46:13,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:13,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:13,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 13:46:13,691 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2018-12-08 13:46:13,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-12-08 13:46:13,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 131 states and 145 transitions. Complement of second has 11 states. [2018-12-08 13:46:13,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 13:46:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 13:46:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-12-08 13:46:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 48 letters. Loop has 39 letters. [2018-12-08 13:46:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:13,776 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:46:13,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:13,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:13,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 13:46:13,908 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 10 loop predicates [2018-12-08 13:46:13,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-12-08 13:46:14,157 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 138 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 777 states and 862 transitions. Complement of second has 114 states. [2018-12-08 13:46:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-12-08 13:46:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 13:46:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2018-12-08 13:46:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 39 letters. [2018-12-08 13:46:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 87 letters. Loop has 39 letters. [2018-12-08 13:46:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:14,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 48 letters. Loop has 78 letters. [2018-12-08 13:46:14,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:14,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 862 transitions. [2018-12-08 13:46:14,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2018-12-08 13:46:14,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 292 states and 307 transitions. [2018-12-08 13:46:14,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-12-08 13:46:14,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-12-08 13:46:14,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 307 transitions. [2018-12-08 13:46:14,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:14,170 INFO L705 BuchiCegarLoop]: Abstraction has 292 states and 307 transitions. [2018-12-08 13:46:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 307 transitions. [2018-12-08 13:46:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 242. [2018-12-08 13:46:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-08 13:46:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2018-12-08 13:46:14,173 INFO L728 BuchiCegarLoop]: Abstraction has 242 states and 256 transitions. [2018-12-08 13:46:14,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 13:46:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-08 13:46:14,174 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand 17 states. [2018-12-08 13:46:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:14,305 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-12-08 13:46:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 13:46:14,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 193 transitions. [2018-12-08 13:46:14,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-08 13:46:14,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 122 states and 129 transitions. [2018-12-08 13:46:14,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-12-08 13:46:14,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2018-12-08 13:46:14,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 129 transitions. [2018-12-08 13:46:14,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:46:14,308 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-08 13:46:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 129 transitions. [2018-12-08 13:46:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-08 13:46:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-08 13:46:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-12-08 13:46:14,310 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-12-08 13:46:14,310 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-12-08 13:46:14,310 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 13:46:14,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 128 transitions. [2018-12-08 13:46:14,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-08 13:46:14,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:46:14,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:46:14,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:14,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:14,312 INFO L794 eck$LassoCheckResult]: Stem: 13975#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 13952#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13956#fibo1ENTRY ~n := #in~n; 13984#L8 assume !(~n < 1); 13951#L10 assume !(1 == ~n); 13953#L13 call #t~ret0 := fibo2(~n - 1);< 13994#fibo2ENTRY ~n := #in~n; 13982#L18 assume !(~n < 1); 13983#L20 assume !(1 == ~n); 13964#L23 call #t~ret2 := fibo1(~n - 1);< 13947#fibo1ENTRY ~n := #in~n; 13973#L8 assume !(~n < 1); 13979#L10 assume !(1 == ~n); 13946#L13 call #t~ret0 := fibo2(~n - 1);< 13965#fibo2ENTRY ~n := #in~n; 13977#L18 assume !(~n < 1); 13981#L20 assume !(1 == ~n); 13945#L23 call #t~ret2 := fibo1(~n - 1);< 13947#fibo1ENTRY ~n := #in~n; 13974#L8 assume !(~n < 1); 14047#L10 assume 1 == ~n;#res := 1; 14046#fibo1FINAL assume true; 14045#fibo1EXIT >#45#return; 13948#L23-1 call #t~ret3 := fibo1(~n - 2);< 13949#fibo1ENTRY ~n := #in~n; 14051#L8 assume ~n < 1;#res := 0; 14049#fibo1FINAL assume true; 14048#fibo1EXIT >#47#return; 13957#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13954#fibo2FINAL assume true; 13955#fibo2EXIT >#49#return; 13978#L13-1 call #t~ret1 := fibo2(~n - 2);< 13989#fibo2ENTRY ~n := #in~n; 14022#L18 assume !(~n < 1); 14023#L20 assume 1 == ~n;#res := 1; 13990#fibo2FINAL assume true; 13992#fibo2EXIT >#51#return; 14004#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14002#fibo1FINAL assume true; 13999#fibo1EXIT >#45#return; 13987#L23-1 call #t~ret3 := fibo1(~n - 2);< 13998#fibo1ENTRY ~n := #in~n; 14015#L8 assume !(~n < 1); 14014#L10 assume !(1 == ~n); 14012#L13 call #t~ret0 := fibo2(~n - 1);< 14013#fibo2ENTRY ~n := #in~n; 14026#L18 assume !(~n < 1); 14025#L20 assume !(1 == ~n); 13963#L23 call #t~ret2 := fibo1(~n - 1);< 14039#fibo1ENTRY ~n := #in~n; 14044#L8 assume !(~n < 1); 14043#L10 assume !(1 == ~n); 13943#L13 [2018-12-08 13:46:14,312 INFO L796 eck$LassoCheckResult]: Loop: 13943#L13 call #t~ret0 := fibo2(~n - 1);< 13962#fibo2ENTRY ~n := #in~n; 13976#L18 assume !(~n < 1); 13980#L20 assume !(1 == ~n); 13942#L23 call #t~ret2 := fibo1(~n - 1);< 13944#fibo1ENTRY ~n := #in~n; 13972#L8 assume !(~n < 1); 13950#L10 assume !(1 == ~n); 13943#L13 [2018-12-08 13:46:14,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1751159525, now seen corresponding path program 2 times [2018-12-08 13:46:14,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:14,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:14,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:14,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:14,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 13:46:14,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:14,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:14,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 13:46:14,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 13:46:14,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 13:46:14,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 13:46:14,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:14,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-12-08 13:46:14,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 13:46:14,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 2 times [2018-12-08 13:46:14,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:14,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:14,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:46:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:46:14,463 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:14,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:14,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:14,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:14,464 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 13:46:14,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:14,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:14,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:14,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration10_Loop [2018-12-08 13:46:14,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:14,464 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:14,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:14,498 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:14,498 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:14,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 13:46:14,501 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77451c47-d31b-48f7-bfa6-f9cd4071e572/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:14,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 13:46:14,518 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 13:46:15,710 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 13:46:15,711 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:46:15,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:46:15,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:46:15,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:46:15,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:46:15,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:46:15,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:46:15,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:46:15,712 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5_false-unreach-call_true-termination.c_Iteration10_Loop [2018-12-08 13:46:15,712 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:46:15,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:46:15,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:46:15,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:46:15,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:46:15,755 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-12-08 13:46:15,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:46:15,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:46:15,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:46:15,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:46:15,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:46:15,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:46:15,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:46:15,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:46:15,757 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:46:15,757 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:46:15,758 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:46:15,758 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:46:15,758 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:46:15,758 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2018-12-08 13:46:15,758 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 13:46:15,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:15,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:15,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:15,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-08 13:46:15,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-08 13:46:15,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 135 states and 143 transitions. Complement of second has 19 states. [2018-12-08 13:46:15,901 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-12-08 13:46:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 13:46:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-12-08 13:46:15,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 52 letters. Loop has 8 letters. [2018-12-08 13:46:15,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:15,901 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:46:15,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:15,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:15,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:15,981 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-08 13:46:15,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-08 13:46:16,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 141 states and 149 transitions. Complement of second has 21 states. [2018-12-08 13:46:16,049 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-12-08 13:46:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 13:46:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-12-08 13:46:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 52 letters. Loop has 8 letters. [2018-12-08 13:46:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:16,049 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:46:16,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:16,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:16,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:46:16,130 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-08 13:46:16,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-08 13:46:16,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 128 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 192 states and 201 transitions. Complement of second has 30 states. [2018-12-08 13:46:16,199 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-12-08 13:46:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 13:46:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-12-08 13:46:16,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 8 letters. [2018-12-08 13:46:16,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:16,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 60 letters. Loop has 8 letters. [2018-12-08 13:46:16,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:16,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 16 letters. [2018-12-08 13:46:16,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:46:16,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 201 transitions. [2018-12-08 13:46:16,201 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:46:16,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2018-12-08 13:46:16,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 13:46:16,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 13:46:16,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 13:46:16,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 13:46:16,201 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:46:16,201 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:46:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 13:46:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-08 13:46:16,201 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 14 states. [2018-12-08 13:46:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:16,201 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-08 13:46:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 13:46:16,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:46:16,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 13:46:16,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 13:46:16,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 13:46:16,202 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 13:46:16,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 13:46:16,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:46:16,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 13:46:16,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 01:46:16 BoogieIcfgContainer [2018-12-08 13:46:16,206 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 13:46:16,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:46:16,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:46:16,207 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:46:16,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:46:05" (3/4) ... [2018-12-08 13:46:16,209 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 13:46:16,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:46:16,210 INFO L168 Benchmark]: Toolchain (without parser) took 10668.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 962.4 MB in the beginning and 1.0 GB in the end (delta: -54.4 MB). Peak memory consumption was 293.2 MB. Max. memory is 11.5 GB. [2018-12-08 13:46:16,210 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:46:16,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.03 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-08 13:46:16,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.01 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:46:16,211 INFO L168 Benchmark]: Boogie Preprocessor took 10.17 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 13:46:16,211 INFO L168 Benchmark]: RCFGBuilder took 147.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-08 13:46:16,212 INFO L168 Benchmark]: BuchiAutomizer took 10368.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.3 MB). Peak memory consumption was 300.6 MB. Max. memory is 11.5 GB. [2018-12-08 13:46:16,212 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-12-08 13:46:16,213 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.03 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.01 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.17 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 147.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10368.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.3 MB). Peak memory consumption was 300.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. 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 14 terminating modules (9 trivial, 2 deterministic, 3 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 n and consists of 13 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 9 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 6.6s. Construction of modules took 0.9s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 290 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 590 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 11/41 HoareTripleCheckerStatistics: 390 SDtfs, 786 SDslu, 839 SDs, 0 SdLazy, 2005 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI4 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf98 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf92 smp81 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...