./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/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 dd317ac0ecdb37853dacea373914a521115465e0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:54:16,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:54:16,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:54:16,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:54:16,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:54:17,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:54:17,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:54:17,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:54:17,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:54:17,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:54:17,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:54:17,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:54:17,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:54:17,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:54:17,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:54:17,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:54:17,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:54:17,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:54:17,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:54:17,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:54:17,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:54:17,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:54:17,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:54:17,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:54:17,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:54:17,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:54:17,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:54:17,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:54:17,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:54:17,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:54:17,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:54:17,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:54:17,019 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:54:17,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:54:17,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:54:17,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:54:17,020 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:54:17,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:54:17,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:54:17,032 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:54:17,033 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:54:17,033 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:54:17,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:54:17,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:54:17,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:54:17,035 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:54:17,035 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:54:17,035 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:54:17,035 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:54:17,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:54:17,035 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:54:17,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:54:17,036 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:54:17,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:54:17,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:54:17,036 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:54:17,037 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:54:17,037 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_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/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 -> dd317ac0ecdb37853dacea373914a521115465e0 [2018-11-28 12:54:17,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:54:17,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:54:17,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:54:17,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:54:17,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:54:17,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-28 12:54:17,117 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/data/622e2663e/946e18afbd304348995eaee884d0985e/FLAG34f2cd003 [2018-11-28 12:54:17,413 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:54:17,414 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-28 12:54:17,419 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/data/622e2663e/946e18afbd304348995eaee884d0985e/FLAG34f2cd003 [2018-11-28 12:54:17,431 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/data/622e2663e/946e18afbd304348995eaee884d0985e [2018-11-28 12:54:17,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:54:17,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:54:17,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:54:17,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:54:17,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:54:17,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c466ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17, skipping insertion in model container [2018-11-28 12:54:17,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:54:17,461 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:54:17,559 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:54:17,561 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:54:17,570 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:54:17,578 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:54:17,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17 WrapperNode [2018-11-28 12:54:17,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:54:17,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:54:17,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:54:17,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:54:17,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:54:17,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:54:17,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:54:17,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:54:17,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... [2018-11-28 12:54:17,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:54:17,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:54:17,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:54:17,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:54:17,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:54:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:54:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-28 12:54:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-28 12:54:17,763 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:54:17,763 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 12:54:17,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:54:17 BoogieIcfgContainer [2018-11-28 12:54:17,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:54:17,763 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:54:17,763 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:54:17,765 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:54:17,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:54:17,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:54:17" (1/3) ... [2018-11-28 12:54:17,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@579dc45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:54:17, skipping insertion in model container [2018-11-28 12:54:17,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:54:17,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:54:17" (2/3) ... [2018-11-28 12:54:17,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@579dc45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:54:17, skipping insertion in model container [2018-11-28 12:54:17,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:54:17,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:54:17" (3/3) ... [2018-11-28 12:54:17,769 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_true-unreach-call_true-termination.c [2018-11-28 12:54:17,808 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:54:17,809 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:54:17,809 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:54:17,809 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:54:17,809 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:54:17,809 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:54:17,809 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:54:17,809 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:54:17,809 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:54:17,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 12:54:17,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:54:17,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:17,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:17,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:54:17,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:17,844 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:54:17,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 12:54:17,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:54:17,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:17,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:17,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:54:17,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:17,851 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-11-28 12:54:17,851 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2018-11-28 12:54:17,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-11-28 12:54:17,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:17,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:17,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:17,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-11-28 12:54:17,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:17,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:17,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:17,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:17,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:17,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-11-28 12:54:17,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:17,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:17,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:18,004 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:18,005 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:18,005 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:18,005 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:18,005 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:18,005 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:18,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:18,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-28 12:54:18,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:18,006 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:18,155 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:18,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:18,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:18,167 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:18,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:18,192 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:18,192 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:18,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:18,209 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:18,209 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:18,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:18,226 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:18,226 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:18,241 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:18,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:18,275 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:18,276 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:18,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:18,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:18,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:18,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:18,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:18,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:18,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-28 12:54:18,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:18,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:18,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,322 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:18,327 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:18,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-11-28 12:54:18,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:18,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:18,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:18,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:18,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:18,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:18,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:18,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:18,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:18,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:18,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:18,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:18,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:18,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:18,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:18,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:18,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:18,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:18,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:18,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:18,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:18,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:18,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:18,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:18,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:18,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:18,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:18,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:18,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:18,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:18,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:18,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:18,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:18,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:18,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:18,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:18,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:18,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:18,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:18,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:18,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:18,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:18,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:18,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:18,350 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:18,350 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:18,351 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:18,352 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:18,352 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:18,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-28 12:54:18,353 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:18,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:18,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:18,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:18,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:54:18,447 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-28 12:54:18,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-11-28 12:54:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:54:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 12:54:18,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 12:54:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:18,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:54:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:18,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 12:54:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:18,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-28 12:54:18,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:54:18,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-11-28 12:54:18,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:54:18,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:54:18,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-28 12:54:18,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:18,568 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 12:54:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-28 12:54:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-28 12:54:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:54:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-28 12:54:18,590 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 12:54:18,590 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 12:54:18,590 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:54:18,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-28 12:54:18,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:54:18,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:18,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:18,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:18,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:18,592 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2018-11-28 12:54:18,592 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2018-11-28 12:54:18,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:18,592 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-11-28 12:54:18,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:18,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:54:18,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:54:18,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:54:18,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:18,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-11-28 12:54:18,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:54:18,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:54:18,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:54:18,716 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:54:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:54:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:54:18,719 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 12:54:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:18,790 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-28 12:54:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:54:18,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-28 12:54:18,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:54:18,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-28 12:54:18,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 12:54:18,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 12:54:18,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-28 12:54:18,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:18,794 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 12:54:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-28 12:54:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 12:54:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 12:54:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-28 12:54:18,797 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 12:54:18,797 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 12:54:18,798 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:54:18,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-28 12:54:18,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:54:18,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:18,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:18,799 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:18,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:18,802 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2018-11-28 12:54:18,802 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2018-11-28 12:54:18,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-11-28 12:54:18,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:18,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:18,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:18,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:18,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:18,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:18,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:54:18,886 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:18,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-11-28 12:54:18,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:18,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:18,967 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:18,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:18,967 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:18,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:18,967 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:18,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:18,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:18,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:18,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-28 12:54:18,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:18,968 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:18,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:18,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:19,016 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:19,017 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:19,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:19,019 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:19,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:19,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:19,540 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:19,542 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:19,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:19,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:19,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:19,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:19,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:19,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:19,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:19,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-28 12:54:19,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:19,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:19,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:19,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:19,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:19,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:19,582 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:19,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:19,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:19,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:19,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:19,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:19,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:19,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:19,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:19,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:19,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:19,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:19,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:19,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:19,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:19,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:19,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:19,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:19,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:19,595 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:19,595 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:19,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:19,595 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:19,597 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:19,597 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-28 12:54:19,597 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:19,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:19,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:19,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:19,683 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:54:19,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-28 12:54:19,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-11-28 12:54:19,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:54:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-28 12:54:19,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 12:54:19,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:19,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-28 12:54:19,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:19,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-28 12:54:19,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:19,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-28 12:54:19,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:54:19,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-28 12:54:19,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-28 12:54:19,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-28 12:54:19,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-28 12:54:19,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:19,808 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-28 12:54:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-28 12:54:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-28 12:54:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:54:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-28 12:54:19,818 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-28 12:54:19,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:54:19,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:54:19,819 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-28 12:54:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:19,874 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-28 12:54:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:54:19,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-28 12:54:19,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:54:19,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-28 12:54:19,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-28 12:54:19,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-28 12:54:19,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-28 12:54:19,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:19,881 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-28 12:54:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-28 12:54:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-28 12:54:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:54:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-28 12:54:19,888 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-28 12:54:19,888 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-28 12:54:19,888 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:54:19,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-28 12:54:19,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:54:19,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:19,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:19,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:19,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:19,890 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-11-28 12:54:19,891 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2018-11-28 12:54:19,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-11-28 12:54:19,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:19,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:19,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:54:19,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:19,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:19,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:54:20,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:20,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 12:54:20,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:20,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-11-28 12:54:20,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:20,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:20,063 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:20,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:20,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:20,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:20,063 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:20,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:20,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:20,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:20,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-28 12:54:20,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:20,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:20,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,106 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:20,106 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:20,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:20,108 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:20,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:20,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:20,625 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:20,627 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:20,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:20,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:20,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:20,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:20,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:20,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:20,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:20,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-28 12:54:20,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:20,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:20,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:20,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:20,663 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:20,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:20,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:20,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:20,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:20,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:20,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:20,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:20,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:20,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:20,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:20,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:20,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:20,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:20,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:20,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:20,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:20,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:20,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:20,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:20,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:20,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:20,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:20,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:20,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:20,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:20,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:20,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:20,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:20,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:20,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:20,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:20,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:20,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:20,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:20,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:20,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:20,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:20,675 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:20,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:20,676 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:20,676 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:20,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-28 12:54:20,676 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:20,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:20,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:20,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:20,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:54:20,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-28 12:54:20,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-11-28 12:54:20,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:54:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-28 12:54:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 12:54:20,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:20,850 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:20,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:20,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:20,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:20,928 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:54:20,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-28 12:54:21,005 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-11-28 12:54:21,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:54:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-28 12:54:21,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 12:54:21,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:21,008 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:21,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:21,083 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:54:21,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-28 12:54:21,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-11-28 12:54:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:54:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-28 12:54:21,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-28 12:54:21,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:21,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-28 12:54:21,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:21,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-28 12:54:21,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:21,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-28 12:54:21,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 12:54:21,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-28 12:54:21,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-28 12:54:21,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-28 12:54:21,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-28 12:54:21,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:21,230 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-28 12:54:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-28 12:54:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-28 12:54:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-28 12:54:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-28 12:54:21,255 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-28 12:54:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:54:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:54:21,257 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-28 12:54:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:21,401 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-11-28 12:54:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:54:21,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-11-28 12:54:21,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 12:54:21,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-11-28 12:54:21,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-28 12:54:21,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-28 12:54:21,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-11-28 12:54:21,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:21,423 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-11-28 12:54:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-11-28 12:54:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-11-28 12:54:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-28 12:54:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-11-28 12:54:21,444 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-28 12:54:21,444 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-11-28 12:54:21,444 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:54:21,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-11-28 12:54:21,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-28 12:54:21,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:21,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:21,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:21,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:21,447 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-28 12:54:21,447 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-11-28 12:54:21,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-11-28 12:54:21,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:21,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:21,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 12:54:21,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:21,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:54:21,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:21,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-28 12:54:21,591 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:21,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-11-28 12:54:21,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:21,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:21,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:54:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:21,618 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:21,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:21,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:21,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:21,619 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:21,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:21,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:21,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:21,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-28 12:54:21,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:21,619 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:21,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:21,650 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:21,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:21,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:21,654 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:21,654 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:21,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:21,670 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:21,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:21,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:21,702 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:21,704 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:21,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:21,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:21,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:21,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:21,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:21,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:21,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:21,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-28 12:54:21,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:21,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:21,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,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-11-28 12:54:21,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:21,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:21,733 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:21,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:21,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:21,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:21,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:21,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:21,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:21,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:21,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:21,737 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:21,738 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:21,739 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:21,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:21,739 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:21,739 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:21,739 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-28 12:54:21,739 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:21,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:21,813 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:54:21,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-28 12:54:21,858 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-28 12:54:21,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:54:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 12:54:21,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:54:21,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:21,860 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:21,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:21,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:21,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:54:21,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-28 12:54:22,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-11-28 12:54:22,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:54:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 12:54:22,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:54:22,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:22,013 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:22,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:22,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:22,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:22,084 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:54:22,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-28 12:54:22,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-11-28 12:54:22,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:54:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 12:54:22,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:54:22,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:22,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 12:54:22,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:22,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-28 12:54:22,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:22,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-11-28 12:54:22,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-28 12:54:22,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-11-28 12:54:22,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-28 12:54:22,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-28 12:54:22,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-11-28 12:54:22,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:22,143 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-11-28 12:54:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-11-28 12:54:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-11-28 12:54:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-28 12:54:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-11-28 12:54:22,152 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-11-28 12:54:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:54:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:54:22,153 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-11-28 12:54:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:22,290 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-11-28 12:54:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:54:22,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-11-28 12:54:22,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:22,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-11-28 12:54:22,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-28 12:54:22,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-11-28 12:54:22,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-11-28 12:54:22,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:22,296 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-11-28 12:54:22,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-11-28 12:54:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-11-28 12:54:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-28 12:54:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-28 12:54:22,301 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-28 12:54:22,301 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-28 12:54:22,301 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:54:22,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-11-28 12:54:22,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:22,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:22,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:22,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:54:22,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:22,302 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-28 12:54:22,302 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-11-28 12:54:22,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-11-28 12:54:22,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:22,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 12:54:22,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:22,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:22,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:54:22,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:54:22,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:54:22,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:54:22,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:22,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-28 12:54:22,491 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:22,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:22,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-11-28 12:54:22,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:22,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:22,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:22,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:22,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:22,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:22,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:22,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:22,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:22,524 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:22,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:22,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:22,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:22,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-28 12:54:22,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:22,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:22,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:22,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:22,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:22,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:22,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:22,555 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:22,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:22,561 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:22,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:22,563 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:22,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:22,580 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:22,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:22,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:28,257 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:28,259 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:28,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:28,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:28,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:28,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:28,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:28,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:28,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:28,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-28 12:54:28,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:28,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:28,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:28,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:28,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:28,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:28,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:28,292 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:28,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:28,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:28,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:28,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:28,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:28,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:28,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:28,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:28,299 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:28,301 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:28,301 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:28,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:28,302 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:28,302 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:28,302 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-28 12:54:28,302 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:28,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:28,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:28,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:28,420 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:28,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 12:54:28,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-11-28 12:54:28,466 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-11-28 12:54:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-28 12:54:28,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-28 12:54:28,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:28,467 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:28,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:28,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:28,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:28,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:28,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 12:54:28,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-11-28 12:54:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 12:54:28,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-28 12:54:28,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:28,658 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:28,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:28,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:28,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:28,754 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:28,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 12:54:28,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-11-28 12:54:28,803 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-11-28 12:54:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:54:28,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-11-28 12:54:28,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:28,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-11-28 12:54:28,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:28,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-11-28 12:54:28,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:28,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-11-28 12:54:28,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:28,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-11-28 12:54:28,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-28 12:54:28,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-28 12:54:28,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-11-28 12:54:28,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:28,810 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-11-28 12:54:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-11-28 12:54:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-28 12:54:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-28 12:54:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-11-28 12:54:28,815 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-11-28 12:54:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 12:54:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:54:28,816 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-11-28 12:54:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:29,014 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-11-28 12:54:29,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 12:54:29,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-11-28 12:54:29,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:29,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-11-28 12:54:29,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-28 12:54:29,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-28 12:54:29,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-11-28 12:54:29,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:29,020 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-11-28 12:54:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-11-28 12:54:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-11-28 12:54:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-28 12:54:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-28 12:54:29,029 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-28 12:54:29,029 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-28 12:54:29,029 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:54:29,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-11-28 12:54:29,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:29,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:29,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:29,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-28 12:54:29,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:29,035 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-11-28 12:54:29,035 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-11-28 12:54:29,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2018-11-28 12:54:29,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:29,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-28 12:54:29,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:29,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:54:29,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 12:54:29,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:54:29,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-28 12:54:29,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:29,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-28 12:54:29,154 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:29,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-11-28 12:54:29,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:29,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:29,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:29,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:29,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:29,180 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:29,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:29,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:29,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:29,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:29,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:29,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:29,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:29,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-28 12:54:29,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:29,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:29,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-11-28 12:54:29,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-11-28 12:54:29,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-11-28 12:54:29,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:29,217 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:29,217 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:29,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:29,220 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:29,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:29,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:29,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:29,240 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:29,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:29,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:30,058 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:30,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:30,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:30,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:30,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:30,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:30,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:30,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:30,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:30,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-28 12:54:30,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:30,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:30,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:30,090 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:30,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:30,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:30,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:30,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:30,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:30,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:30,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:30,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:30,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:30,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:30,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:30,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:30,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:30,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:30,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:30,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:30,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:30,095 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:30,096 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:30,096 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:30,096 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:30,097 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:30,097 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:30,097 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-28 12:54:30,097 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:30,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:30,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:30,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-28 12:54:30,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-11-28 12:54:30,216 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-11-28 12:54:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-28 12:54:30,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-28 12:54:30,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:30,216 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:30,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:30,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:30,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-28 12:54:30,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-11-28 12:54:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 12:54:30,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-28 12:54:30,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:30,348 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:30,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:30,451 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:30,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-28 12:54:30,486 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-11-28 12:54:30,487 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-11-28 12:54:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:54:30,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-28 12:54:30,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:30,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-11-28 12:54:30,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:30,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-28 12:54:30,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:30,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-11-28 12:54:30,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:30,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-11-28 12:54:30,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-28 12:54:30,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-28 12:54:30,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-11-28 12:54:30,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:30,501 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-11-28 12:54:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-11-28 12:54:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-11-28 12:54:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-28 12:54:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-11-28 12:54:30,508 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-11-28 12:54:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:54:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:54:30,509 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2018-11-28 12:54:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:30,597 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2018-11-28 12:54:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:54:30,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2018-11-28 12:54:30,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:30,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2018-11-28 12:54:30,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2018-11-28 12:54:30,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-11-28 12:54:30,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2018-11-28 12:54:30,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:30,606 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2018-11-28 12:54:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2018-11-28 12:54:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2018-11-28 12:54:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-28 12:54:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-11-28 12:54:30,612 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-28 12:54:30,612 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-28 12:54:30,613 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:54:30,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2018-11-28 12:54:30,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:30,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:30,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:30,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2018-11-28 12:54:30,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:30,616 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-11-28 12:54:30,616 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-11-28 12:54:30,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:30,616 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2018-11-28 12:54:30,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:30,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:30,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:30,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:30,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-28 12:54:30,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:30,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:30,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 12:54:30,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 12:54:30,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:54:30,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-28 12:54:30,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:30,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2018-11-28 12:54:30,840 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:30,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2018-11-28 12:54:30,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:30,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:30,864 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:30,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:30,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:30,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:30,864 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:30,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:30,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:30,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:30,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-28 12:54:30,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:30,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:30,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:30,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:30,913 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:30,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:30,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:30,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:30,921 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:30,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:30,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:30,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:54:30,949 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:30,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:30,965 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:30,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:30,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:31,712 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:31,714 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:31,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:31,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:31,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:31,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:31,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:31,714 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:31,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:31,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-28 12:54:31,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:31,715 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:31,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:31,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:31,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:31,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:31,744 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:31,745 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:31,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:31,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:31,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:31,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:31,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:31,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:31,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:31,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:31,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:31,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:31,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:31,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:31,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:31,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:31,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:31,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:31,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:31,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:31,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:31,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:31,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:31,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:31,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:31,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:31,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:31,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:31,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:54:31,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:31,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:31,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:31,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:31,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:31,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:31,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:31,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:31,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:31,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:31,754 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:31,754 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:31,754 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:31,754 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:31,754 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-28 12:54:31,755 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:31,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:31,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:31,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:31,884 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:31,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-28 12:54:31,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2018-11-28 12:54:31,912 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-11-28 12:54:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-28 12:54:31,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-28 12:54:31,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:31,913 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:31,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:31,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:31,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:32,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:32,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-28 12:54:32,042 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2018-11-28 12:54:32,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 12:54:32,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-28 12:54:32,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:32,043 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:32,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:32,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:32,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:32,166 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:32,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-28 12:54:32,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2018-11-28 12:54:32,267 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-11-28 12:54:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:54:32,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2018-11-28 12:54:32,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:32,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2018-11-28 12:54:32,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:32,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2018-11-28 12:54:32,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:32,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2018-11-28 12:54:32,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:32,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2018-11-28 12:54:32,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-28 12:54:32,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2018-11-28 12:54:32,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2018-11-28 12:54:32,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:32,280 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-28 12:54:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2018-11-28 12:54:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-11-28 12:54:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-28 12:54:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-11-28 12:54:32,289 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-11-28 12:54:32,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:54:32,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:54:32,289 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2018-11-28 12:54:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:32,711 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2018-11-28 12:54:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:54:32,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2018-11-28 12:54:32,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:32,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2018-11-28 12:54:32,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-28 12:54:32,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2018-11-28 12:54:32,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2018-11-28 12:54:32,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:32,726 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2018-11-28 12:54:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2018-11-28 12:54:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2018-11-28 12:54:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-28 12:54:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-11-28 12:54:32,737 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-28 12:54:32,738 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-28 12:54:32,738 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:54:32,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2018-11-28 12:54:32,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:32,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:54:32,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:54:32,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 21, 16, 15, 15, 8, 8, 7, 7, 5, 3, 1, 1] [2018-11-28 12:54:32,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:54:32,742 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14934#fiboENTRY ~n := #in~n; 15105#L6 assume !(~n < 1); 15101#L8 assume !(1 == ~n); 15086#L11 call #t~ret0 := fibo(~n - 1);< 15091#fiboENTRY ~n := #in~n; 15089#L6 assume !(~n < 1); 15088#L8 assume !(1 == ~n); 15074#L11 call #t~ret0 := fibo(~n - 1);< 15084#fiboENTRY ~n := #in~n; 15082#L6 assume !(~n < 1); 15078#L8 assume !(1 == ~n); 15069#L11 call #t~ret0 := fibo(~n - 1);< 15073#fiboENTRY ~n := #in~n; 15071#L6 assume !(~n < 1); 15070#L8 assume !(1 == ~n); 14977#L11 call #t~ret0 := fibo(~n - 1);< 15002#fiboENTRY ~n := #in~n; 14997#L6 assume !(~n < 1); 14994#L8 assume !(1 == ~n); 14955#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14981#L6 assume !(~n < 1); 14979#L8 assume !(1 == ~n); 14956#L11 call #t~ret0 := fibo(~n - 1);< 14969#fiboENTRY ~n := #in~n; 14983#L6 assume !(~n < 1); 15241#L8 assume 1 == ~n;#res := 1; 15240#fiboFINAL assume true; 15237#fiboEXIT >#32#return; 15233#L11-1 call #t~ret1 := fibo(~n - 2);< 15234#fiboENTRY ~n := #in~n; 15239#L6 assume ~n < 1;#res := 0; 15236#fiboFINAL assume true; 15232#fiboEXIT >#34#return; 15230#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15228#fiboFINAL assume true; 15226#fiboEXIT >#32#return; 15059#L11-1 call #t~ret1 := fibo(~n - 2);< 15061#fiboENTRY ~n := #in~n; 15200#L6 assume !(~n < 1); 15068#L8 assume 1 == ~n;#res := 1; 14947#fiboFINAL assume true; 15058#fiboEXIT >#34#return; 15043#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15042#fiboFINAL assume true; 15027#fiboEXIT >#32#return; 15006#L11-1 call #t~ret1 := fibo(~n - 2);< 15008#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15067#L8 assume !(1 == ~n); 15036#L11 call #t~ret0 := fibo(~n - 1);< 15220#fiboENTRY ~n := #in~n; 15219#L6 assume !(~n < 1); 15054#L8 assume 1 == ~n;#res := 1; 15050#fiboFINAL assume true; 15034#fiboEXIT >#32#return; 14903#L11-1 call #t~ret1 := fibo(~n - 2);< 14900#fiboENTRY ~n := #in~n; 14905#L6 assume ~n < 1;#res := 0; 15033#fiboFINAL assume true; 15013#fiboEXIT >#34#return; 15012#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15010#fiboFINAL assume true; 15005#fiboEXIT >#34#return; 14998#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14974#fiboFINAL assume true; 14966#fiboEXIT >#32#return; 14946#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 14953#L6 assume !(~n < 1); 14945#L8 assume !(1 == ~n); 14948#L11 call #t~ret0 := fibo(~n - 1);< 15216#fiboENTRY ~n := #in~n; 15215#L6 assume !(~n < 1); 15212#L8 assume !(1 == ~n); 15194#L11 call #t~ret0 := fibo(~n - 1);< 15198#fiboENTRY ~n := #in~n; 15165#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15197#fiboFINAL assume true; 15193#fiboEXIT >#32#return; 15186#L11-1 call #t~ret1 := fibo(~n - 2);< 15192#fiboENTRY ~n := #in~n; 15196#L6 assume ~n < 1;#res := 0; 15150#fiboFINAL assume true; 15184#fiboEXIT >#34#return; 15189#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15225#fiboFINAL assume true; 15224#fiboEXIT >#32#return; 15057#L11-1 call #t~ret1 := fibo(~n - 2);< 15060#fiboENTRY ~n := #in~n; 15175#L6 assume !(~n < 1); 15063#L8 assume 1 == ~n;#res := 1; 15052#fiboFINAL assume true; 15056#fiboEXIT >#34#return; 15043#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15042#fiboFINAL assume true; 15027#fiboEXIT >#34#return; 14968#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15177#fiboFINAL assume true; 15028#fiboEXIT >#32#return; 14961#L11-1 call #t~ret1 := fibo(~n - 2);< 14978#fiboENTRY ~n := #in~n; 15151#L6 assume !(~n < 1); 14995#L8 assume !(1 == ~n); 14996#L11 call #t~ret0 := fibo(~n - 1);< 15039#fiboENTRY ~n := #in~n; 15221#L6 assume !(~n < 1); 15288#L8 assume !(1 == ~n); 14893#L11 call #t~ret0 := fibo(~n - 1);< 15249#fiboENTRY ~n := #in~n; 15261#L6 assume !(~n < 1); 15256#L8 assume !(1 == ~n); 14890#L11 [2018-11-28 12:54:32,742 INFO L796 eck$LassoCheckResult]: Loop: 14890#L11 call #t~ret0 := fibo(~n - 1);< 15249#fiboENTRY ~n := #in~n; 15261#L6 assume !(~n < 1); 15256#L8 assume !(1 == ~n); 14890#L11 [2018-11-28 12:54:32,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash -235209217, now seen corresponding path program 5 times [2018-11-28 12:54:32,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:32,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:32,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 346 proven. 454 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-11-28 12:54:32,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:54:32,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:54:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 12:54:32,997 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-28 12:54:32,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:54:33,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 346 proven. 478 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-28 12:54:33,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:54:33,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2018-11-28 12:54:33,037 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:54:33,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2018-11-28 12:54:33,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:54:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:54:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:33,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:54:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:54:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:54:33,083 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:33,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:33,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:33,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:33,083 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:54:33,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:33,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:33,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:33,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-28 12:54:33,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:33,083 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:33,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:33,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:33,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:33,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:33,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:33,114 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:33,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:54:33,116 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ecb0c8-0fcf-487d-a9e8-456da0cd007e/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:33,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:54:33,134 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:54:38,553 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:54:38,555 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:54:38,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:54:38,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:54:38,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:54:38,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:54:38,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:54:38,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:54:38,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:54:38,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-28 12:54:38,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:54:38,555 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:54:38,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:38,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:38,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:38,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:54:38,584 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:54:38,584 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:54:38,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:54:38,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:54:38,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:54:38,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:54:38,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:54:38,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:54:38,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:54:38,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:54:38,587 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:54:38,588 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:54:38,588 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:54:38,589 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:54:38,589 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:54:38,589 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:54:38,589 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-28 12:54:38,589 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:54:38,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:38,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:38,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:38,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:38,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-28 12:54:38,740 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2018-11-28 12:54:38,741 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-11-28 12:54:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-28 12:54:38,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-28 12:54:38,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:38,742 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:38,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:38,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:38,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:38,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:38,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-28 12:54:38,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2018-11-28 12:54:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:54:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 12:54:38,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-28 12:54:38,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:38,946 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:54:38,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:54:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:39,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:54:39,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:54:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:54:39,066 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:54:39,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-28 12:54:39,104 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2018-11-28 12:54:39,105 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-11-28 12:54:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:54:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:54:39,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2018-11-28 12:54:39,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:39,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 135 letters. Loop has 4 letters. [2018-11-28 12:54:39,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:39,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 8 letters. [2018-11-28 12:54:39,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:54:39,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2018-11-28 12:54:39,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:54:39,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2018-11-28 12:54:39,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2018-11-28 12:54:39,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2018-11-28 12:54:39,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2018-11-28 12:54:39,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:54:39,116 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2018-11-28 12:54:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2018-11-28 12:54:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2018-11-28 12:54:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-28 12:54:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-11-28 12:54:39,125 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-11-28 12:54:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 12:54:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:54:39,125 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 24 states. [2018-11-28 12:54:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:54:39,810 INFO L93 Difference]: Finished difference Result 575 states and 804 transitions. [2018-11-28 12:54:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 12:54:39,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 575 states and 804 transitions. [2018-11-28 12:54:39,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:54:39,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 575 states to 0 states and 0 transitions. [2018-11-28 12:54:39,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:54:39,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:54:39,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:54:39,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:54:39,814 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:54:39,814 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:54:39,814 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:54:39,814 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:54:39,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:54:39,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:54:39,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:54:39,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:54:39 BoogieIcfgContainer [2018-11-28 12:54:39,825 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:54:39,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:54:39,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:54:39,825 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:54:39,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:54:17" (3/4) ... [2018-11-28 12:54:39,832 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:54:39,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:54:39,832 INFO L168 Benchmark]: Toolchain (without parser) took 22397.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 953.3 MB in the beginning and 947.7 MB in the end (delta: 5.6 MB). Peak memory consumption was 222.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:54:39,834 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:54:39,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:54:39,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:54:39,835 INFO L168 Benchmark]: Boogie Preprocessor took 10.03 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:54:39,835 INFO L168 Benchmark]: RCFGBuilder took 152.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:54:39,835 INFO L168 Benchmark]: BuchiAutomizer took 22061.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 151.9 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:54:39,836 INFO L168 Benchmark]: Witness Printer took 6.76 ms. Allocated memory is still 1.2 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:54:39,838 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.03 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 152.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22061.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 151.9 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.76 ms. Allocated memory is still 1.2 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.0s and 10 iterations. TraceHistogramMax:24. Analysis of lassos took 16.5s. Construction of modules took 1.1s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 338 SDtfs, 934 SDslu, 469 SDs, 0 SdLazy, 1848 SolverSat, 717 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf97 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...