./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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 1ca069cb8d4103e8fb4700634948424bd87542bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:28,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:28,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:28,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:28,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:28,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:28,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:28,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:28,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:28,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:28,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:28,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:28,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:28,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:28,235 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:28,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:28,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:28,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:28,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:28,240 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:28,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:28,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:28,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:28,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:28,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:28,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:28,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:28,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:28,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:28,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:28,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:28,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:28,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:28,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:28,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:28,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:28,250 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:34:28,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:28,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:28,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:28,262 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:28,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:28,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:28,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:28,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:28,264 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:28,267 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:28,267 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_bd043b2f-e5f5-4253-80db-965686ca31eb/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 -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-11-18 08:34:28,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:28,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:28,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:28,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:28,304 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:28,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-18 08:34:28,339 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/data/252aa6748/2d1074a5f3b44ed78accfb2a7de56d84/FLAGd33560e36 [2018-11-18 08:34:28,748 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:28,748 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-18 08:34:28,753 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/data/252aa6748/2d1074a5f3b44ed78accfb2a7de56d84/FLAGd33560e36 [2018-11-18 08:34:28,765 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/data/252aa6748/2d1074a5f3b44ed78accfb2a7de56d84 [2018-11-18 08:34:28,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:28,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:28,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:28,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:28,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:28,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f35898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28, skipping insertion in model container [2018-11-18 08:34:28,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:28,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:28,926 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:28,929 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:28,941 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:28,952 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:28,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28 WrapperNode [2018-11-18 08:34:28,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:28,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:28,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:28,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:28,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:28,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:28,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:28,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:28,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... [2018-11-18 08:34:28,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:28,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:28,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:28,993 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:28,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:29,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:29,102 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-18 08:34:29,102 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-18 08:34:29,200 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:29,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29 BoogieIcfgContainer [2018-11-18 08:34:29,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:29,201 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:29,201 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:29,203 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:29,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:29,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:28" (1/3) ... [2018-11-18 08:34:29,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@730ee6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,205 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:29,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:28" (2/3) ... [2018-11-18 08:34:29,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@730ee6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,206 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:29,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29" (3/3) ... [2018-11-18 08:34:29,207 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-11-18 08:34:29,260 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:29,261 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:29,261 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:29,261 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:29,261 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:29,261 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:29,261 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:29,261 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:29,262 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:29,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:34:29,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:29,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:29,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:29,306 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 08:34:29,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:29,306 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:29,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:34:29,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:29,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:29,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:29,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 08:34:29,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:29,313 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 20#L25true call main_#t~ret2 := fibo(main_~x~0);< 12#fiboENTRYtrue [2018-11-18 08:34:29,314 INFO L796 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(1 == ~n); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-11-18 08:34:29,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-11-18 08:34:29,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:29,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-11-18 08:34:29,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:29,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:29,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:29,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-11-18 08:34:29,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,478 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:29,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:29,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:29,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:29,479 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:29,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:29,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:29,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-18 08:34:29,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:29,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:29,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,576 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:29,576 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:29,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:29,596 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:29,596 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:29,613 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:29,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:29,616 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:29,640 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:29,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:29,645 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:29,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:29,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:29,664 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:29,682 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:29,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:29,721 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:29,723 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:29,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:29,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:29,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:29,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:29,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:29,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:29,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-18 08:34:29,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:29,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:29,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:29,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:29,793 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:29,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:29,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:29,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:29,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:29,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:29,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:29,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:29,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:29,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:29,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:29,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:29,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:29,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:29,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:29,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:29,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:29,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:29,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:29,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:29,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:29,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:29,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:29,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:29,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:29,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:29,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:29,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:29,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:29,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:29,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:29,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:29,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:29,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:29,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:29,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:29,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:29,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:29,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:29,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:29,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:29,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:29,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:29,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:29,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:29,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:29,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:29,823 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:29,824 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:29,824 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:29,825 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:29,825 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-18 08:34:29,826 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:29,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:29,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:29,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:29,931 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-18 08:34:29,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-18 08:34:30,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2018-11-18 08:34:30,024 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-18 08:34:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 08:34:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 08:34:30,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:30,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 08:34:30,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:30,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 08:34:30,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:30,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-18 08:34:30,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:30,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-11-18 08:34:30,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 08:34:30,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 08:34:30,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-18 08:34:30,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:30,037 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 08:34:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-18 08:34:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-18 08:34:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 08:34:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-18 08:34:30,059 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 08:34:30,059 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-18 08:34:30,059 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:30,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-18 08:34:30,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:30,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,061 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 126#L25 call main_#t~ret2 := fibo(main_~x~0);< 131#fiboENTRY ~n := #in~n; 132#L6 assume !(~n < 1); 130#L8 assume !(1 == ~n); 123#L11 call #t~ret0 := fibo(~n - 1);< 133#fiboENTRY ~n := #in~n; 134#L6 assume ~n < 1;#res := 0; 129#fiboFINAL assume true; 122#fiboEXIT >#33#return; 124#L11-1 [2018-11-18 08:34:30,061 INFO L796 eck$LassoCheckResult]: Loop: 124#L11-1 call #t~ret1 := fibo(~n - 2);< 138#fiboENTRY ~n := #in~n; 141#L6 assume !(~n < 1); 140#L8 assume !(1 == ~n); 136#L11 call #t~ret0 := fibo(~n - 1);< 138#fiboENTRY ~n := #in~n; 141#L6 assume ~n < 1;#res := 0; 137#fiboFINAL assume true; 139#fiboEXIT >#33#return; 124#L11-1 [2018-11-18 08:34:30,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-11-18 08:34:30,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:30,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:34:30,145 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:30,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-11-18 08:34:30,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:30,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:34:30,193 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:30,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:34:30,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:34:30,197 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 08:34:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,277 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-18 08:34:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:34:30,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-18 08:34:30,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:30,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-18 08:34:30,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 08:34:30,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 08:34:30,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-18 08:34:30,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:30,281 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 08:34:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-18 08:34:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 08:34:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 08:34:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-18 08:34:30,284 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 08:34:30,284 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 08:34:30,285 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:30,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-18 08:34:30,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 08:34:30,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,287 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 191#L25 call main_#t~ret2 := fibo(main_~x~0);< 196#fiboENTRY ~n := #in~n; 197#L6 assume !(~n < 1); 195#L8 assume !(1 == ~n); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume 1 == ~n;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-11-18 08:34:30,287 INFO L796 eck$LassoCheckResult]: Loop: 189#L11-1 call #t~ret1 := fibo(~n - 2);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume !(1 == ~n); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume 1 == ~n;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-11-18 08:34:30,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-11-18 08:34:30,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:30,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:30,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:30,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:30,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:30,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 08:34:30,369 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:30,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-11-18 08:34:30,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,477 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:30,478 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:30,478 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:30,478 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:30,478 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:30,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:30,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:30,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:30,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-18 08:34:30,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:30,479 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:30,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:30,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:30,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:30,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:30,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:30,534 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:30,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:30,537 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:30,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:30,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:31,074 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:31,075 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:31,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:31,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:31,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:31,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:31,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:31,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:31,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:31,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-18 08:34:31,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:31,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:31,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:31,129 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:31,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:31,144 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:31,144 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:31,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:31,145 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:31,145 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:31,145 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:34:31,146 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:31,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:31,237 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:34:31,237 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-18 08:34:31,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-11-18 08:34:31,340 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-18 08:34:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 08:34:31,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 08:34:31,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:31,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-18 08:34:31,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:31,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-18 08:34:31,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:31,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-18 08:34:31,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 08:34:31,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-18 08:34:31,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-18 08:34:31,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 08:34:31,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-18 08:34:31,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:31,352 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-18 08:34:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-18 08:34:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-18 08:34:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 08:34:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-18 08:34:31,362 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-18 08:34:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:34:31,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:34:31,363 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-18 08:34:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,409 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-18 08:34:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:31,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-18 08:34:31,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 08:34:31,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-18 08:34:31,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-18 08:34:31,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 08:34:31,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-18 08:34:31,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:31,416 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-18 08:34:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-18 08:34:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-18 08:34:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 08:34:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-18 08:34:31,424 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-18 08:34:31,424 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-18 08:34:31,424 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:31,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-18 08:34:31,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 08:34:31,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:31,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:31,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,427 INFO L794 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 711#L25 call main_#t~ret2 := fibo(main_~x~0);< 752#fiboENTRY ~n := #in~n; 755#L6 assume !(~n < 1); 726#L8 assume !(1 == ~n); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(1 == ~n); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(1 == ~n); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume 1 == ~n;#res := 1; 773#fiboFINAL assume true; 772#fiboEXIT >#33#return; 729#L11-1 call #t~ret1 := fibo(~n - 2);< 771#fiboENTRY ~n := #in~n; 801#L6 assume ~n < 1;#res := 0; 800#fiboFINAL assume true; 799#fiboEXIT >#35#return; 798#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 797#fiboFINAL assume true; 790#fiboEXIT >#33#return; 723#L11-1 [2018-11-18 08:34:31,427 INFO L796 eck$LassoCheckResult]: Loop: 723#L11-1 call #t~ret1 := fibo(~n - 2);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume !(1 == ~n); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume 1 == ~n;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-11-18 08:34:31,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-11-18 08:34:31,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,482 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-18 08:34:31,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:31,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,504 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-18 08:34:31,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:31,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-18 08:34:31,526 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:31,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-11-18 08:34:31,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,585 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:31,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:31,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:31,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:31,585 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:31,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:31,586 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:31,586 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:31,586 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-18 08:34:31,586 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:31,586 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:31,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,616 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:31,616 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:31,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:31,618 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:31,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:31,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:32,129 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:32,131 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:32,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:32,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:32,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:32,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:32,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:32,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:32,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:32,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-18 08:34:32,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:32,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:32,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,176 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:32,176 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:32,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:32,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:32,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:32,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:32,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:32,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:32,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:32,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:32,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:32,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:32,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:32,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:32,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:32,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:32,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:32,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:32,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:32,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:32,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:32,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:32,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:32,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:32,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:32,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:32,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:32,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:32,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:32,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:32,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:32,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:32,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:32,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:32,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:32,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:32,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:32,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:32,190 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:32,190 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:32,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:32,191 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:32,191 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:32,191 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:34:32,191 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:32,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,276 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:34:32,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 08:34:32,371 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-11-18 08:34:32,371 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-18 08:34:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 08:34:32,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 08:34:32,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,373 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:32,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:34:32,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 08:34:32,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-11-18 08:34:32,565 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-18 08:34:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-18 08:34:32,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 08:34:32,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:32,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,652 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:34:32,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 08:34:32,788 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-11-18 08:34:32,790 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-18 08:34:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-18 08:34:32,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-18 08:34:32,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-18 08:34:32,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-18 08:34:32,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-18 08:34:32,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 08:34:32,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-18 08:34:32,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-18 08:34:32,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-18 08:34:32,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-18 08:34:32,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:32,815 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-18 08:34:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-18 08:34:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-18 08:34:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-18 08:34:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-18 08:34:32,843 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-18 08:34:32,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:34:32,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:34:32,844 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-18 08:34:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,993 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-11-18 08:34:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:34:32,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-11-18 08:34:33,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 08:34:33,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-11-18 08:34:33,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-18 08:34:33,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-18 08:34:33,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-11-18 08:34:33,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:33,008 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-11-18 08:34:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-11-18 08:34:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-11-18 08:34:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 08:34:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-11-18 08:34:33,026 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-18 08:34:33,026 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-18 08:34:33,026 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:33,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-11-18 08:34:33,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 08:34:33,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:33,033 INFO L794 eck$LassoCheckResult]: Stem: 3582#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3581#L25 call main_#t~ret2 := fibo(main_~x~0);< 3622#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3633#L8 assume !(1 == ~n); 3629#L11 call #t~ret0 := fibo(~n - 1);< 3631#fiboENTRY ~n := #in~n; 3632#L6 assume !(~n < 1); 3628#L8 assume !(1 == ~n); 3584#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3627#L6 assume !(~n < 1); 3630#L8 assume !(1 == ~n); 3585#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3626#L6 assume !(~n < 1); 3583#L8 assume 1 == ~n;#res := 1; 3586#fiboFINAL assume true; 3676#fiboEXIT >#33#return; 3652#L11-1 call #t~ret1 := fibo(~n - 2);< 3661#fiboENTRY ~n := #in~n; 3720#L6 assume !(~n < 1); 3712#L8 assume !(1 == ~n); 3714#L11 call #t~ret0 := fibo(~n - 1);< 3913#fiboENTRY ~n := #in~n; 3918#L6 assume !(~n < 1); 3915#L8 assume !(1 == ~n); 3916#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-18 08:34:33,033 INFO L796 eck$LassoCheckResult]: Loop: 3925#fiboENTRY ~n := #in~n; 3932#L6 assume !(~n < 1); 3931#L8 assume !(1 == ~n); 3922#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-18 08:34:33,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-11-18 08:34:33,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,074 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-18 08:34:33,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:33,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:33,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,151 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-18 08:34:33,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:33,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-18 08:34:33,167 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:33,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-11-18 08:34:33,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,188 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:33,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:33,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:33,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:33,188 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:33,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:33,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:33,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:33,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-18 08:34:33,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:33,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:33,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,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-18 08:34:33,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,224 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:33,224 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:33,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:33,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:33,230 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:33,230 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:33,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:33,245 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:33,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:33,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:33,279 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:33,280 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:33,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:33,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:33,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:33,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:33,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:33,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:33,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:33,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-18 08:34:33,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:33,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:33,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,324 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:33,325 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:33,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,328 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:33,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:33,329 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:33,329 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:33,330 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:33,330 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:33,330 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-18 08:34:33,330 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:33,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,407 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-18 08:34:33,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 08:34:33,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-18 08:34:33,463 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-18 08:34:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 08:34:33,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 08:34:33,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,463 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:33,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,555 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-18 08:34:33,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 08:34:33,598 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-18 08:34:33,599 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-18 08:34:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 08:34:33,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 08:34:33,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,600 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:33,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,667 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-18 08:34:33,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-18 08:34:33,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 495 states and 657 transitions. Complement of second has 14 states. [2018-11-18 08:34:33,715 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-18 08:34:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 08:34:33,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-18 08:34:33,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-18 08:34:33,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-18 08:34:33,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-11-18 08:34:33,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-18 08:34:33,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-11-18 08:34:33,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-18 08:34:33,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-18 08:34:33,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-11-18 08:34:33,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:33,728 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-11-18 08:34:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-11-18 08:34:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-11-18 08:34:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-18 08:34:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-11-18 08:34:33,741 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-11-18 08:34:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 08:34:33,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-18 08:34:33,742 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-11-18 08:34:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,923 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-11-18 08:34:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 08:34:33,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-11-18 08:34:33,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:33,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-11-18 08:34:33,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-18 08:34:33,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-18 08:34:33,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-11-18 08:34:33,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:33,931 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-11-18 08:34:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-11-18 08:34:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-11-18 08:34:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 08:34:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-18 08:34:33,954 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 08:34:33,954 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 08:34:33,954 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:34:33,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-11-18 08:34:33,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:33,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,956 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:33,957 INFO L794 eck$LassoCheckResult]: Stem: 6358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6357#L25 call main_#t~ret2 := fibo(main_~x~0);< 6395#fiboENTRY ~n := #in~n; 6465#L6 assume !(~n < 1); 6464#L8 assume !(1 == ~n); 6460#L11 call #t~ret0 := fibo(~n - 1);< 6463#fiboENTRY ~n := #in~n; 6462#L6 assume !(~n < 1); 6461#L8 assume !(1 == ~n); 6455#L11 call #t~ret0 := fibo(~n - 1);< 6459#fiboENTRY ~n := #in~n; 6457#L6 assume !(~n < 1); 6458#L8 assume !(1 == ~n); 6383#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(1 == ~n); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(1 == ~n); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6449#L6 assume !(~n < 1); 6450#L8 assume 1 == ~n;#res := 1; 6550#fiboFINAL assume true; 6549#fiboEXIT >#33#return; 6351#L11-1 call #t~ret1 := fibo(~n - 2);< 6385#fiboENTRY ~n := #in~n; 6553#L6 assume ~n < 1;#res := 0; 6552#fiboFINAL assume true; 6350#fiboEXIT >#35#return; 6352#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 6538#fiboFINAL assume true; 6523#fiboEXIT >#33#return; 6374#L11-1 call #t~ret1 := fibo(~n - 2);< 6522#fiboENTRY ~n := #in~n; 6541#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6360#L11 call #t~ret0 := fibo(~n - 1);< 6389#fiboENTRY ~n := #in~n; 6445#L6 assume !(~n < 1); 6435#L8 assume !(1 == ~n); 6417#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(1 == ~n); 6416#L11 [2018-11-18 08:34:33,957 INFO L796 eck$LassoCheckResult]: Loop: 6416#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(1 == ~n); 6416#L11 [2018-11-18 08:34:33,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1127026968, now seen corresponding path program 2 times [2018-11-18 08:34:33,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:34,035 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-18 08:34:34,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:34,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:34,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:34,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:34,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:34,173 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-18 08:34:34,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:34,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-18 08:34:34,200 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:34,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 3 times [2018-11-18 08:34:34,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:34,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:34,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:34,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:34,235 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:34,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:34,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:34,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:34,235 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:34,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:34,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:34,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:34,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-18 08:34:34,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:34,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:34,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,262 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:34,262 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:34,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:34,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:34,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:34,267 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_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:34,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:34,290 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:34,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:34,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:39,820 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:39,822 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:39,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:39,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:39,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:39,822 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:39,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:39,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:39,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:39,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-18 08:34:39,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:39,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:39,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:39,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:39,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:39,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:39,851 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:39,851 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:39,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:39,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:39,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:39,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:39,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:39,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:39,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:39,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:39,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:39,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:39,856 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:39,856 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:39,856 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:39,856 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:39,856 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:34:39,857 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:39,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:39,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:39,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:39,965 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-18 08:34:39,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 08:34:39,993 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 216 states and 274 transitions. Complement of second has 18 states. [2018-11-18 08:34:39,993 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-18 08:34:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:34:39,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 08:34:39,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:39,994 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:40,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:40,057 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-18 08:34:40,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 08:34:40,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 222 states and 280 transitions. Complement of second has 17 states. [2018-11-18 08:34:40,102 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-18 08:34:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:34:40,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 08:34:40,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:40,103 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:40,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:40,193 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-18 08:34:40,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-18 08:34:40,245 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 272 states and 344 transitions. Complement of second has 27 states. [2018-11-18 08:34:40,246 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-18 08:34:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:34:40,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 08:34:40,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:40,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-11-18 08:34:40,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:40,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-11-18 08:34:40,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:40,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-11-18 08:34:40,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:40,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-11-18 08:34:40,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-18 08:34:40,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-18 08:34:40,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-11-18 08:34:40,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:40,252 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-11-18 08:34:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-11-18 08:34:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-11-18 08:34:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 08:34:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-18 08:34:40,258 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-18 08:34:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 08:34:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:34:40,258 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-11-18 08:34:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:40,478 INFO L93 Difference]: Finished difference Result 342 states and 459 transitions. [2018-11-18 08:34:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 08:34:40,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 459 transitions. [2018-11-18 08:34:40,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:40,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 316 states and 427 transitions. [2018-11-18 08:34:40,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-11-18 08:34:40,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-18 08:34:40,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 427 transitions. [2018-11-18 08:34:40,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:40,484 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 427 transitions. [2018-11-18 08:34:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 427 transitions. [2018-11-18 08:34:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-11-18 08:34:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 08:34:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-18 08:34:40,492 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 08:34:40,492 INFO L608 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 08:34:40,492 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:34:40,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2018-11-18 08:34:40,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:40,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:40,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:40,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 08:34:40,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:40,495 INFO L794 eck$LassoCheckResult]: Stem: 8578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8567#L25 call main_#t~ret2 := fibo(main_~x~0);< 8615#fiboENTRY ~n := #in~n; 8682#L6 assume !(~n < 1); 8680#L8 assume !(1 == ~n); 8677#L11 call #t~ret0 := fibo(~n - 1);< 8678#fiboENTRY ~n := #in~n; 8694#L6 assume !(~n < 1); 8692#L8 assume !(1 == ~n); 8688#L11 call #t~ret0 := fibo(~n - 1);< 8691#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8717#L8 assume !(1 == ~n); 8684#L11 call #t~ret0 := fibo(~n - 1);< 8689#fiboENTRY ~n := #in~n; 8708#L6 assume !(~n < 1); 8706#L8 assume !(1 == ~n); 8609#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(1 == ~n); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(1 == ~n); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(1 == ~n); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8749#L6 assume !(~n < 1); 8830#L8 assume 1 == ~n;#res := 1; 8825#fiboFINAL assume true; 8824#fiboEXIT >#33#return; 8607#L11-1 call #t~ret1 := fibo(~n - 2);< 8610#fiboENTRY ~n := #in~n; 8781#L6 assume ~n < 1;#res := 0; 8780#fiboFINAL assume true; 8779#fiboEXIT >#35#return; 8777#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8776#fiboFINAL assume true; 8773#fiboEXIT >#33#return; 8729#L11-1 call #t~ret1 := fibo(~n - 2);< 8732#fiboENTRY ~n := #in~n; 8760#L6 assume !(~n < 1); 8754#L8 assume 1 == ~n;#res := 1; 8753#fiboFINAL assume true; 8728#fiboEXIT >#35#return; 8726#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8724#fiboFINAL assume true; 8723#fiboEXIT >#33#return; 8697#L11-1 call #t~ret1 := fibo(~n - 2);< 8700#fiboENTRY ~n := #in~n; 8757#L6 assume !(~n < 1); 8755#L8 assume !(1 == ~n); 8570#L11 call #t~ret0 := fibo(~n - 1);< 8612#fiboENTRY ~n := #in~n; 8834#L6 assume !(~n < 1); 8581#L8 assume !(1 == ~n); 8582#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(1 == ~n); 8636#L11 [2018-11-18 08:34:40,495 INFO L796 eck$LassoCheckResult]: Loop: 8636#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(1 == ~n); 8636#L11 [2018-11-18 08:34:40,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1780673760, now seen corresponding path program 3 times [2018-11-18 08:34:40,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:40,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:40,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:40,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,548 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-18 08:34:40,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:40,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:40,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:34:40,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 08:34:40,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:40,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,571 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-18 08:34:40,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:40,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-18 08:34:40,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:40,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 4 times [2018-11-18 08:34:40,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:40,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:40,620 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:40,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:40,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:40,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:40,621 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:40,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:40,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:40,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:40,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-18 08:34:40,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:40,621 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:40,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:40,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:40,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:40,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:40,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:40,650 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:40,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:40,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:40,654 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:40,654 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:40,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:40,669 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:40,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:40,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:41,470 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:41,472 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:41,472 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:41,472 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:41,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:41,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:41,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:41,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:41,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:41,473 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-18 08:34:41,473 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:41,473 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:41,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:41,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:41,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:41,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:41,505 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:41,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:41,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:41,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:41,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:41,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:41,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:41,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:41,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:41,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:41,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:41,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:41,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:41,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:41,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:41,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:41,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:41,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:41,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:41,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:41,512 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:41,512 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:41,512 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:41,512 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:41,512 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:41,512 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:34:41,513 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:41,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:41,600 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-18 08:34:41,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 08:34:41,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 298 states and 400 transitions. Complement of second has 18 states. [2018-11-18 08:34:41,632 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-18 08:34:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:34:41,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 08:34:41,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:41,633 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:41,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:41,723 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-18 08:34:41,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 08:34:41,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 304 states and 406 transitions. Complement of second has 17 states. [2018-11-18 08:34:41,781 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-18 08:34:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:34:41,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 08:34:41,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:41,782 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:41,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:41,886 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-18 08:34:41,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-18 08:34:41,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 362 states and 482 transitions. Complement of second has 27 states. [2018-11-18 08:34:41,923 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-18 08:34:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:34:41,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-18 08:34:41,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:41,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-11-18 08:34:41,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:41,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-18 08:34:41,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:41,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 482 transitions. [2018-11-18 08:34:41,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:41,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 287 states and 389 transitions. [2018-11-18 08:34:41,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-18 08:34:41,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-18 08:34:41,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 389 transitions. [2018-11-18 08:34:41,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:41,929 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 389 transitions. [2018-11-18 08:34:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 389 transitions. [2018-11-18 08:34:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-11-18 08:34:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 08:34:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-18 08:34:41,934 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-18 08:34:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:34:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:34:41,935 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand 11 states. [2018-11-18 08:34:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:42,035 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2018-11-18 08:34:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:34:42,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 574 transitions. [2018-11-18 08:34:42,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:42,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 378 states and 548 transitions. [2018-11-18 08:34:42,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-18 08:34:42,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-11-18 08:34:42,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 548 transitions. [2018-11-18 08:34:42,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:42,042 INFO L705 BuchiCegarLoop]: Abstraction has 378 states and 548 transitions. [2018-11-18 08:34:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 548 transitions. [2018-11-18 08:34:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 321. [2018-11-18 08:34:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 08:34:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-18 08:34:42,050 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:34:42,050 INFO L608 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:34:42,050 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:34:42,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 463 transitions. [2018-11-18 08:34:42,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:42,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:42,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:42,052 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 11, 10, 9, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2018-11-18 08:34:42,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:42,053 INFO L794 eck$LassoCheckResult]: Stem: 11440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11439#L25 call main_#t~ret2 := fibo(main_~x~0);< 11473#fiboENTRY ~n := #in~n; 11554#L6 assume !(~n < 1); 11552#L8 assume !(1 == ~n); 11549#L11 call #t~ret0 := fibo(~n - 1);< 11550#fiboENTRY ~n := #in~n; 11565#L6 assume !(~n < 1); 11563#L8 assume !(1 == ~n); 11560#L11 call #t~ret0 := fibo(~n - 1);< 11561#fiboENTRY ~n := #in~n; 11571#L6 assume !(~n < 1); 11570#L8 assume !(1 == ~n); 11556#L11 call #t~ret0 := fibo(~n - 1);< 11569#fiboENTRY ~n := #in~n; 11584#L6 assume !(~n < 1); 11582#L8 assume !(1 == ~n); 11493#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(1 == ~n); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(1 == ~n); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(1 == ~n); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11580#L6 assume !(~n < 1); 11686#L8 assume 1 == ~n;#res := 1; 11685#fiboFINAL assume true; 11683#fiboEXIT >#33#return; 11681#L11-1 call #t~ret1 := fibo(~n - 2);< 11682#fiboENTRY ~n := #in~n; 11688#L6 assume ~n < 1;#res := 0; 11687#fiboFINAL assume true; 11680#fiboEXIT >#35#return; 11677#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11676#fiboFINAL assume true; 11674#fiboEXIT >#33#return; 11662#L11-1 call #t~ret1 := fibo(~n - 2);< 11664#fiboENTRY ~n := #in~n; 11691#L6 assume !(~n < 1); 11673#L8 assume 1 == ~n;#res := 1; 11478#fiboFINAL assume true; 11661#fiboEXIT >#35#return; 11658#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11657#fiboFINAL assume true; 11635#fiboEXIT >#33#return; 11636#L11-1 call #t~ret1 := fibo(~n - 2);< 11641#fiboENTRY ~n := #in~n; 11675#L6 assume !(~n < 1); 11672#L8 assume !(1 == ~n); 11442#L11 call #t~ret0 := fibo(~n - 1);< 11702#fiboENTRY ~n := #in~n; 11472#L6 assume !(~n < 1); 11441#L8 assume 1 == ~n;#res := 1; 11444#fiboFINAL assume true; 11752#fiboEXIT >#33#return; 11649#L11-1 call #t~ret1 := fibo(~n - 2);< 11651#fiboENTRY ~n := #in~n; 11653#L6 assume ~n < 1;#res := 0; 11652#fiboFINAL assume true; 11648#fiboEXIT >#35#return; 11646#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11643#fiboFINAL assume true; 11639#fiboEXIT >#35#return; 11568#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11573#fiboFINAL assume true; 11566#fiboEXIT >#33#return; 11477#L11-1 call #t~ret1 := fibo(~n - 2);< 11488#fiboENTRY ~n := #in~n; 11486#L6 assume !(~n < 1); 11474#L8 assume !(1 == ~n); 11447#L11 call #t~ret0 := fibo(~n - 1);< 11703#fiboENTRY ~n := #in~n; 11751#L6 assume !(~n < 1); 11750#L8 assume !(1 == ~n); 11709#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(1 == ~n); 11708#L11 [2018-11-18 08:34:42,053 INFO L796 eck$LassoCheckResult]: Loop: 11708#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(1 == ~n); 11708#L11 [2018-11-18 08:34:42,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:42,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1797143672, now seen corresponding path program 4 times [2018-11-18 08:34:42,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:42,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 183 proven. 76 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-11-18 08:34:42,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:42,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 08:34:42,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 08:34:42,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:42,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 148 proven. 222 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 08:34:42,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:42,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 21 [2018-11-18 08:34:42,234 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:42,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 5 times [2018-11-18 08:34:42,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:42,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:42,262 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:42,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:42,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:42,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:42,262 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:42,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:42,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:42,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:42,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-18 08:34:42,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:42,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:42,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:42,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:42,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-18 08:34:42,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:42,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:42,294 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:42,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:42,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:42,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:42,303 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_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:42,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:42,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:42,321 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:42,321 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_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:42,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:42,340 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:42,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:42,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:43,105 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:43,106 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:43,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:43,106 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:43,106 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:43,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:43,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:43,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:43,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:43,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration8_Loop [2018-11-18 08:34:43,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:43,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:43,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:43,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:43,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:43,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:43,140 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:43,141 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:43,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:43,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:43,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:43,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:43,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:43,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:43,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:43,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:43,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:43,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:43,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:43,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:43,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:43,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:43,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:43,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:43,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:43,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:43,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:43,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:43,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:43,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:43,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:43,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:43,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:43,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:43,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:43,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:43,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:43,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:43,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:43,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:43,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:43,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:43,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:43,150 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:43,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:43,151 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:43,152 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:43,152 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:43,152 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:43,152 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:34:43,152 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:43,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:43,284 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-18 08:34:43,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-18 08:34:43,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 336 states and 479 transitions. Complement of second has 18 states. [2018-11-18 08:34:43,318 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-18 08:34:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:34:43,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-18 08:34:43,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:43,318 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:43,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:43,412 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-18 08:34:43,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-18 08:34:43,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 342 states and 485 transitions. Complement of second has 17 states. [2018-11-18 08:34:43,460 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-18 08:34:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:34:43,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-18 08:34:43,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:43,461 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:43,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:43,641 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-18 08:34:43,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-18 08:34:43,681 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 399 states and 563 transitions. Complement of second has 27 states. [2018-11-18 08:34:43,682 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-18 08:34:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:34:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-18 08:34:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 90 letters. Loop has 4 letters. [2018-11-18 08:34:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 8 letters. [2018-11-18 08:34:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:43,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 563 transitions. [2018-11-18 08:34:43,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:43,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 321 states and 463 transitions. [2018-11-18 08:34:43,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-18 08:34:43,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-18 08:34:43,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 463 transitions. [2018-11-18 08:34:43,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:43,689 INFO L705 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:34:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 463 transitions. [2018-11-18 08:34:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-11-18 08:34:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 08:34:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-18 08:34:43,696 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-18 08:34:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 08:34:43,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-18 08:34:43,696 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 21 states. [2018-11-18 08:34:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:43,994 INFO L93 Difference]: Finished difference Result 508 states and 782 transitions. [2018-11-18 08:34:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 08:34:43,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 782 transitions. [2018-11-18 08:34:44,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:44,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 504 states and 778 transitions. [2018-11-18 08:34:44,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-18 08:34:44,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-11-18 08:34:44,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 778 transitions. [2018-11-18 08:34:44,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:44,006 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 778 transitions. [2018-11-18 08:34:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 778 transitions. [2018-11-18 08:34:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 417. [2018-11-18 08:34:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 08:34:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-18 08:34:44,015 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:34:44,016 INFO L608 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:34:44,016 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 08:34:44,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 653 transitions. [2018-11-18 08:34:44,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:44,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:44,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:44,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2018-11-18 08:34:44,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:44,019 INFO L794 eck$LassoCheckResult]: Stem: 14879#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14868#L25 call main_#t~ret2 := fibo(main_~x~0);< 14924#fiboENTRY ~n := #in~n; 15008#L6 assume !(~n < 1); 15006#L8 assume !(1 == ~n); 15000#L11 call #t~ret0 := fibo(~n - 1);< 15003#fiboENTRY ~n := #in~n; 15004#L6 assume !(~n < 1); 15001#L8 assume !(1 == ~n); 14939#L11 call #t~ret0 := fibo(~n - 1);< 14998#fiboENTRY ~n := #in~n; 14996#L6 assume !(~n < 1); 14994#L8 assume !(1 == ~n); 14973#L11 call #t~ret0 := fibo(~n - 1);< 14990#fiboENTRY ~n := #in~n; 14989#L6 assume !(~n < 1); 14988#L8 assume !(1 == ~n); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(1 == ~n); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(1 == ~n); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(1 == ~n); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(1 == ~n); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14969#L6 assume !(~n < 1); 14968#L8 assume !(1 == ~n); 14954#L11 call #t~ret0 := fibo(~n - 1);< 14963#fiboENTRY ~n := #in~n; 14971#L6 assume !(~n < 1); 15205#L8 assume 1 == ~n;#res := 1; 15204#fiboFINAL assume true; 15201#fiboEXIT >#33#return; 15197#L11-1 call #t~ret1 := fibo(~n - 2);< 15198#fiboENTRY ~n := #in~n; 15203#L6 assume ~n < 1;#res := 0; 15200#fiboFINAL assume true; 15196#fiboEXIT >#35#return; 15154#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15153#fiboFINAL assume true; 15152#fiboEXIT >#33#return; 15065#L11-1 call #t~ret1 := fibo(~n - 2);< 15069#fiboENTRY ~n := #in~n; 15217#L6 assume !(~n < 1); 15082#L8 assume 1 == ~n;#res := 1; 15080#fiboFINAL assume true; 15064#fiboEXIT >#35#return; 15062#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15060#fiboFINAL assume true; 15038#fiboEXIT >#33#return; 15039#L11-1 call #t~ret1 := fibo(~n - 2);< 15087#fiboENTRY ~n := #in~n; 15086#L6 assume !(~n < 1); 15084#L8 assume !(1 == ~n); 15085#L11 call #t~ret0 := fibo(~n - 1);< 15207#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15194#L8 assume 1 == ~n;#res := 1; 15190#fiboFINAL assume true; 15159#fiboEXIT >#33#return; 15052#L11-1 call #t~ret1 := fibo(~n - 2);< 15057#fiboENTRY ~n := #in~n; 15078#L6 assume ~n < 1;#res := 0; 15061#fiboFINAL assume true; 15051#fiboEXIT >#35#return; 15055#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15150#fiboFINAL assume true; 15147#fiboEXIT >#35#return; 15145#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14966#fiboFINAL assume true; 14961#fiboEXIT >#33#return; 14949#L11-1 call #t~ret1 := fibo(~n - 2);< 14955#fiboENTRY ~n := #in~n; 14948#L6 assume !(~n < 1); 14950#L8 assume !(1 == ~n); 14930#L11 call #t~ret0 := fibo(~n - 1);< 15157#fiboENTRY ~n := #in~n; 15174#L6 assume !(~n < 1); 15173#L8 assume !(1 == ~n); 15170#L11 call #t~ret0 := fibo(~n - 1);< 15172#fiboENTRY ~n := #in~n; 15179#L6 assume !(~n < 1); 15177#L8 assume 1 == ~n;#res := 1; 15175#fiboFINAL assume true; 15169#fiboEXIT >#33#return; 15163#L11-1 call #t~ret1 := fibo(~n - 2);< 14920#fiboENTRY ~n := #in~n; 15186#L6 assume ~n < 1;#res := 0; 15128#fiboFINAL assume true; 15162#fiboEXIT >#35#return; 15161#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15158#fiboFINAL assume true; 15156#fiboEXIT >#33#return; 15067#L11-1 call #t~ret1 := fibo(~n - 2);< 15070#fiboENTRY ~n := #in~n; 15187#L6 assume !(~n < 1); 15091#L8 assume 1 == ~n;#res := 1; 14929#fiboFINAL assume true; 15066#fiboEXIT >#35#return; 15062#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15060#fiboFINAL assume true; 15038#fiboEXIT >#35#return; 15021#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15019#fiboFINAL assume true; 15014#fiboEXIT >#33#return; 14958#L11-1 call #t~ret1 := fibo(~n - 2);< 14940#fiboENTRY ~n := #in~n; 15136#L6 assume !(~n < 1); 15083#L8 assume !(1 == ~n); 14871#L11 call #t~ret0 := fibo(~n - 1);< 15208#fiboENTRY ~n := #in~n; 15209#L6 assume !(~n < 1); 15280#L8 assume !(1 == ~n); 14882#L11 call #t~ret0 := fibo(~n - 1);< 14923#fiboENTRY ~n := #in~n; 15237#L6 assume !(~n < 1); 15235#L8 assume !(1 == ~n); 14881#L11 [2018-11-18 08:34:44,020 INFO L796 eck$LassoCheckResult]: Loop: 14881#L11 call #t~ret0 := fibo(~n - 1);< 14923#fiboENTRY ~n := #in~n; 15237#L6 assume !(~n < 1); 15235#L8 assume !(1 == ~n); 14881#L11 [2018-11-18 08:34:44,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1400596499, now seen corresponding path program 5 times [2018-11-18 08:34:44,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:44,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 6 times [2018-11-18 08:34:44,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:44,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash 662415298, now seen corresponding path program 6 times [2018-11-18 08:34:44,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-11-18 08:34:44,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:44,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:44,227 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 08:34:44,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-18 08:34:44,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:44,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-18 08:34:44,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:44,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-11-18 08:34:44,351 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:44,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:44,351 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:44,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:44,352 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:44,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:44,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:44,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:44,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-18 08:34:44,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:44,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:44,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:44,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:44,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:44,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:44,392 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:44,393 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:44,395 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:44,396 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd043b2f-e5f5-4253-80db-965686ca31eb/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-18 08:34:44,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:44,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,653 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:49,655 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:49,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:49,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:49,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:49,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:49,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:49,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:49,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_false-unreach-call_true-termination.c_Iteration9_Loop [2018-11-18 08:34:49,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:49,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:49,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:49,684 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:49,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,686 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:49,687 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:49,687 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:49,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:49,688 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:49,688 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:49,688 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-18 08:34:49,688 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 08:34:49,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:49,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:49,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:49,809 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-18 08:34:49,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-18 08:34:49,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 432 states and 669 transitions. Complement of second has 18 states. [2018-11-18 08:34:49,845 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-18 08:34:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 08:34:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-18 08:34:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:49,846 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:49,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:49,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:49,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:49,971 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-18 08:34:49,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-18 08:34:50,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 438 states and 675 transitions. Complement of second has 17 states. [2018-11-18 08:34:50,024 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-18 08:34:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-18 08:34:50,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-18 08:34:50,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,025 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:50,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:50,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:50,141 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-18 08:34:50,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-18 08:34:50,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 513 states and 783 transitions. Complement of second has 27 states. [2018-11-18 08:34:50,180 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-18 08:34:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 08:34:50,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-18 08:34:50,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 132 letters. Loop has 4 letters. [2018-11-18 08:34:50,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 8 letters. [2018-11-18 08:34:50,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 783 transitions. [2018-11-18 08:34:50,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:50,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 417 states and 653 transitions. [2018-11-18 08:34:50,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-18 08:34:50,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-11-18 08:34:50,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 653 transitions. [2018-11-18 08:34:50,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:50,189 INFO L705 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:34:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 653 transitions. [2018-11-18 08:34:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-18 08:34:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 08:34:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-18 08:34:50,197 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-18 08:34:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 08:34:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-18 08:34:50,198 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand 25 states. [2018-11-18 08:34:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:50,549 INFO L93 Difference]: Finished difference Result 595 states and 922 transitions. [2018-11-18 08:34:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 08:34:50,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 922 transitions. [2018-11-18 08:34:50,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:50,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 0 states and 0 transitions. [2018-11-18 08:34:50,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:34:50,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:34:50,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:34:50,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:50,554 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:50,554 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:50,554 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:50,554 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 08:34:50,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:34:50,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:50,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:34:50,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:50 BoogieIcfgContainer [2018-11-18 08:34:50,562 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:50,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:50,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:50,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:50,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29" (3/4) ... [2018-11-18 08:34:50,566 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:50,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:50,567 INFO L168 Benchmark]: Toolchain (without parser) took 21799.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 387.4 MB). Free memory was 952.7 MB in the beginning and 923.7 MB in the end (delta: 29.0 MB). Peak memory consumption was 416.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,568 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:50,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.08 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.15 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,569 INFO L168 Benchmark]: Boogie Preprocessor took 13.66 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:50,569 INFO L168 Benchmark]: RCFGBuilder took 207.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,570 INFO L168 Benchmark]: BuchiAutomizer took 21361.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.2 GB in the beginning and 923.7 MB in the end (delta: 240.7 MB). Peak memory consumption was 447.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,570 INFO L168 Benchmark]: Witness Printer took 4.09 ms. Allocated memory is still 1.4 GB. Free memory is still 923.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:50,573 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.08 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 25.15 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.66 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 207.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21361.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.2 GB in the beginning and 923.7 MB in the end (delta: 240.7 MB). Peak memory consumption was 447.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.09 ms. Allocated memory is still 1.4 GB. Free memory is still 923.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 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.3s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 16.2s. Construction of modules took 1.1s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 474 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 417 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 355 SDtfs, 976 SDslu, 536 SDs, 0 SdLazy, 1912 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT6 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: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...