./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-635dfa2 [2018-12-08 20:36:41,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:36:41,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:36:41,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:36:41,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:36:41,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:36:41,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:36:41,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:36:41,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:36:41,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:36:41,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:36:41,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:36:41,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:36:41,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:36:41,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:36:41,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:36:41,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:36:41,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:36:41,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:36:41,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:36:41,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:36:41,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:36:41,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:36:41,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:36:41,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:36:41,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:36:41,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:36:41,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:36:41,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:36:41,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:36:41,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:36:41,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:36:41,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:36:41,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:36:41,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:36:41,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:36:41,646 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 20:36:41,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:36:41,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:36:41,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:36:41,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:36:41,658 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:36:41,658 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 20:36:41,658 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 20:36:41,659 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 20:36:41,659 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 20:36:41,659 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 20:36:41,659 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 20:36:41,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:36:41,659 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:36:41,659 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:36:41,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 20:36:41,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 20:36:41,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:36:41,661 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 20:36:41,662 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 20:36:41,662 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_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:41,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:36:41,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:36:41,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:36:41,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:36:41,693 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:36:41,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-12-08 20:36:41,726 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/data/1ea057ec2/e82191290d4a42faa6a841e004f05d7c/FLAG2cdd4a9c2 [2018-12-08 20:36:42,120 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:36:42,121 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/sv-benchmarks/c/recursive-simple/fibo_10_true-unreach-call_true-termination.c [2018-12-08 20:36:42,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/data/1ea057ec2/e82191290d4a42faa6a841e004f05d7c/FLAG2cdd4a9c2 [2018-12-08 20:36:42,132 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/data/1ea057ec2/e82191290d4a42faa6a841e004f05d7c [2018-12-08 20:36:42,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:36:42,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:36:42,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:36:42,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:36:42,137 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:36:42,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42, skipping insertion in model container [2018-12-08 20:36:42,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:36:42,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:36:42,231 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:36:42,233 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:36:42,241 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:36:42,249 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:36:42,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42 WrapperNode [2018-12-08 20:36:42,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:36:42,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:36:42,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:36:42,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:36:42,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:36:42,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:36:42,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:36:42,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:36:42,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... [2018-12-08 20:36:42,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:36:42,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:36:42,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:36:42,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:36:42,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:36:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:36:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-12-08 20:36:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-12-08 20:36:42,416 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:36:42,416 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 20:36:42,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:36:42 BoogieIcfgContainer [2018-12-08 20:36:42,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:36:42,417 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 20:36:42,417 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 20:36:42,419 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 20:36:42,420 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:36:42,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:36:42" (1/3) ... [2018-12-08 20:36:42,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50681cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:36:42, skipping insertion in model container [2018-12-08 20:36:42,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:36:42,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:36:42" (2/3) ... [2018-12-08 20:36:42,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50681cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:36:42, skipping insertion in model container [2018-12-08 20:36:42,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:36:42,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:36:42" (3/3) ... [2018-12-08 20:36:42,422 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_10_true-unreach-call_true-termination.c [2018-12-08 20:36:42,456 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:36:42,456 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 20:36:42,456 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 20:36:42,456 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 20:36:42,457 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:36:42,457 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:36:42,457 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 20:36:42,457 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:36:42,457 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 20:36:42,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 20:36:42,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:36:42,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:42,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:42,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 20:36:42,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:42,486 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 20:36:42,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 20:36:42,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:36:42,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:42,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:42,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 20:36:42,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:42,493 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-12-08 20:36:42,493 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2018-12-08 20:36:42,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-12-08 20:36:42,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:42,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:42,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-12-08 20:36:42,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:42,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-12-08 20:36:42,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:42,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:42,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:42,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:42,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:42,630 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:42,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:42,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:42,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:42,631 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:42,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:42,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:42,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-12-08 20:36:42,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:42,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,698 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:42,699 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:42,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:42,709 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:42,709 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:42,728 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:42,730 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:42,730 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:42,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:42,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:42,746 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:42,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:42,764 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:42,764 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:42,779 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:42,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:42,811 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:42,812 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:42,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:42,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:42,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:42,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:42,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:42,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:42,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:42,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration1_Loop [2018-12-08 20:36:42,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:42,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:42,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:42,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:42,848 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:42,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:42,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:42,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:42,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:42,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:42,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:42,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:42,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:42,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:42,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-12-08 20:36:42,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:42,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:42,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:42,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:42,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:42,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:42,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:42,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:42,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-12-08 20:36:42,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:42,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:42,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:42,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:42,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:42,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:42,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:42,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:42,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:42,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:42,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:42,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:42,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:42,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:42,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:42,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:42,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:42,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:42,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:42,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:42,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:42,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:42,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:42,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:42,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:42,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:42,869 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:42,869 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:42,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:42,870 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:42,870 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:42,870 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-12-08 20:36:42,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:42,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:42,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:42,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:42,942 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-12-08 20:36:42,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-12-08 20:36:43,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-12-08 20:36:43,013 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-12-08 20:36:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 20:36:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 20:36:43,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-08 20:36:43,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:43,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-08 20:36:43,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:43,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-08 20:36:43,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:43,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-12-08 20:36:43,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:36:43,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-12-08 20:36:43,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 20:36:43,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-08 20:36:43,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-12-08 20:36:43,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:43,026 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 20:36:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-12-08 20:36:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-08 20:36:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-08 20:36:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-08 20:36:43,043 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-08 20:36:43,043 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-08 20:36:43,043 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 20:36:43,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-12-08 20:36:43,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:36:43,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:43,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:43,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:43,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:43,045 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2018-12-08 20:36:43,045 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2018-12-08 20:36:43,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-12-08 20:36:43,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:43,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:36:43,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:36:43,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:36:43,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:43,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-12-08 20:36:43,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:43,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:36:43,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:36:43,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:36:43,114 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 20:36:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:36:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:36:43,117 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-08 20:36:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:43,166 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-08 20:36:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:36:43,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-12-08 20:36:43,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:36:43,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-12-08 20:36:43,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 20:36:43,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-08 20:36:43,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-12-08 20:36:43,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:43,170 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 20:36:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-12-08 20:36:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 20:36:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 20:36:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-08 20:36:43,173 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 20:36:43,173 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 20:36:43,174 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 20:36:43,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-08 20:36:43,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:36:43,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:43,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:43,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:43,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:43,176 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2018-12-08 20:36:43,176 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2018-12-08 20:36:43,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-12-08 20:36:43,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:43,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:43,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:43,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:43,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:43,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:43,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:43,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:43,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 20:36:43,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:43,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-12-08 20:36:43,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:43,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:43,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:43,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:43,316 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:43,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:43,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:43,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:43,316 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:43,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:43,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:43,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:43,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-12-08 20:36:43,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:43,316 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:43,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:43,347 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:43,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:43,349 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:43,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:43,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:43,854 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:43,856 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:43,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:43,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:43,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:43,856 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:43,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:43,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:43,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:43,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration3_Loop [2018-12-08 20:36:43,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:43,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:43,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:43,890 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:43,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:43,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:43,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:43,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:43,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:43,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:43,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:43,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:43,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:43,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:43,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:43,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:43,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:43,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:43,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:43,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:43,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:43,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:43,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:43,902 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:43,903 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:43,903 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:43,903 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:43,903 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:43,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 20:36:43,903 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:43,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:43,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:43,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:43,982 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-12-08 20:36:43,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-12-08 20:36:44,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-12-08 20:36:44,082 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-12-08 20:36:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 20:36:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-08 20:36:44,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-08 20:36:44,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:44,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-12-08 20:36:44,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:44,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-12-08 20:36:44,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:44,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-12-08 20:36:44,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 20:36:44,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-12-08 20:36:44,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-12-08 20:36:44,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-08 20:36:44,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-12-08 20:36:44,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:44,091 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-12-08 20:36:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-12-08 20:36:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-12-08 20:36:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 20:36:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-12-08 20:36:44,099 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-12-08 20:36:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:36:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:36:44,099 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-12-08 20:36:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:44,146 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-12-08 20:36:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:36:44,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-12-08 20:36:44,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 20:36:44,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-12-08 20:36:44,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-08 20:36:44,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-08 20:36:44,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-12-08 20:36:44,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:44,151 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-12-08 20:36:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-12-08 20:36:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-08 20:36:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 20:36:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-08 20:36:44,156 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-08 20:36:44,156 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-08 20:36:44,156 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 20:36:44,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-12-08 20:36:44,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 20:36:44,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:44,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:44,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:44,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:44,158 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-12-08 20:36:44,158 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2018-12-08 20:36:44,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-12-08 20:36:44,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:44,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:44,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:44,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 20:36:44,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:44,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:44,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:44,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 20:36:44,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:44,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-08 20:36:44,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:44,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-12-08 20:36:44,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:44,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:44,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:44,305 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:44,305 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:44,305 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:44,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:44,305 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:44,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:44,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:44,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:44,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-12-08 20:36:44,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:44,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:44,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:44,342 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:44,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:44,343 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:44,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:44,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:44,845 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:44,846 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:44,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:44,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:44,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:44,847 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:44,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:44,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:44,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:44,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration4_Loop [2018-12-08 20:36:44,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:44,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:44,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:44,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:44,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:44,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:44,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:44,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:44,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:44,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:44,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:44,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:44,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:44,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:44,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:44,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:44,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:44,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:44,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:44,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:44,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:44,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:44,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:44,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:44,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:44,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:44,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:44,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:44,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:44,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:44,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:44,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:44,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:44,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:44,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:44,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:44,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:44,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:44,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:44,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:44,906 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:44,907 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:44,907 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:44,907 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:44,907 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:44,907 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:44,908 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 20:36:44,908 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:44,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:44,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:44,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:44,983 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-12-08 20:36:44,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-08 20:36:45,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-12-08 20:36:45,065 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-12-08 20:36:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 20:36:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-08 20:36:45,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-08 20:36:45,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:45,066 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:45,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:45,133 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-12-08 20:36:45,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-08 20:36:45,210 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-12-08 20:36:45,210 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-12-08 20:36:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 20:36:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-08 20:36:45,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-08 20:36:45,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:45,211 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:45,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:45,281 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-12-08 20:36:45,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-08 20:36:45,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-12-08 20:36:45,381 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-12-08 20:36:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 20:36:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-12-08 20:36:45,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-08 20:36:45,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:45,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-12-08 20:36:45,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:45,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-12-08 20:36:45,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:45,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-12-08 20:36:45,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-08 20:36:45,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-12-08 20:36:45,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-12-08 20:36:45,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-12-08 20:36:45,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-12-08 20:36:45,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:45,395 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-12-08 20:36:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-12-08 20:36:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-12-08 20:36:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-08 20:36:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-12-08 20:36:45,413 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-12-08 20:36:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:36:45,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:36:45,413 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-12-08 20:36:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:45,526 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-12-08 20:36:45,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:36:45,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-12-08 20:36:45,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-08 20:36:45,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-12-08 20:36:45,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-12-08 20:36:45,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-12-08 20:36:45,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-12-08 20:36:45,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:45,540 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-12-08 20:36:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-12-08 20:36:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-12-08 20:36:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-08 20:36:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-12-08 20:36:45,562 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-08 20:36:45,562 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-08 20:36:45,562 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 20:36:45,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-12-08 20:36:45,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-08 20:36:45,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:45,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:45,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:45,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:45,565 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3588#fiboENTRY ~n := #in~n; 3605#L6 assume !(~n < 1); 3604#L8 assume !(1 == ~n); 3599#L11 call #t~ret0 := fibo(~n - 1);< 3603#fiboENTRY ~n := #in~n; 3601#L6 assume !(~n < 1); 3602#L8 assume !(1 == ~n); 3557#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3600#L8 assume !(1 == ~n); 3556#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3597#L6 assume !(~n < 1); 3555#L8 assume 1 == ~n;#res := 1; 3558#fiboFINAL assume true; 3677#fiboEXIT >#32#return; 3622#L11-1 call #t~ret1 := fibo(~n - 2);< 3623#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3660#L8 assume !(1 == ~n); 3662#L11 call #t~ret0 := fibo(~n - 1);< 3873#fiboENTRY ~n := #in~n; 3888#L6 assume !(~n < 1); 3886#L8 assume !(1 == ~n); 3594#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-12-08 20:36:45,565 INFO L796 eck$LassoCheckResult]: Loop: 3591#fiboENTRY ~n := #in~n; 3595#L6 assume !(~n < 1); 3615#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3591#fiboENTRY [2018-12-08 20:36:45,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-12-08 20:36:45,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:45,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 20:36:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:45,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 20:36:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:45,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-08 20:36:45,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:45,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-12-08 20:36:45,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:45,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:36:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:45,743 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:45,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:45,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:45,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:45,743 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:45,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:45,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:45,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:45,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-12-08 20:36:45,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:45,743 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:45,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,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-12-08 20:36:45,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-12-08 20:36:45,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:45,764 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:45,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:45,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:45,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:45,769 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:45,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:45,784 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:45,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:45,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:45,815 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:45,816 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:45,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:45,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:45,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:45,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:45,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:45,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:45,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:45,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration5_Loop [2018-12-08 20:36:45,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:45,817 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:45,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:45,860 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:45,861 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:45,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:45,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:45,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:45,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:45,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:45,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:45,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:45,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:45,863 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:45,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:45,864 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:45,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:45,865 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:45,865 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:45,865 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-12-08 20:36:45,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:45,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:45,916 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-12-08 20:36:45,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-08 20:36:45,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-08 20:36:45,956 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-12-08 20:36:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 20:36:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-08 20:36:45,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 20:36:45,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:45,956 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:45,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:45,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:46,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:46,016 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-12-08 20:36:46,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-08 20:36:46,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-08 20:36:46,056 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-12-08 20:36:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 20:36:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-08 20:36:46,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 20:36:46,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:46,057 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:46,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:46,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:46,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:46,121 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-12-08 20:36:46,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-08 20:36:46,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-12-08 20:36:46,165 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-12-08 20:36:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 20:36:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-08 20:36:46,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 20:36:46,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:46,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-08 20:36:46,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:46,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-12-08 20:36:46,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:46,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-12-08 20:36:46,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-08 20:36:46,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-12-08 20:36:46,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-12-08 20:36:46,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-12-08 20:36:46,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-12-08 20:36:46,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:46,177 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-12-08 20:36:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-12-08 20:36:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-12-08 20:36:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-08 20:36:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-12-08 20:36:46,190 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-12-08 20:36:46,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:36:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:36:46,190 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-12-08 20:36:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:46,360 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-12-08 20:36:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:36:46,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-12-08 20:36:46,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:46,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-12-08 20:36:46,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-12-08 20:36:46,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-12-08 20:36:46,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-12-08 20:36:46,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:46,365 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-12-08 20:36:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-12-08 20:36:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-12-08 20:36:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-08 20:36:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-08 20:36:46,369 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-08 20:36:46,369 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-08 20:36:46,369 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 20:36:46,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-12-08 20:36:46,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:46,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:46,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:46,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 20:36:46,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:46,371 INFO L794 eck$LassoCheckResult]: Stem: 6303#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 6304#L25 call main_#t~ret2 := fibo(main_~x~0);< 6333#fiboENTRY ~n := #in~n; 6400#L6 assume !(~n < 1); 6399#L8 assume !(1 == ~n); 6395#L11 call #t~ret0 := fibo(~n - 1);< 6398#fiboENTRY ~n := #in~n; 6397#L6 assume !(~n < 1); 6396#L8 assume !(1 == ~n); 6390#L11 call #t~ret0 := fibo(~n - 1);< 6394#fiboENTRY ~n := #in~n; 6392#L6 assume !(~n < 1); 6393#L8 assume !(1 == ~n); 6323#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6389#L6 assume !(~n < 1); 6391#L8 assume !(1 == ~n); 6324#L11 call #t~ret0 := fibo(~n - 1);< 6388#fiboENTRY ~n := #in~n; 6384#L6 assume !(~n < 1); 6385#L8 assume 1 == ~n;#res := 1; 6497#fiboFINAL assume true; 6496#fiboEXIT >#32#return; 6298#L11-1 call #t~ret1 := fibo(~n - 2);< 6318#fiboENTRY ~n := #in~n; 6319#L6 assume ~n < 1;#res := 0; 6499#fiboFINAL assume true; 6297#fiboEXIT >#34#return; 6299#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6471#fiboFINAL assume true; 6470#fiboEXIT >#32#return; 6330#L11-1 call #t~ret1 := fibo(~n - 2);< 6401#fiboENTRY ~n := #in~n; 6404#L6 assume !(~n < 1); 6484#L8 assume !(1 == ~n); 6306#L11 call #t~ret0 := fibo(~n - 1);< 6327#fiboENTRY ~n := #in~n; 6380#L6 assume !(~n < 1); 6370#L8 assume !(1 == ~n); 6352#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-12-08 20:36:46,371 INFO L796 eck$LassoCheckResult]: Loop: 6350#L11 call #t~ret0 := fibo(~n - 1);< 6353#fiboENTRY ~n := #in~n; 6367#L6 assume !(~n < 1); 6365#L8 assume !(1 == ~n); 6350#L11 [2018-12-08 20:36:46,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1642551253, now seen corresponding path program 2 times [2018-12-08 20:36:46,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:46,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:46,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-08 20:36:46,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:46,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:36:46,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 20:36:46,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 20:36:46,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:36:46,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 20:36:46,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:46,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-12-08 20:36:46,534 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:46,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 3 times [2018-12-08 20:36:46,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:46,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:46,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:46,556 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:46,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:46,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:46,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:46,556 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:46,556 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:46,556 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:46,556 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:46,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-12-08 20:36:46,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:46,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:46,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:46,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:46,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:46,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:46,585 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:46,585 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:46,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:46,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:46,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:46,590 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:46,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:46,604 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:46,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:46,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:51,952 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:51,954 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:51,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:51,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:51,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:51,954 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:51,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:51,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:51,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:51,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration6_Loop [2018-12-08 20:36:51,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:51,955 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:51,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:51,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:51,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:51,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:51,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:51,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:51,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:51,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:51,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:51,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:51,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:51,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:51,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:51,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:51,986 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:51,988 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:51,988 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:51,988 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:51,988 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:51,988 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:51,988 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 20:36:51,988 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:51,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:52,056 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-12-08 20:36:52,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-08 20:36:52,085 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-12-08 20:36:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 20:36:52,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-08 20:36:52,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:52,086 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:52,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:52,163 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-12-08 20:36:52,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-08 20:36:52,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-12-08 20:36:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 20:36:52,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-08 20:36:52,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:52,204 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:52,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:52,282 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-12-08 20:36:52,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-08 20:36:52,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-12-08 20:36:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 20:36:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-08 20:36:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-12-08 20:36:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:52,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-12-08 20:36:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:52,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-12-08 20:36:52,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:52,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-12-08 20:36:52,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-12-08 20:36:52,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-12-08 20:36:52,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-12-08 20:36:52,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:52,321 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-12-08 20:36:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-12-08 20:36:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-12-08 20:36:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-08 20:36:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-08 20:36:52,324 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-08 20:36:52,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 20:36:52,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:36:52,325 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-12-08 20:36:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:52,506 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-12-08 20:36:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 20:36:52,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-12-08 20:36:52,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:52,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-12-08 20:36:52,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-12-08 20:36:52,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-12-08 20:36:52,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-12-08 20:36:52,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:52,510 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-12-08 20:36:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-12-08 20:36:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-12-08 20:36:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-08 20:36:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-08 20:36:52,515 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-08 20:36:52,515 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-08 20:36:52,515 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 20:36:52,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-12-08 20:36:52,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:52,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:52,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:52,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-08 20:36:52,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:52,517 INFO L794 eck$LassoCheckResult]: Stem: 8505#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 8506#L25 call main_#t~ret2 := fibo(main_~x~0);< 8545#fiboENTRY ~n := #in~n; 8605#L6 assume !(~n < 1); 8603#L8 assume !(1 == ~n); 8600#L11 call #t~ret0 := fibo(~n - 1);< 8601#fiboENTRY ~n := #in~n; 8616#L6 assume !(~n < 1); 8614#L8 assume !(1 == ~n); 8610#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8668#L6 assume !(~n < 1); 8665#L8 assume !(1 == ~n); 8607#L11 call #t~ret0 := fibo(~n - 1);< 8611#fiboENTRY ~n := #in~n; 8629#L6 assume !(~n < 1); 8626#L8 assume !(1 == ~n); 8532#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8725#L6 assume !(~n < 1); 8723#L8 assume !(1 == ~n); 8533#L11 call #t~ret0 := fibo(~n - 1);< 8539#fiboENTRY ~n := #in~n; 8727#L6 assume !(~n < 1); 8772#L8 assume 1 == ~n;#res := 1; 8771#fiboFINAL assume true; 8770#fiboEXIT >#32#return; 8531#L11-1 call #t~ret1 := fibo(~n - 2);< 8534#fiboENTRY ~n := #in~n; 8766#L6 assume ~n < 1;#res := 0; 8765#fiboFINAL assume true; 8760#fiboEXIT >#34#return; 8758#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fiboFINAL assume true; 8750#fiboEXIT >#32#return; 8740#L11-1 call #t~ret1 := fibo(~n - 2);< 8743#fiboENTRY ~n := #in~n; 8769#L6 assume !(~n < 1); 8768#L8 assume 1 == ~n;#res := 1; 8550#fiboFINAL assume true; 8739#fiboEXIT >#34#return; 8737#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8735#fiboFINAL assume true; 8733#fiboEXIT >#32#return; 8549#L11-1 call #t~ret1 := fibo(~n - 2);< 8621#fiboENTRY ~n := #in~n; 8557#L6 assume !(~n < 1); 8546#L8 assume !(1 == ~n); 8496#L11 call #t~ret0 := fibo(~n - 1);< 8528#fiboENTRY ~n := #in~n; 8529#L6 assume !(~n < 1); 8513#L8 assume !(1 == ~n); 8514#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-12-08 20:36:52,517 INFO L796 eck$LassoCheckResult]: Loop: 8560#L11 call #t~ret0 := fibo(~n - 1);< 8562#fiboENTRY ~n := #in~n; 8580#L6 assume !(~n < 1); 8579#L8 assume !(1 == ~n); 8560#L11 [2018-12-08 20:36:52,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 973756610, now seen corresponding path program 3 times [2018-12-08 20:36:52,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:52,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:52,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-08 20:36:52,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:52,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:52,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:36:52,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-08 20:36:52,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:36:52,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-08 20:36:52,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:52,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-08 20:36:52,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:52,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 4 times [2018-12-08 20:36:52,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:52,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:52,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:52,630 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:52,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:52,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:52,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:52,630 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:52,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:52,630 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:52,630 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:52,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-12-08 20:36:52,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:52,630 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:52,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:52,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:52,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:52,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:52,665 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:52,665 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:52,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:52,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:52,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:52,669 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:52,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:52,694 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:52,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:52,715 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:53,506 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:53,508 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:53,508 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:53,508 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:53,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:53,508 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:53,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:53,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:53,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:53,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration7_Loop [2018-12-08 20:36:53,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:53,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:53,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:53,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:53,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:53,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:53,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:53,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:53,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:53,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:53,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:53,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:53,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:53,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:53,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:53,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:53,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:53,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:53,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:53,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:53,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:53,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:53,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:53,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:53,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:53,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:53,549 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:53,549 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:53,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:53,549 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:53,549 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:53,549 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 20:36:53,549 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:53,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:53,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:53,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:53,624 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-12-08 20:36:53,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-08 20:36:53,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-12-08 20:36:53,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 20:36:53,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-08 20:36:53,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:53,653 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:53,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:53,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:53,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:53,742 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-12-08 20:36:53,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-08 20:36:53,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-12-08 20:36:53,792 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-12-08 20:36:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 20:36:53,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-08 20:36:53,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:53,793 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:53,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:53,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:53,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:53,876 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-12-08 20:36:53,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-08 20:36:53,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-12-08 20:36:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 20:36:53,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-08 20:36:53,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:53,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-12-08 20:36:53,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:53,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-08 20:36:53,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:53,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-12-08 20:36:53,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:53,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-12-08 20:36:53,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-08 20:36:53,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-12-08 20:36:53,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-12-08 20:36:53,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:53,926 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-12-08 20:36:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-12-08 20:36:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-12-08 20:36:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-08 20:36:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-08 20:36:53,930 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-08 20:36:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:36:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:36:53,931 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 11 states. [2018-12-08 20:36:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:54,021 INFO L93 Difference]: Finished difference Result 399 states and 573 transitions. [2018-12-08 20:36:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:36:54,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 573 transitions. [2018-12-08 20:36:54,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:54,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 377 states and 547 transitions. [2018-12-08 20:36:54,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2018-12-08 20:36:54,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-12-08 20:36:54,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 547 transitions. [2018-12-08 20:36:54,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:54,027 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 547 transitions. [2018-12-08 20:36:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 547 transitions. [2018-12-08 20:36:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2018-12-08 20:36:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 20:36:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-12-08 20:36:54,034 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 20:36:54,034 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 20:36:54,034 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 20:36:54,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 462 transitions. [2018-12-08 20:36:54,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:54,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:54,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:54,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 12, 11, 9, 5, 5, 4, 4, 3, 2, 1, 1] [2018-12-08 20:36:54,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:54,037 INFO L794 eck$LassoCheckResult]: Stem: 11349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 11350#L25 call main_#t~ret2 := fibo(main_~x~0);< 11387#fiboENTRY ~n := #in~n; 11464#L6 assume !(~n < 1); 11462#L8 assume !(1 == ~n); 11459#L11 call #t~ret0 := fibo(~n - 1);< 11460#fiboENTRY ~n := #in~n; 11474#L6 assume !(~n < 1); 11472#L8 assume !(1 == ~n); 11469#L11 call #t~ret0 := fibo(~n - 1);< 11470#fiboENTRY ~n := #in~n; 11482#L6 assume !(~n < 1); 11481#L8 assume !(1 == ~n); 11466#L11 call #t~ret0 := fibo(~n - 1);< 11480#fiboENTRY ~n := #in~n; 11489#L6 assume !(~n < 1); 11486#L8 assume !(1 == ~n); 11406#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11490#L6 assume !(~n < 1); 11487#L8 assume !(1 == ~n); 11405#L11 call #t~ret0 := fibo(~n - 1);< 11484#fiboENTRY ~n := #in~n; 11493#L6 assume !(~n < 1); 11611#L8 assume 1 == ~n;#res := 1; 11610#fiboFINAL assume true; 11608#fiboEXIT >#32#return; 11605#L11-1 call #t~ret1 := fibo(~n - 2);< 11606#fiboENTRY ~n := #in~n; 11609#L6 assume ~n < 1;#res := 0; 11607#fiboFINAL assume true; 11604#fiboEXIT >#34#return; 11602#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11601#fiboFINAL assume true; 11599#fiboEXIT >#32#return; 11578#L11-1 call #t~ret1 := fibo(~n - 2);< 11580#fiboENTRY ~n := #in~n; 11595#L6 assume !(~n < 1); 11594#L8 assume 1 == ~n;#res := 1; 11492#fiboFINAL assume true; 11577#fiboEXIT >#34#return; 11574#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11563#fiboFINAL assume true; 11558#fiboEXIT >#32#return; 11559#L11-1 call #t~ret1 := fibo(~n - 2);< 11562#fiboENTRY ~n := #in~n; 11596#L6 assume !(~n < 1); 11592#L8 assume !(1 == ~n); 11593#L11 call #t~ret0 := fibo(~n - 1);< 11619#fiboENTRY ~n := #in~n; 11622#L6 assume !(~n < 1); 11621#L8 assume 1 == ~n;#res := 1; 11620#fiboFINAL assume true; 11617#fiboEXIT >#32#return; 11569#L11-1 call #t~ret1 := fibo(~n - 2);< 11571#fiboENTRY ~n := #in~n; 11582#L6 assume ~n < 1;#res := 0; 11581#fiboFINAL assume true; 11568#fiboEXIT >#34#return; 11567#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11565#fiboFINAL assume true; 11560#fiboEXIT >#34#return; 11478#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11485#fiboFINAL assume true; 11475#fiboEXIT >#32#return; 11397#L11-1 call #t~ret1 := fibo(~n - 2);< 11402#fiboENTRY ~n := #in~n; 11395#L6 assume !(~n < 1); 11399#L8 assume !(1 == ~n); 11357#L11 call #t~ret0 := fibo(~n - 1);< 11618#fiboENTRY ~n := #in~n; 11623#L6 assume !(~n < 1); 11354#L8 assume !(1 == ~n); 11358#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-12-08 20:36:54,037 INFO L796 eck$LassoCheckResult]: Loop: 11630#L11 call #t~ret0 := fibo(~n - 1);< 11383#fiboENTRY ~n := #in~n; 11660#L6 assume !(~n < 1); 11652#L8 assume !(1 == ~n); 11630#L11 [2018-12-08 20:36:54,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash -789040214, now seen corresponding path program 4 times [2018-12-08 20:36:54,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:54,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:54,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:54,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 202 proven. 76 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-08 20:36:54,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:54,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 20:36:54,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 20:36:54,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:36:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 159 proven. 267 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-08 20:36:54,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:54,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2018-12-08 20:36:54,227 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:36:54,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 5 times [2018-12-08 20:36:54,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:54,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:54,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:54,249 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:54,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:54,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:54,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:54,249 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:54,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:54,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:54,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:54,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-12-08 20:36:54,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:54,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:54,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-12-08 20:36:54,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:54,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:54,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:54,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:54,280 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:54,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:54,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:54,283 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:54,284 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:54,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:54,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:54,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:36:54,300 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:54,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:54,314 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:54,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:54,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:36:55,018 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:36:55,020 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:55,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:55,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:55,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:55,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:36:55,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:55,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:55,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:55,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration8_Loop [2018-12-08 20:36:55,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:55,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:55,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:55,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:55,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:55,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:55,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:55,046 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:36:55,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-12-08 20:36:55,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:55,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:55,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:55,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:55,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:55,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:55,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:55,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:55,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:55,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:55,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:55,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:55,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:55,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:55,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:55,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:55,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:55,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:36:55,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:55,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:55,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:55,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:55,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:55,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:55,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:55,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:36:55,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-12-08 20:36:55,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:36:55,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:36:55,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:36:55,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:36:55,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:36:55,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:36:55,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:36:55,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:36:55,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:36:55,053 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:36:55,053 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:36:55,053 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:36:55,053 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:36:55,053 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 20:36:55,053 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:36:55,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:55,163 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-12-08 20:36:55,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-12-08 20:36:55,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 335 states and 478 transitions. Complement of second has 18 states. [2018-12-08 20:36:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 20:36:55,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 89 letters. Loop has 4 letters. [2018-12-08 20:36:55,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:55,191 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:55,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:55,274 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-12-08 20:36:55,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-12-08 20:36:55,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 341 states and 484 transitions. Complement of second has 17 states. [2018-12-08 20:36:55,311 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-12-08 20:36:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 20:36:55,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 89 letters. Loop has 4 letters. [2018-12-08 20:36:55,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:55,312 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:36:55,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:36:55,410 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-12-08 20:36:55,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146 Second operand 6 states. [2018-12-08 20:36:55,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 462 transitions. cyclomatic complexity: 146. Second operand 6 states. Result 398 states and 562 transitions. Complement of second has 27 states. [2018-12-08 20:36:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:36:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:36:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 20:36:55,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 4 letters. [2018-12-08 20:36:55,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:55,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 93 letters. Loop has 4 letters. [2018-12-08 20:36:55,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:55,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 89 letters. Loop has 8 letters. [2018-12-08 20:36:55,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:36:55,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 562 transitions. [2018-12-08 20:36:55,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:55,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 320 states and 462 transitions. [2018-12-08 20:36:55,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-12-08 20:36:55,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2018-12-08 20:36:55,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 462 transitions. [2018-12-08 20:36:55,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:55,455 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 20:36:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 462 transitions. [2018-12-08 20:36:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-08 20:36:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 20:36:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 462 transitions. [2018-12-08 20:36:55,461 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 462 transitions. [2018-12-08 20:36:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-08 20:36:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-08 20:36:55,461 INFO L87 Difference]: Start difference. First operand 320 states and 462 transitions. Second operand 23 states. [2018-12-08 20:36:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:36:55,768 INFO L93 Difference]: Finished difference Result 561 states and 861 transitions. [2018-12-08 20:36:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 20:36:55,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 861 transitions. [2018-12-08 20:36:55,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:55,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 547 states and 842 transitions. [2018-12-08 20:36:55,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-12-08 20:36:55,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2018-12-08 20:36:55,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 842 transitions. [2018-12-08 20:36:55,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:36:55,775 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 842 transitions. [2018-12-08 20:36:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 842 transitions. [2018-12-08 20:36:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2018-12-08 20:36:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-08 20:36:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-12-08 20:36:55,783 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-12-08 20:36:55,783 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-12-08 20:36:55,783 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 20:36:55,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 678 transitions. [2018-12-08 20:36:55,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:36:55,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:36:55,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:36:55,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 20, 15, 15, 14, 8, 8, 7, 7, 5, 3, 1, 1] [2018-12-08 20:36:55,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 20:36:55,786 INFO L794 eck$LassoCheckResult]: Stem: 14872#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 10; 14873#L25 call main_#t~ret2 := fibo(main_~x~0);< 14905#fiboENTRY ~n := #in~n; 15099#L6 assume !(~n < 1); 15095#L8 assume !(1 == ~n); 15070#L11 call #t~ret0 := fibo(~n - 1);< 15090#fiboENTRY ~n := #in~n; 15077#L6 assume !(~n < 1); 15074#L8 assume !(1 == ~n); 15059#L11 call #t~ret0 := fibo(~n - 1);< 15066#fiboENTRY ~n := #in~n; 15064#L6 assume !(~n < 1); 15062#L8 assume !(1 == ~n); 15054#L11 call #t~ret0 := fibo(~n - 1);< 15058#fiboENTRY ~n := #in~n; 15057#L6 assume !(~n < 1); 15055#L8 assume !(1 == ~n); 14953#L11 call #t~ret0 := fibo(~n - 1);< 14982#fiboENTRY ~n := #in~n; 14979#L6 assume !(~n < 1); 14976#L8 assume !(1 == ~n); 14932#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14957#L6 assume !(~n < 1); 14955#L8 assume !(1 == ~n); 14933#L11 call #t~ret0 := fibo(~n - 1);< 14945#fiboENTRY ~n := #in~n; 14959#L6 assume !(~n < 1); 15218#L8 assume 1 == ~n;#res := 1; 15217#fiboFINAL assume true; 15216#fiboEXIT >#32#return; 15214#L11-1 call #t~ret1 := fibo(~n - 2);< 15215#fiboENTRY ~n := #in~n; 15227#L6 assume ~n < 1;#res := 0; 15224#fiboFINAL assume true; 15213#fiboEXIT >#34#return; 15211#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15209#fiboFINAL assume true; 15208#fiboEXIT >#32#return; 15044#L11-1 call #t~ret1 := fibo(~n - 2);< 15046#fiboENTRY ~n := #in~n; 15234#L6 assume !(~n < 1); 15053#L8 assume 1 == ~n;#res := 1; 14924#fiboFINAL assume true; 15043#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15027#fiboFINAL assume true; 15012#fiboEXIT >#32#return; 14986#L11-1 call #t~ret1 := fibo(~n - 2);< 14988#fiboENTRY ~n := #in~n; 15056#L6 assume !(~n < 1); 15052#L8 assume !(1 == ~n); 15022#L11 call #t~ret0 := fibo(~n - 1);< 15228#fiboENTRY ~n := #in~n; 15206#L6 assume !(~n < 1); 15047#L8 assume 1 == ~n;#res := 1; 15036#fiboFINAL assume true; 15019#fiboEXIT >#32#return; 14996#L11-1 call #t~ret1 := fibo(~n - 2);< 15001#fiboENTRY ~n := #in~n; 15035#L6 assume ~n < 1;#res := 0; 15018#fiboFINAL assume true; 14993#fiboEXIT >#34#return; 14992#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14990#fiboFINAL assume true; 14985#fiboEXIT >#34#return; 14980#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 14950#fiboFINAL assume true; 14942#fiboEXIT >#32#return; 14923#L11-1 call #t~ret1 := fibo(~n - 2);< 14934#fiboENTRY ~n := #in~n; 14928#L6 assume !(~n < 1); 14922#L8 assume !(1 == ~n); 14925#L11 call #t~ret0 := fibo(~n - 1);< 15197#fiboENTRY ~n := #in~n; 15196#L6 assume !(~n < 1); 15195#L8 assume !(1 == ~n); 15189#L11 call #t~ret0 := fibo(~n - 1);< 15191#fiboENTRY ~n := #in~n; 15148#L6 assume !(~n < 1); 15199#L8 assume 1 == ~n;#res := 1; 15194#fiboFINAL assume true; 15188#fiboEXIT >#32#return; 15181#L11-1 call #t~ret1 := fibo(~n - 2);< 15187#fiboENTRY ~n := #in~n; 15198#L6 assume ~n < 1;#res := 0; 15142#fiboFINAL assume true; 15179#fiboEXIT >#34#return; 15185#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15204#fiboFINAL assume true; 15203#fiboEXIT >#32#return; 15042#L11-1 call #t~ret1 := fibo(~n - 2);< 15045#fiboENTRY ~n := #in~n; 15232#L6 assume !(~n < 1); 15048#L8 assume 1 == ~n;#res := 1; 15038#fiboFINAL assume true; 15041#fiboEXIT >#34#return; 15028#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15027#fiboFINAL assume true; 15012#fiboEXIT >#34#return; 14944#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15221#fiboFINAL assume true; 15013#fiboEXIT >#32#return; 14937#L11-1 call #t~ret1 := fibo(~n - 2);< 14954#fiboENTRY ~n := #in~n; 15146#L6 assume !(~n < 1); 14977#L8 assume !(1 == ~n); 14978#L11 call #t~ret0 := fibo(~n - 1);< 15024#fiboENTRY ~n := #in~n; 15229#L6 assume !(~n < 1); 15266#L8 assume !(1 == ~n); 14882#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2018-12-08 20:36:55,786 INFO L796 eck$LassoCheckResult]: Loop: 14883#L11 call #t~ret0 := fibo(~n - 1);< 15241#fiboENTRY ~n := #in~n; 15257#L6 assume !(~n < 1); 15252#L8 assume !(1 == ~n); 14883#L11 [2018-12-08 20:36:55,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 79280042, now seen corresponding path program 5 times [2018-12-08 20:36:55,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:55,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:55,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:55,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1863062, now seen corresponding path program 6 times [2018-12-08 20:36:55,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:55,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:36:55,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:36:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 477112511, now seen corresponding path program 6 times [2018-12-08 20:36:55,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:36:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:36:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:55,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:36:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:36:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:36:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 332 proven. 245 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-12-08 20:36:55,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:36:55,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:36:55,993 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-08 20:36:56,024 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-08 20:36:56,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:36:56,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:36:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 349 proven. 258 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-12-08 20:36:56,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:36:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 24 [2018-12-08 20:36:56,120 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:36:56,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:36:56,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:36:56,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:36:56,120 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:36:56,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:36:56,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:36:56,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:36:56,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-12-08 20:36:56,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:36:56,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:36:56,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:56,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:56,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:56,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:36:56,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:36:56,147 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:56,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:36:56,149 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f621e83a-80ce-4325-ac6f-f093b716e868/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-12-08 20:36:56,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:36:56,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:37:01,287 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:37:01,289 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:37:01,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:37:01,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:37:01,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:37:01,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:37:01,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:37:01,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:37:01,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:37:01,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_10_true-unreach-call_true-termination.c_Iteration9_Loop [2018-12-08 20:37:01,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:37:01,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:37:01,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:37:01,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:37:01,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:37:01,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:37:01,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:37:01,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:37:01,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:37:01,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:37:01,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:37:01,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:37:01,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:37:01,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:37:01,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:37:01,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:37:01,315 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:37:01,316 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:37:01,316 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:37:01,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:37:01,317 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:37:01,317 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:37:01,317 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-12-08 20:37:01,317 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:37:01,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:37:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:37:01,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:37:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:37:01,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:37:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:37:01,424 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-12-08 20:37:01,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-12-08 20:37:01,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 460 states and 697 transitions. Complement of second has 18 states. [2018-12-08 20:37:01,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:37:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:37:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-08 20:37:01,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 127 letters. Loop has 4 letters. [2018-12-08 20:37:01,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:37:01,458 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:37:01,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:37:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:37:01,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:37:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:37:01,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:37:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:37:01,569 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-12-08 20:37:01,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-12-08 20:37:01,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 466 states and 703 transitions. Complement of second has 17 states. [2018-12-08 20:37:01,616 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-12-08 20:37:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:37:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 20:37:01,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 127 letters. Loop has 4 letters. [2018-12-08 20:37:01,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:37:01,617 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:37:01,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:37:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:37:01,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:37:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:37:01,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:37:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:37:01,726 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-12-08 20:37:01,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240 Second operand 6 states. [2018-12-08 20:37:01,762 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 442 states and 678 transitions. cyclomatic complexity: 240. Second operand 6 states. Result 563 states and 838 transitions. Complement of second has 27 states. [2018-12-08 20:37:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 20:37:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 20:37:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 20:37:01,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 4 letters. [2018-12-08 20:37:01,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:37:01,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 131 letters. Loop has 4 letters. [2018-12-08 20:37:01,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:37:01,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 127 letters. Loop has 8 letters. [2018-12-08 20:37:01,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:37:01,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 838 transitions. [2018-12-08 20:37:01,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 20:37:01,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 446 states and 683 transitions. [2018-12-08 20:37:01,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2018-12-08 20:37:01,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2018-12-08 20:37:01,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 683 transitions. [2018-12-08 20:37:01,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:37:01,769 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 683 transitions. [2018-12-08 20:37:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 683 transitions. [2018-12-08 20:37:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2018-12-08 20:37:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-08 20:37:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 678 transitions. [2018-12-08 20:37:01,775 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 678 transitions. [2018-12-08 20:37:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 20:37:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-12-08 20:37:01,776 INFO L87 Difference]: Start difference. First operand 442 states and 678 transitions. Second operand 25 states. [2018-12-08 20:37:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:37:02,107 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2018-12-08 20:37:02,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 20:37:02,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 600 states and 864 transitions. [2018-12-08 20:37:02,110 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:37:02,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 600 states to 0 states and 0 transitions. [2018-12-08 20:37:02,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 20:37:02,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 20:37:02,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 20:37:02,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 20:37:02,110 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:37:02,110 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:37:02,110 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:37:02,110 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 20:37:02,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:37:02,111 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:37:02,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 20:37:02,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:37:02 BoogieIcfgContainer [2018-12-08 20:37:02,115 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 20:37:02,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:37:02,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:37:02,115 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:37:02,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:36:42" (3/4) ... [2018-12-08 20:37:02,118 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 20:37:02,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:37:02,118 INFO L168 Benchmark]: Toolchain (without parser) took 19984.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.3 MB). Free memory was 962.4 MB in the beginning and 907.6 MB in the end (delta: 54.8 MB). Peak memory consumption was 396.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:37:02,119 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:37:02,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 114.59 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:37:02,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.79 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:37:02,120 INFO L168 Benchmark]: Boogie Preprocessor took 9.70 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:37:02,120 INFO L168 Benchmark]: RCFGBuilder took 139.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:37:02,120 INFO L168 Benchmark]: BuchiAutomizer took 19697.73 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 234.9 MB). Free memory was 1.1 GB in the beginning and 907.6 MB in the end (delta: 179.0 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. [2018-12-08 20:37:02,120 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.4 GB. Free memory is still 907.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:37:02,122 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 114.59 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.79 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.70 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 139.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19697.73 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 234.9 MB). Free memory was 1.1 GB in the beginning and 907.6 MB in the end (delta: 179.0 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.4 GB. Free memory is still 907.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 2 deterministic, 6 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.6s and 10 iterations. TraceHistogramMax:23. Analysis of lassos took 15.4s. Construction of modules took 0.9s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 6, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 330 SDtfs, 948 SDslu, 470 SDs, 0 SdLazy, 1968 SolverSat, 776 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...