./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd317ac0ecdb37853dacea373914a521115465e0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:25:15,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:25:15,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:25:15,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:25:15,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:25:15,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:25:15,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:25:15,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:25:15,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:25:15,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:25:15,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:25:15,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:25:15,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:25:15,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:25:15,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:25:15,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:25:15,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:25:15,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:25:15,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:25:15,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:25:15,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:25:15,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:25:15,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:25:15,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:25:15,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:25:15,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:25:15,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:25:15,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:25:15,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:25:15,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:25:15,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:25:15,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:25:15,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:25:15,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:25:15,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:25:15,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:25:15,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:25:15,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:25:15,457 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:25:15,458 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:25:15,458 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:25:15,459 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:25:15,459 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:25:15,459 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:25:15,459 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:25:15,459 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:25:15,459 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:25:15,460 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:25:15,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:25:15,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:25:15,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:25:15,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:25:15,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:25:15,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:25:15,461 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:25:15,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:25:15,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:25:15,462 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:25:15,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:25:15,462 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:25:15,462 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:25:15,463 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:25:15,463 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_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd317ac0ecdb37853dacea373914a521115465e0 [2018-11-10 03:25:15,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:25:15,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:25:15,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:25:15,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:25:15,503 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:25:15,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-10 03:25:15,550 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/data/913f181e2/03e3a383b2014aa89921be1703759e54/FLAG1627ed242 [2018-11-10 03:25:15,907 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:25:15,908 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-11-10 03:25:15,914 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/data/913f181e2/03e3a383b2014aa89921be1703759e54/FLAG1627ed242 [2018-11-10 03:25:15,928 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/bin-2019/uautomizer/data/913f181e2/03e3a383b2014aa89921be1703759e54 [2018-11-10 03:25:15,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:25:15,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:25:15,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:25:15,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:25:15,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:25:15,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:25:15" (1/1) ... [2018-11-10 03:25:15,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ca410a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:15, skipping insertion in model container [2018-11-10 03:25:15,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:25:15" (1/1) ... [2018-11-10 03:25:15,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:25:15,969 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:25:16,099 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:25:16,102 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:25:16,113 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:25:16,123 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:25:16,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16 WrapperNode [2018-11-10 03:25:16,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:25:16,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:25:16,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:25:16,124 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:25:16,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:25:16,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:25:16,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:25:16,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:25:16,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... [2018-11-10 03:25:16,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:25:16,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:25:16,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:25:16,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:25:16,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:25:16,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:25:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-10 03:25:16,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-10 03:25:16,348 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:25:16,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:25:16 BoogieIcfgContainer [2018-11-10 03:25:16,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:25:16,349 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:25:16,349 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:25:16,353 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:25:16,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:25:16,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:25:15" (1/3) ... [2018-11-10 03:25:16,355 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d539113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:25:16, skipping insertion in model container [2018-11-10 03:25:16,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:25:16,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:16" (2/3) ... [2018-11-10 03:25:16,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d539113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:25:16, skipping insertion in model container [2018-11-10 03:25:16,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:25:16,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:25:16" (3/3) ... [2018-11-10 03:25:16,358 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_true-unreach-call_true-termination.c [2018-11-10 03:25:16,412 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:25:16,413 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:25:16,413 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:25:16,413 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:25:16,413 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:25:16,413 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:25:16,413 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:25:16,413 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:25:16,413 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:25:16,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 03:25:16,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:25:16,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:16,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:16,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:25:16,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:16,459 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:25:16,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 03:25:16,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:25:16,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:16,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:16,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:25:16,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:16,472 INFO L793 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-10 03:25:16,472 INFO L795 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(~n == 1); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-11-10 03:25:16,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-11-10 03:25:16,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:16,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:16,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:16,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:16,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-11-10 03:25:16,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:16,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:16,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:16,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:16,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-11-10 03:25:16,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:16,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:16,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:16,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:16,668 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:16,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:16,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:16,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:16,670 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:16,670 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:16,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:16,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:16,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 03:25:16,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:16,671 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:16,691 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-10 03:25:16,703 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-10 03:25:16,708 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-10 03:25:16,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:16,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:16,794 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:16,794 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:16,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:16,817 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:16,817 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:16,839 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:16,842 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:16,842 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:16,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:16,867 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:16,867 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:16,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:16,903 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:16,903 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:16,923 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:16,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:16,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:16,970 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:16,971 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:16,971 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:16,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:16,971 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:16,971 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:16,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:16,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:16,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:16,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 03:25:16,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:16,972 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:16,973 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-10 03:25:16,975 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-10 03:25:16,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:16,979 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-10 03:25:16,981 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-10 03:25:17,024 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:17,030 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:17,032 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-10 03:25:17,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:17,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:17,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:17,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:17,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:17,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:17,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:17,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:17,042 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-10 03:25:17,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:17,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:17,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:17,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:17,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:17,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:17,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:17,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:17,046 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-10 03:25:17,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:17,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:17,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:17,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:17,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:17,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:17,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:17,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:17,050 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-10 03:25:17,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:17,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:17,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:17,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:17,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:17,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:17,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:17,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:17,055 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-10 03:25:17,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:17,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:17,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:17,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:17,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:17,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:17,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:17,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:17,067 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:17,067 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:17,068 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:17,069 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:17,069 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:17,069 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 03:25:17,070 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:17,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:17,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:17,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:17,152 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-10 03:25:17,169 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-10 03:25:17,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 03:25:17,268 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-10 03:25:17,268 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-10 03:25:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:25:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 03:25:17,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-10 03:25:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:17,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 03:25:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:17,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 03:25:17,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:17,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-10 03:25:17,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:25:17,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-11-10 03:25:17,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 03:25:17,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 03:25:17,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-10 03:25:17,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:17,292 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-10 03:25:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-10 03:25:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-10 03:25:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 03:25:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-10 03:25:17,318 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 03:25:17,318 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 03:25:17,318 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:25:17,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-10 03:25:17,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:25:17,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:17,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:17,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:17,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:17,320 INFO L793 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 !(~n == 1); 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-10 03:25:17,320 INFO L795 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 !(~n == 1); 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-10 03:25:17,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-11-10 03:25:17,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:17,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:17,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:17,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:17,401 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-10 03:25:17,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:25:17,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:25:17,405 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:17,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-11-10 03:25:17,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:17,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:17,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:17,438 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-10 03:25:17,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:25:17,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:25:17,438 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:25:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:25:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:25:17,442 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 03:25:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:17,523 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-10 03:25:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:25:17,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-10 03:25:17,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:25:17,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-10 03:25:17,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:25:17,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 03:25:17,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-10 03:25:17,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:17,528 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 03:25:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-10 03:25:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 03:25:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 03:25:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-10 03:25:17,531 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 03:25:17,531 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 03:25:17,531 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:25:17,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-10 03:25:17,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:25:17,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:17,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:17,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:17,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:17,533 INFO L793 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 !(~n == 1); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume ~n == 1;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 03:25:17,534 INFO L795 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 !(~n == 1); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume ~n == 1;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 03:25:17,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-11-10 03:25:17,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:17,569 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-10 03:25:17,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:17,569 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:17,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:17,604 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-10 03:25:17,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:17,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 03:25:17,624 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:17,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-11-10 03:25:17,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:17,733 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:17,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:17,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:17,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:17,734 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:17,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:17,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:17,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:17,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 03:25:17,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:17,734 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:17,736 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-10 03:25:17,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:17,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:17,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:17,783 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:17,783 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:17,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:17,792 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:17,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:17,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:18,950 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:18,952 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:18,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:18,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:18,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:18,953 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:18,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:18,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:18,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:18,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 03:25:18,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:18,953 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:18,954 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-10 03:25:18,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:18,964 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-10 03:25:18,965 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-10 03:25:19,003 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:19,004 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:19,008 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-10 03:25:19,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:19,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:19,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:19,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:19,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:19,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:19,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:19,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:19,014 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-10 03:25:19,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:19,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:19,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:19,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:19,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:19,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:19,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:19,025 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:19,029 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:19,029 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:19,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:19,030 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:19,030 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:19,030 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 03:25:19,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:19,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:19,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:19,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:19,143 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-10 03:25:19,144 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-10 03:25:19,144 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:25:19,269 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-10 03:25:19,270 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-10 03:25:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:25:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 03:25:19,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 03:25:19,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:19,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-10 03:25:19,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:19,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-10 03:25:19,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:19,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-10 03:25:19,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:25:19,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-10 03:25:19,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 03:25:19,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 03:25:19,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-10 03:25:19,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:19,285 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-10 03:25:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-10 03:25:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-10 03:25:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 03:25:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-10 03:25:19,295 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-10 03:25:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:25:19,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:25:19,295 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-10 03:25:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:19,357 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-10 03:25:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:25:19,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-10 03:25:19,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:25:19,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-10 03:25:19,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 03:25:19,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 03:25:19,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-10 03:25:19,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:19,364 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-10 03:25:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-10 03:25:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-10 03:25:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 03:25:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-10 03:25:19,372 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 03:25:19,372 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 03:25:19,372 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:25:19,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-10 03:25:19,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:25:19,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:19,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:19,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:19,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:19,377 INFO L793 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 !(~n == 1); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume ~n == 1;#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-10 03:25:19,377 INFO L795 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 !(~n == 1); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume ~n == 1;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 03:25:19,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-11-10 03:25:19,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:19,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:19,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:19,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:19,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:19,439 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-10 03:25:19,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:19,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:19,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:19,477 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-10 03:25:19,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:19,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 03:25:19,501 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:19,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-11-10 03:25:19,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:19,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:19,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:19,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:19,576 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:19,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:19,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:19,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:19,576 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:19,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:19,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:19,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:19,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 03:25:19,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:19,577 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:19,578 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-10 03:25:19,583 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-10 03:25:19,585 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-10 03:25:19,586 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-10 03:25:19,613 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:19,613 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:19,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:19,616 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:19,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:19,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:20,781 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:20,783 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:20,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:20,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:20,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:20,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:20,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:20,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:20,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:20,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 03:25:20,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:20,783 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:20,784 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-10 03:25:20,786 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-10 03:25:20,787 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-10 03:25:20,790 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-10 03:25:20,819 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:20,820 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:20,820 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-10 03:25:20,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:20,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:20,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:20,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:20,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:20,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:20,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:20,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:20,822 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-10 03:25:20,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:20,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:20,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:20,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:20,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:20,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:20,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:20,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:20,824 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-10 03:25:20,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:20,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:20,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:20,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:20,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:20,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:20,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:20,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:20,826 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-10 03:25:20,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:20,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:20,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:20,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:20,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:20,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:20,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:20,831 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:20,833 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:20,833 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:20,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:20,834 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:20,834 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:20,834 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 03:25:20,834 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:20,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:20,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:20,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:20,938 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-10 03:25:20,938 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-10 03:25:20,938 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 03:25:21,053 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-10 03:25:21,054 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-10 03:25:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:25:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 03:25:21,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 03:25:21,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:21,055 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:21,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:21,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:21,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:21,152 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-10 03:25:21,152 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-10 03:25:21,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 03:25:21,252 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-10 03:25:21,253 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-10 03:25:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:25:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 03:25:21,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 03:25:21,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:21,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:21,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:21,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:21,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:21,358 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-10 03:25:21,358 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-10 03:25:21,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 03:25:21,499 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-10 03:25:21,501 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-10 03:25:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:25:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-10 03:25:21,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 03:25:21,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:21,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-10 03:25:21,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:21,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-10 03:25:21,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:21,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-10 03:25:21,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 03:25:21,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-10 03:25:21,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-10 03:25:21,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-10 03:25:21,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-10 03:25:21,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:21,533 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-10 03:25:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-10 03:25:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-10 03:25:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-10 03:25:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-10 03:25:21,565 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-10 03:25:21,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:25:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:25:21,565 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-10 03:25:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:21,801 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-11-10 03:25:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:25:21,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-11-10 03:25:21,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 03:25:21,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-11-10 03:25:21,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-10 03:25:21,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-10 03:25:21,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-11-10 03:25:21,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:21,817 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-11-10 03:25:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-11-10 03:25:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-11-10 03:25:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-10 03:25:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-11-10 03:25:21,839 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-10 03:25:21,839 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-10 03:25:21,839 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:25:21,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-11-10 03:25:21,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:25:21,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:21,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:21,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:21,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:21,842 INFO L793 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);< 3620#fiboENTRY ~n := #in~n; 3636#L6 assume !(~n < 1); 3635#L8 assume !(~n == 1); 3631#L11 call #t~ret0 := fibo(~n - 1);< 3633#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3630#L8 assume !(~n == 1); 3584#L11 call #t~ret0 := fibo(~n - 1);< 3627#fiboENTRY ~n := #in~n; 3629#L6 assume !(~n < 1); 3632#L8 assume !(~n == 1); 3585#L11 call #t~ret0 := fibo(~n - 1);< 3627#fiboENTRY ~n := #in~n; 3628#L6 assume !(~n < 1); 3583#L8 assume ~n == 1;#res := 1; 3586#fiboFINAL assume true; 3677#fiboEXIT >#33#return; 3653#L11-1 call #t~ret1 := fibo(~n - 2);< 3662#fiboENTRY ~n := #in~n; 3910#L6 assume !(~n < 1); 3713#L8 assume !(~n == 1); 3715#L11 call #t~ret0 := fibo(~n - 1);< 3919#fiboENTRY ~n := #in~n; 3923#L6 assume !(~n < 1); 3921#L8 assume !(~n == 1); 3622#L11 call #t~ret0 := fibo(~n - 1);< 3929#fiboENTRY [2018-11-10 03:25:21,842 INFO L795 eck$LassoCheckResult]: Loop: 3929#fiboENTRY ~n := #in~n; 3621#L6 assume !(~n < 1); 3625#L8 assume !(~n == 1); 3623#L11 call #t~ret0 := fibo(~n - 1);< 3929#fiboENTRY [2018-11-10 03:25:21,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-11-10 03:25:21,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:21,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:21,891 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-10 03:25:21,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:21,891 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:21,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:21,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:21,998 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-10 03:25:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:22,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-10 03:25:22,029 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:22,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-11-10 03:25:22,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:22,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:22,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:22,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:25:22,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:22,059 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:22,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:22,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:22,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:22,060 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:22,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:22,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:22,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:22,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 03:25:22,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:22,061 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:22,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:22,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:22,079 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-10 03:25:22,080 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-10 03:25:22,082 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-10 03:25:22,105 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:22,106 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:22,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:22,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:22,113 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:22,113 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:22,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:22,134 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:22,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:22,156 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:22,178 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:22,180 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:22,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:22,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:22,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:22,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:22,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:22,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:22,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:22,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 03:25:22,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:22,181 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:22,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:25:22,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-10 03:25:22,193 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-10 03:25:22,198 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-10 03:25:22,200 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-10 03:25:22,222 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:22,222 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:22,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:25:22,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:22,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:22,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:22,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:22,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:22,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:22,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:22,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:22,228 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:22,228 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:22,228 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:22,228 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:22,229 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:22,229 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 03:25:22,229 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:22,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:22,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:22,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:22,332 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-10 03:25:22,333 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-10 03:25:22,333 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 03:25:22,384 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-10 03:25:22,384 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-10 03:25:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:25:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 03:25:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 03:25:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:22,385 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:22,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:22,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:22,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:22,462 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-10 03:25:22,462 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-10 03:25:22,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 03:25:22,540 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-10 03:25:22,541 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-10 03:25:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:25:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 03:25:22,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 03:25:22,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:22,542 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:22,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:22,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:22,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:22,628 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-10 03:25:22,628 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-10 03:25:22,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 03:25:22,691 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-10 03:25:22,695 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-10 03:25:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:25:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 03:25:22,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 03:25:22,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:22,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 03:25:22,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:22,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-10 03:25:22,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:22,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-11-10 03:25:22,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 03:25:22,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-11-10 03:25:22,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-10 03:25:22,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-10 03:25:22,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-11-10 03:25:22,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:22,711 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-11-10 03:25:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-11-10 03:25:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-11-10 03:25:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-10 03:25:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-11-10 03:25:22,726 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-11-10 03:25:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:25:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:25:22,726 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-11-10 03:25:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:22,966 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-11-10 03:25:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:25:22,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-11-10 03:25:22,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:22,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-11-10 03:25:22,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-10 03:25:22,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-10 03:25:22,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-11-10 03:25:22,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:22,975 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-11-10 03:25:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-11-10 03:25:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-11-10 03:25:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 03:25:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-10 03:25:22,982 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 03:25:22,982 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 03:25:22,983 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:25:22,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-11-10 03:25:22,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:22,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:22,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:22,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:25:22,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:22,985 INFO L793 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 !(~n == 1); 6460#L11 call #t~ret0 := fibo(~n - 1);< 6463#fiboENTRY ~n := #in~n; 6462#L6 assume !(~n < 1); 6461#L8 assume !(~n == 1); 6455#L11 call #t~ret0 := fibo(~n - 1);< 6459#fiboENTRY ~n := #in~n; 6457#L6 assume !(~n < 1); 6458#L8 assume !(~n == 1); 6383#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6449#L6 assume !(~n < 1); 6450#L8 assume ~n == 1;#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 !(~n == 1); 6360#L11 call #t~ret0 := fibo(~n - 1);< 6389#fiboENTRY ~n := #in~n; 6445#L6 assume !(~n < 1); 6435#L8 assume !(~n == 1); 6417#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-11-10 03:25:22,986 INFO L795 eck$LassoCheckResult]: Loop: 6416#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-11-10 03:25:22,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1127026968, now seen corresponding path program 2 times [2018-11-10 03:25:22,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:22,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:23,061 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-10 03:25:23,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:23,061 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:23,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:25:23,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:25:23,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:25:23,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:23,185 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-10 03:25:23,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:23,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-10 03:25:23,208 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:23,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:23,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 3 times [2018-11-10 03:25:23,208 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:23,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:23,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:23,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:23,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:23,239 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:23,239 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:23,239 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:23,239 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:23,239 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:23,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:23,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:23,240 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:23,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-10 03:25:23,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:23,240 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:23,241 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-10 03:25:23,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-10 03:25:23,249 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-10 03:25:23,250 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-10 03:25:23,276 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:23,277 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:23,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:23,284 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:23,287 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:23,287 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:23,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:23,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:23,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:23,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:26,194 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:26,195 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:26,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:26,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:26,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:26,196 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:26,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:26,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:26,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:26,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-11-10 03:25:26,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:26,196 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:26,197 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-10 03:25:26,206 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-10 03:25:26,214 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-10 03:25:26,217 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-10 03:25:26,242 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:26,243 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:26,243 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-10 03:25:26,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:26,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:26,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:26,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:26,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:26,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:26,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:26,256 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:26,258 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:26,258 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:26,258 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:26,258 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:26,259 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:26,259 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 03:25:26,261 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:26,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:26,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:26,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:26,373 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-10 03:25:26,373 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-10 03:25:26,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 03:25:26,414 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-10 03:25:26,419 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-10 03:25:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 03:25:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 03:25:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:26,420 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:26,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:26,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:26,553 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-10 03:25:26,553 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-10 03:25:26,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 03:25:26,634 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-10 03:25:26,635 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-10 03:25:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 03:25:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 03:25:26,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:26,636 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:26,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:26,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:26,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:26,785 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-10 03:25:26,785 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-10 03:25:26,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 03:25:26,836 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-10 03:25:26,837 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-10 03:25:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 03:25:26,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 03:25:26,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:26,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-11-10 03:25:26,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:26,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-11-10 03:25:26,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:26,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-11-10 03:25:26,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:26,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-11-10 03:25:26,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 03:25:26,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-10 03:25:26,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-11-10 03:25:26,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:26,845 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-11-10 03:25:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-11-10 03:25:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-11-10 03:25:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 03:25:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-10 03:25:26,850 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 03:25:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 03:25:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:25:26,851 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-11-10 03:25:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:27,138 INFO L93 Difference]: Finished difference Result 342 states and 459 transitions. [2018-11-10 03:25:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 03:25:27,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 459 transitions. [2018-11-10 03:25:27,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:27,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 316 states and 427 transitions. [2018-11-10 03:25:27,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-11-10 03:25:27,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-10 03:25:27,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 427 transitions. [2018-11-10 03:25:27,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:27,145 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 427 transitions. [2018-11-10 03:25:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 427 transitions. [2018-11-10 03:25:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-11-10 03:25:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-10 03:25:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-10 03:25:27,152 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-10 03:25:27,153 INFO L608 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-10 03:25:27,153 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:25:27,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2018-11-10 03:25:27,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:27,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:27,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:27,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 03:25:27,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:27,156 INFO L793 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 !(~n == 1); 8677#L11 call #t~ret0 := fibo(~n - 1);< 8678#fiboENTRY ~n := #in~n; 8694#L6 assume !(~n < 1); 8692#L8 assume !(~n == 1); 8688#L11 call #t~ret0 := fibo(~n - 1);< 8691#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8717#L8 assume !(~n == 1); 8684#L11 call #t~ret0 := fibo(~n - 1);< 8689#fiboENTRY ~n := #in~n; 8708#L6 assume !(~n < 1); 8706#L8 assume !(~n == 1); 8609#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8747#L6 assume !(~n < 1); 8745#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8702#fiboENTRY ~n := #in~n; 8749#L6 assume !(~n < 1); 8830#L8 assume ~n == 1;#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 ~n == 1;#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 !(~n == 1); 8570#L11 call #t~ret0 := fibo(~n - 1);< 8612#fiboENTRY ~n := #in~n; 8834#L6 assume !(~n < 1); 8581#L8 assume !(~n == 1); 8582#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(~n == 1); 8636#L11 [2018-11-10 03:25:27,156 INFO L795 eck$LassoCheckResult]: Loop: 8636#L11 call #t~ret0 := fibo(~n - 1);< 8638#fiboENTRY ~n := #in~n; 8656#L6 assume !(~n < 1); 8655#L8 assume !(~n == 1); 8636#L11 [2018-11-10 03:25:27,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1780673760, now seen corresponding path program 3 times [2018-11-10 03:25:27,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:27,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:27,223 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-10 03:25:27,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:27,223 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:25:27,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 03:25:27,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:25:27,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:27,259 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-10 03:25:27,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:27,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 03:25:27,292 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:27,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 4 times [2018-11-10 03:25:27,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:27,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:27,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:27,333 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:27,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:27,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:27,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:27,333 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:27,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:27,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:27,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:27,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 03:25:27,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:27,333 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:27,334 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-10 03:25:27,336 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-10 03:25:27,342 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-10 03:25:27,343 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-10 03:25:27,376 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:27,376 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:27,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:27,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:27,383 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:27,383 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:27,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:27,404 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:27,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:27,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:28,696 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:28,698 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:28,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:28,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:28,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:28,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:28,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:28,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:28,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:28,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 03:25:28,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:28,699 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:28,700 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-10 03:25:28,701 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-10 03:25:28,706 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-10 03:25:28,708 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-10 03:25:28,735 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:28,735 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:28,735 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-10 03:25:28,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:28,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:28,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:28,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:28,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:28,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:28,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:28,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:28,738 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-10 03:25:28,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:28,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:28,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:28,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:28,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:28,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:28,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:28,741 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:28,751 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:28,751 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:28,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:28,751 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:28,752 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:28,752 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 03:25:28,752 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:28,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:28,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:28,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:28,848 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-10 03:25:28,848 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-10 03:25:28,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-10 03:25:28,889 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-10 03:25:28,889 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-10 03:25:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 03:25:28,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 03:25:28,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:28,890 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:28,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:28,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:28,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:28,989 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-10 03:25:28,989 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-10 03:25:28,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-10 03:25:29,049 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-10 03:25:29,050 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-10 03:25:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 03:25:29,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 03:25:29,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:29,051 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:29,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:29,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:29,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:29,182 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-10 03:25:29,182 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-10 03:25:29,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 283 states and 384 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-11-10 03:25:29,235 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-10 03:25:29,235 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-10 03:25:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 03:25:29,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 03:25:29,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:29,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-11-10 03:25:29,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:29,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-10 03:25:29,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:29,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 482 transitions. [2018-11-10 03:25:29,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:29,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 287 states and 389 transitions. [2018-11-10 03:25:29,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 03:25:29,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-10 03:25:29,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 389 transitions. [2018-11-10 03:25:29,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:29,244 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 389 transitions. [2018-11-10 03:25:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 389 transitions. [2018-11-10 03:25:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-11-10 03:25:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-10 03:25:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2018-11-10 03:25:29,250 INFO L728 BuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2018-11-10 03:25:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:25:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:25:29,251 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand 11 states. [2018-11-10 03:25:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:29,379 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2018-11-10 03:25:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:25:29,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 574 transitions. [2018-11-10 03:25:29,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:29,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 378 states and 548 transitions. [2018-11-10 03:25:29,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-10 03:25:29,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-11-10 03:25:29,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 548 transitions. [2018-11-10 03:25:29,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:29,391 INFO L705 BuchiCegarLoop]: Abstraction has 378 states and 548 transitions. [2018-11-10 03:25:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 548 transitions. [2018-11-10 03:25:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 321. [2018-11-10 03:25:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-10 03:25:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-10 03:25:29,404 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 03:25:29,404 INFO L608 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 03:25:29,404 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:25:29,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 463 transitions. [2018-11-10 03:25:29,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:29,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:29,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:29,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 11, 10, 9, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2018-11-10 03:25:29,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:29,408 INFO L793 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 !(~n == 1); 11549#L11 call #t~ret0 := fibo(~n - 1);< 11550#fiboENTRY ~n := #in~n; 11565#L6 assume !(~n < 1); 11563#L8 assume !(~n == 1); 11560#L11 call #t~ret0 := fibo(~n - 1);< 11561#fiboENTRY ~n := #in~n; 11571#L6 assume !(~n < 1); 11570#L8 assume !(~n == 1); 11556#L11 call #t~ret0 := fibo(~n - 1);< 11569#fiboENTRY ~n := #in~n; 11584#L6 assume !(~n < 1); 11582#L8 assume !(~n == 1); 11493#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11578#L6 assume !(~n < 1); 11576#L8 assume !(~n == 1); 11494#L11 call #t~ret0 := fibo(~n - 1);< 11574#fiboENTRY ~n := #in~n; 11580#L6 assume !(~n < 1); 11686#L8 assume ~n == 1;#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 ~n == 1;#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 !(~n == 1); 11442#L11 call #t~ret0 := fibo(~n - 1);< 11702#fiboENTRY ~n := #in~n; 11472#L6 assume !(~n < 1); 11441#L8 assume ~n == 1;#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 !(~n == 1); 11447#L11 call #t~ret0 := fibo(~n - 1);< 11703#fiboENTRY ~n := #in~n; 11751#L6 assume !(~n < 1); 11750#L8 assume !(~n == 1); 11709#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(~n == 1); 11708#L11 [2018-11-10 03:25:29,408 INFO L795 eck$LassoCheckResult]: Loop: 11708#L11 call #t~ret0 := fibo(~n - 1);< 11471#fiboENTRY ~n := #in~n; 11724#L6 assume !(~n < 1); 11722#L8 assume !(~n == 1); 11708#L11 [2018-11-10 03:25:29,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1797143672, now seen corresponding path program 4 times [2018-11-10 03:25:29,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:29,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:29,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:29,507 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-10 03:25:29,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:29,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:29,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:25:29,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:25:29,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:25:29,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:29,624 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-10 03:25:29,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:29,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 21 [2018-11-10 03:25:29,645 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:25:29,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 5 times [2018-11-10 03:25:29,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:29,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:29,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:29,680 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:29,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:29,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:29,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:29,681 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:29,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:29,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:29,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:29,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 03:25:29,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:29,681 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:29,682 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-10 03:25:29,685 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-10 03:25:29,686 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-10 03:25:29,695 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-10 03:25:29,718 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:29,718 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:29,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:29,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:29,725 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:29,725 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:29,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:29,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:29,747 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:25:29,747 INFO L446 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_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:29,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:29,768 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:29,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:29,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:30,790 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:30,792 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:30,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:30,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:30,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:30,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:30,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:30,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:30,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:30,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-11-10 03:25:30,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:30,792 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:30,793 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-10 03:25:30,794 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-10 03:25:30,795 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-10 03:25:30,796 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-10 03:25:30,852 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:30,852 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:30,853 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-10 03:25:30,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:30,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:30,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:30,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:30,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:30,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:30,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:30,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:30,855 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-10 03:25:30,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:30,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:30,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:30,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:30,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:30,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:30,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:30,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:30,857 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-10 03:25:30,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:30,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:30,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:30,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:30,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:30,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:30,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:30,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:25:30,859 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-10 03:25:30,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:30,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:30,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:30,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:30,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:30,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:30,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:30,869 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:30,870 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:30,870 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:30,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:30,871 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:30,871 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:30,871 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 03:25:30,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:30,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:30,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:30,999 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-10 03:25:31,000 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-10 03:25:31,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-10 03:25:31,039 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-10 03:25:31,040 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-10 03:25:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 03:25:31,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-10 03:25:31,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:31,041 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:31,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:31,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:31,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:31,158 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-10 03:25:31,158 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-10 03:25:31,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-10 03:25:31,208 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-10 03:25:31,209 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-10 03:25:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 03:25:31,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-10 03:25:31,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:31,209 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:31,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:31,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:31,343 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-10 03:25:31,343 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-10 03:25:31,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 463 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-11-10 03:25:31,418 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-10 03:25:31,419 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-10 03:25:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 03:25:31,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 4 letters. [2018-11-10 03:25:31,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:31,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 90 letters. Loop has 4 letters. [2018-11-10 03:25:31,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:31,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 86 letters. Loop has 8 letters. [2018-11-10 03:25:31,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:31,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 563 transitions. [2018-11-10 03:25:31,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:31,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 321 states and 463 transitions. [2018-11-10 03:25:31,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-10 03:25:31,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-10 03:25:31,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 463 transitions. [2018-11-10 03:25:31,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:31,437 INFO L705 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 03:25:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 463 transitions. [2018-11-10 03:25:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-11-10 03:25:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-10 03:25:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2018-11-10 03:25:31,447 INFO L728 BuchiCegarLoop]: Abstraction has 321 states and 463 transitions. [2018-11-10 03:25:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 03:25:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:25:31,448 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 21 states. [2018-11-10 03:25:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:31,947 INFO L93 Difference]: Finished difference Result 508 states and 782 transitions. [2018-11-10 03:25:31,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 03:25:31,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 782 transitions. [2018-11-10 03:25:31,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:31,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 504 states and 778 transitions. [2018-11-10 03:25:31,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-10 03:25:31,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-11-10 03:25:31,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 778 transitions. [2018-11-10 03:25:31,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:31,963 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 778 transitions. [2018-11-10 03:25:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 778 transitions. [2018-11-10 03:25:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 417. [2018-11-10 03:25:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-10 03:25:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-10 03:25:31,976 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 03:25:31,976 INFO L608 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 03:25:31,976 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:25:31,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 653 transitions. [2018-11-10 03:25:31,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:31,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:25:31,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:25:31,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2018-11-10 03:25:31,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:25:31,981 INFO L793 eck$LassoCheckResult]: Stem: 14876#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);< 14912#fiboENTRY ~n := #in~n; 14995#L6 assume !(~n < 1); 14993#L8 assume !(~n == 1); 14987#L11 call #t~ret0 := fibo(~n - 1);< 14990#fiboENTRY ~n := #in~n; 14991#L6 assume !(~n < 1); 14988#L8 assume !(~n == 1); 14926#L11 call #t~ret0 := fibo(~n - 1);< 14985#fiboENTRY ~n := #in~n; 14983#L6 assume !(~n < 1); 14981#L8 assume !(~n == 1); 14960#L11 call #t~ret0 := fibo(~n - 1);< 14977#fiboENTRY ~n := #in~n; 14976#L6 assume !(~n < 1); 14975#L8 assume !(~n == 1); 14940#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14956#L6 assume !(~n < 1); 14955#L8 assume !(~n == 1); 14941#L11 call #t~ret0 := fibo(~n - 1);< 14950#fiboENTRY ~n := #in~n; 14958#L6 assume !(~n < 1); 15199#L8 assume ~n == 1;#res := 1; 15198#fiboFINAL assume true; 15195#fiboEXIT >#33#return; 15191#L11-1 call #t~ret1 := fibo(~n - 2);< 15192#fiboENTRY ~n := #in~n; 15197#L6 assume ~n < 1;#res := 0; 15194#fiboFINAL assume true; 15190#fiboEXIT >#35#return; 15188#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15186#fiboFINAL assume true; 15160#fiboEXIT >#33#return; 15054#L11-1 call #t~ret1 := fibo(~n - 2);< 15058#fiboENTRY ~n := #in~n; 15201#L6 assume !(~n < 1); 15071#L8 assume ~n == 1;#res := 1; 15069#fiboFINAL assume true; 15053#fiboEXIT >#35#return; 15051#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15049#fiboFINAL assume true; 15025#fiboEXIT >#33#return; 15026#L11-1 call #t~ret1 := fibo(~n - 2);< 15078#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(~n == 1); 15075#L11 call #t~ret0 := fibo(~n - 1);< 15144#fiboENTRY ~n := #in~n; 15200#L6 assume !(~n < 1); 15147#L8 assume ~n == 1;#res := 1; 15146#fiboFINAL assume true; 15143#fiboEXIT >#33#return; 15041#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15067#L6 assume ~n < 1;#res := 0; 15050#fiboFINAL assume true; 15038#fiboEXIT >#35#return; 15044#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15142#fiboFINAL assume true; 15138#fiboEXIT >#35#return; 15136#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 14953#fiboFINAL assume true; 14948#fiboEXIT >#33#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14939#fiboENTRY ~n := #in~n; 14936#L6 assume !(~n < 1); 14938#L8 assume !(~n == 1); 14918#L11 call #t~ret0 := fibo(~n - 1);< 15151#fiboENTRY ~n := #in~n; 15178#L6 assume !(~n < 1); 15175#L8 assume !(~n == 1); 15171#L11 call #t~ret0 := fibo(~n - 1);< 15173#fiboENTRY ~n := #in~n; 15169#L6 assume !(~n < 1); 15176#L8 assume ~n == 1;#res := 1; 15174#fiboFINAL assume true; 15170#fiboEXIT >#33#return; 15155#L11-1 call #t~ret1 := fibo(~n - 2);< 14908#fiboENTRY ~n := #in~n; 15161#L6 assume ~n < 1;#res := 0; 15140#fiboFINAL assume true; 15154#fiboEXIT >#35#return; 15157#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15168#fiboFINAL assume true; 15150#fiboEXIT >#33#return; 15056#L11-1 call #t~ret1 := fibo(~n - 2);< 15059#fiboENTRY ~n := #in~n; 15163#L6 assume !(~n < 1); 15082#L8 assume ~n == 1;#res := 1; 14916#fiboFINAL assume true; 15055#fiboEXIT >#35#return; 15051#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15049#fiboFINAL assume true; 15025#fiboEXIT >#35#return; 15008#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 15006#fiboFINAL assume true; 15001#fiboEXIT >#33#return; 14944#L11-1 call #t~ret1 := fibo(~n - 2);< 14927#fiboENTRY ~n := #in~n; 15123#L6 assume !(~n < 1); 15072#L8 assume !(~n == 1); 15073#L11 call #t~ret0 := fibo(~n - 1);< 15202#fiboENTRY ~n := #in~n; 15203#L6 assume !(~n < 1); 15242#L8 assume !(~n == 1); 14883#L11 call #t~ret0 := fibo(~n - 1);< 14911#fiboENTRY ~n := #in~n; 14913#L6 assume !(~n < 1); 14881#L8 assume !(~n == 1); 14882#L11 [2018-11-10 03:25:31,981 INFO L795 eck$LassoCheckResult]: Loop: 14882#L11 call #t~ret0 := fibo(~n - 1);< 14911#fiboENTRY ~n := #in~n; 14913#L6 assume !(~n < 1); 14881#L8 assume !(~n == 1); 14882#L11 [2018-11-10 03:25:31,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1400596499, now seen corresponding path program 5 times [2018-11-10 03:25:31,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:31,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:31,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:31,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:32,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:32,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 6 times [2018-11-10 03:25:32,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:32,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:32,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:32,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:32,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:25:32,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 662415298, now seen corresponding path program 6 times [2018-11-10 03:25:32,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:25:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:25:32,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:32,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:25:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:25:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:32,217 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-10 03:25:32,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:25:32,217 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:32,225 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 03:25:32,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-10 03:25:32,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:25:32,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:32,348 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-10 03:25:32,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:25:32,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-11-10 03:25:32,397 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:32,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:32,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:32,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:32,398 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:25:32,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:32,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:32,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:32,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-10 03:25:32,398 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:32,398 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:32,399 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-10 03:25:32,406 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-10 03:25:32,407 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-10 03:25:32,409 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-10 03:25:32,437 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:32,437 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:32,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:25:32,441 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87363e2-09d1-4bf7-a757-f06371c1b416/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-10 03:25:32,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:25:32,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:25:34,832 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:25:34,833 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:25:34,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:25:34,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:25:34,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:25:34,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:25:34,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:25:34,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:25:34,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:25:34,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-11-10 03:25:34,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:25:34,834 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:25:34,834 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-10 03:25:34,840 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-10 03:25:34,842 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-10 03:25:34,844 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-10 03:25:34,867 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:25:34,867 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:25:34,868 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-10 03:25:34,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:25:34,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:25:34,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:25:34,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:25:34,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:25:34,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:25:34,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:25:34,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:25:34,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:25:34,872 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:25:34,873 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:25:34,873 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:25:34,873 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:25:34,873 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 03:25:34,873 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:25:34,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:34,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:35,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:35,026 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-10 03:25:35,027 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-10 03:25:35,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-10 03:25:35,064 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-10 03:25:35,065 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-10 03:25:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 03:25:35,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-10 03:25:35,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:35,066 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:35,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:35,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:35,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:35,291 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-10 03:25:35,292 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-10 03:25:35,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-10 03:25:35,403 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-10 03:25:35,404 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-10 03:25:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 03:25:35,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-10 03:25:35,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:35,404 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:25:35,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:25:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:35,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:25:35,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:25:35,545 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-10 03:25:35,545 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-10 03:25:35,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 653 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-11-10 03:25:35,598 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-10 03:25:35,599 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-10 03:25:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 03:25:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 03:25:35,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 4 letters. [2018-11-10 03:25:35,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:35,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 132 letters. Loop has 4 letters. [2018-11-10 03:25:35,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:35,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 128 letters. Loop has 8 letters. [2018-11-10 03:25:35,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:25:35,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 783 transitions. [2018-11-10 03:25:35,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:25:35,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 417 states and 653 transitions. [2018-11-10 03:25:35,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-10 03:25:35,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-11-10 03:25:35,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 653 transitions. [2018-11-10 03:25:35,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:25:35,611 INFO L705 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 03:25:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 653 transitions. [2018-11-10 03:25:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-10 03:25:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-10 03:25:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 653 transitions. [2018-11-10 03:25:35,622 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 653 transitions. [2018-11-10 03:25:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 03:25:35,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:25:35,622 INFO L87 Difference]: Start difference. First operand 417 states and 653 transitions. Second operand 25 states. [2018-11-10 03:25:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:25:36,092 INFO L93 Difference]: Finished difference Result 595 states and 922 transitions. [2018-11-10 03:25:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 03:25:36,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 922 transitions. [2018-11-10 03:25:36,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:25:36,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 0 states and 0 transitions. [2018-11-10 03:25:36,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:25:36,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:25:36,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:25:36,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:25:36,098 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:25:36,098 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:25:36,098 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:25:36,098 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:25:36,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:25:36,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:25:36,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:25:36,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:25:36 BoogieIcfgContainer [2018-11-10 03:25:36,105 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:25:36,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:25:36,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:25:36,106 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:25:36,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:25:16" (3/4) ... [2018-11-10 03:25:36,110 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:25:36,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:25:36,111 INFO L168 Benchmark]: Toolchain (without parser) took 20179.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -58.6 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:25:36,113 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:25:36,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:25:36,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.52 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:25:36,114 INFO L168 Benchmark]: Boogie Preprocessor took 12.74 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:25:36,114 INFO L168 Benchmark]: RCFGBuilder took 188.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:25:36,114 INFO L168 Benchmark]: BuchiAutomizer took 19756.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.0 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:25:36,115 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:25:36,118 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.52 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.74 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 188.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19756.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.0 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 19.7s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 13.3s. Construction of modules took 1.5s. Büchi inclusion checks took 4.3s. 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, 804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s 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: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...