./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/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 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:33:04,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:33:04,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:33:04,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:33:04,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:33:04,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:33:04,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:33:04,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:33:04,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:33:04,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:33:04,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:33:04,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:33:04,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:33:04,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:33:04,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:33:04,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:33:04,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:33:04,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:33:04,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:33:04,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:33:04,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:33:04,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:33:04,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:33:04,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:33:04,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:33:04,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:33:04,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:33:04,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:33:04,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:33:04,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:33:04,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:33:04,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:33:04,141 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:33:04,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:33:04,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:33:04,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:33:04,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 00:33:04,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:33:04,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:33:04,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:33:04,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:33:04,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:33:04,152 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:33:04,152 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:33:04,152 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:33:04,152 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:33:04,152 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:33:04,152 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:33:04,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:33:04,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:33:04,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:33:04,160 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:33:04,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:33:04,161 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:33:04,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:33:04,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:33:04,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:33:04,161 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:33:04,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:33:04,162 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:33:04,162 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:33:04,162 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:33:04,163 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_f8dd0b3e-459f-4595-af70-f20cd1283b78/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 -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-11-10 00:33:04,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:33:04,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:33:04,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:33:04,198 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:33:04,198 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:33:04,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-10 00:33:04,239 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/data/66978a29b/e448aa24a5eb488ebbab14722fa093c0/FLAG7b7e46bf1 [2018-11-10 00:33:04,633 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:33:04,633 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-10 00:33:04,638 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/data/66978a29b/e448aa24a5eb488ebbab14722fa093c0/FLAG7b7e46bf1 [2018-11-10 00:33:04,647 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/data/66978a29b/e448aa24a5eb488ebbab14722fa093c0 [2018-11-10 00:33:04,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:33:04,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:33:04,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:33:04,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:33:04,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:33:04,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56be32e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04, skipping insertion in model container [2018-11-10 00:33:04,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:33:04,678 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:33:04,784 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:33:04,786 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:33:04,795 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:33:04,803 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:33:04,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04 WrapperNode [2018-11-10 00:33:04,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:33:04,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:33:04,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:33:04,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:33:04,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:33:04,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:33:04,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:33:04,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:33:04,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... [2018-11-10 00:33:04,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:33:04,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:33:04,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:33:04,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:33:04,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:33:04,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:33:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-10 00:33:04,901 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-10 00:33:04,980 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:33:04,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:33:04 BoogieIcfgContainer [2018-11-10 00:33:04,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:33:04,981 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:33:04,981 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:33:04,983 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:33:04,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:33:04,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:33:04" (1/3) ... [2018-11-10 00:33:04,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3347fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:33:04, skipping insertion in model container [2018-11-10 00:33:04,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:33:04,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:04" (2/3) ... [2018-11-10 00:33:04,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3347fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:33:04, skipping insertion in model container [2018-11-10 00:33:04,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:33:04,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:33:04" (3/3) ... [2018-11-10 00:33:04,986 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-11-10 00:33:05,028 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:33:05,029 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:33:05,029 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:33:05,029 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:33:05,029 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:33:05,029 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:33:05,029 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:33:05,029 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:33:05,029 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:33:05,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 00:33:05,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 00:33:05,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:05,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:05,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 00:33:05,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:33:05,066 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:33:05,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 00:33:05,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 00:33:05,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:05,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:05,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 00:33:05,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:33:05,076 INFO L793 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 20#L25true call main_#t~ret2 := fibo(main_~x~0);< 12#fiboENTRYtrue [2018-11-10 00:33:05,076 INFO L795 eck$LassoCheckResult]: Loop: 12#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 11#L8true assume !(~n == 1); 19#L11true call #t~ret0 := fibo(~n - 1);< 12#fiboENTRYtrue [2018-11-10 00:33:05,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 29883, now seen corresponding path program 1 times [2018-11-10 00:33:05,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:05,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:05,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 1 times [2018-11-10 00:33:05,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:05,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:05,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301702, now seen corresponding path program 1 times [2018-11-10 00:33:05,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:05,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:05,240 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:05,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:05,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:05,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:05,241 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:33:05,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:05,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:05,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 00:33:05,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:05,242 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:05,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,316 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:05,317 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:05,320 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:05,331 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:05,331 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:05,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:05,351 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:05,351 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:05,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:05,369 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:05,369 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:05,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:05,387 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:05,387 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:05,402 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:33:05,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:05,437 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:33:05,438 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:05,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:05,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:05,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:05,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:33:05,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:05,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:05,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:05,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration1_Loop [2018-11-10 00:33:05,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:05,439 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:05,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:05,490 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:05,495 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:33:05,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:05,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:05,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:05,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:05,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:05,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:05,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:05,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:05,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:05,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:05,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:05,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:05,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:05,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:05,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:05,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:05,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:05,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:05,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:05,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:05,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:05,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:05,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:05,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:05,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:05,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:05,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:05,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:05,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:05,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:05,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:05,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:05,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:05,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:05,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:05,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:05,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:05,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:05,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:05,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:05,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:05,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:05,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:05,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:05,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:33:05,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:33:05,521 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:33:05,523 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:33:05,523 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:33:05,523 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:33:05,523 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 00:33:05,524 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:33:05,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:05,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:05,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:05,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 00:33:05,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 00:33:05,717 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2018-11-10 00:33:05,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 00:33:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 00:33:05,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-10 00:33:05,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:05,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 00:33:05,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:05,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 00:33:05,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:05,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-10 00:33:05,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 00:33:05,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 25 states and 34 transitions. [2018-11-10 00:33:05,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 00:33:05,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 00:33:05,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-10 00:33:05,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:05,733 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-10 00:33:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-10 00:33:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-10 00:33:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 00:33:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-10 00:33:05,752 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 00:33:05,752 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-10 00:33:05,752 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:33:05,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-10 00:33:05,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 00:33:05,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:05,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:05,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:05,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:05,754 INFO L793 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 126#L25 call main_#t~ret2 := fibo(main_~x~0);< 131#fiboENTRY ~n := #in~n; 132#L6 assume !(~n < 1); 130#L8 assume !(~n == 1); 123#L11 call #t~ret0 := fibo(~n - 1);< 133#fiboENTRY ~n := #in~n; 134#L6 assume ~n < 1;#res := 0; 129#fiboFINAL assume true; 122#fiboEXIT >#33#return; 124#L11-1 [2018-11-10 00:33:05,754 INFO L795 eck$LassoCheckResult]: Loop: 124#L11-1 call #t~ret1 := fibo(~n - 2);< 138#fiboENTRY ~n := #in~n; 141#L6 assume !(~n < 1); 140#L8 assume !(~n == 1); 136#L11 call #t~ret0 := fibo(~n - 1);< 138#fiboENTRY ~n := #in~n; 141#L6 assume ~n < 1;#res := 0; 137#fiboFINAL assume true; 139#fiboEXIT >#33#return; 124#L11-1 [2018-11-10 00:33:05,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1181449843, now seen corresponding path program 1 times [2018-11-10 00:33:05,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 00:33:05,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:33:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:33:05,822 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:33:05,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 246097683, now seen corresponding path program 1 times [2018-11-10 00:33:05,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 00:33:05,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:33:05,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:33:05,864 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:33:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 00:33:05,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:33:05,868 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 00:33:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:33:05,947 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-10 00:33:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 00:33:05,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-10 00:33:05,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 00:33:05,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2018-11-10 00:33:05,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 00:33:05,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 00:33:05,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-10 00:33:05,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:05,950 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 00:33:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-10 00:33:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 00:33:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 00:33:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-10 00:33:05,953 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 00:33:05,953 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-10 00:33:05,953 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:33:05,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-10 00:33:05,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 00:33:05,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:05,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:05,954 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:05,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:05,955 INFO L793 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 191#L25 call main_#t~ret2 := fibo(main_~x~0);< 196#fiboENTRY ~n := #in~n; 197#L6 assume !(~n < 1); 195#L8 assume !(~n == 1); 188#L11 call #t~ret0 := fibo(~n - 1);< 198#fiboENTRY ~n := #in~n; 199#L6 assume !(~n < 1); 193#L8 assume ~n == 1;#res := 1; 194#fiboFINAL assume true; 187#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 00:33:05,955 INFO L795 eck$LassoCheckResult]: Loop: 189#L11-1 call #t~ret1 := fibo(~n - 2);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume !(~n == 1); 201#L11 call #t~ret0 := fibo(~n - 1);< 203#fiboENTRY ~n := #in~n; 210#L6 assume !(~n < 1); 209#L8 assume ~n == 1;#res := 1; 207#fiboFINAL assume true; 205#fiboEXIT >#33#return; 189#L11-1 [2018-11-10 00:33:05,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2029785426, now seen corresponding path program 1 times [2018-11-10 00:33:05,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:05,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:06,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:33:06,001 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:33:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:06,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:33:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 00:33:06,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:33:06,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 1 times [2018-11-10 00:33:06,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:06,107 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:06,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:06,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:06,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:06,108 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:33:06,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:06,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:06,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:06,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 00:33:06,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:06,108 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:06,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:06,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:06,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-11-10 00:33:06,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:06,154 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:06,154 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:06,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:06,156 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:06,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:33:06,174 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:07,065 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:33:07,067 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:07,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:07,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:07,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:07,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:33:07,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:07,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:07,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:07,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration3_Loop [2018-11-10 00:33:07,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:07,067 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:07,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,124 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:07,124 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:33:07,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:07,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:07,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:07,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:07,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:07,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:07,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:07,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:07,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:07,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:07,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:07,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:07,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:07,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:07,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:07,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:07,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:07,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:33:07,137 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:33:07,138 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:33:07,138 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:33:07,138 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:33:07,138 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:33:07,138 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 00:33:07,139 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:33:07,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:07,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:07,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:07,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 00:33:07,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 00:33:07,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 135 states and 183 transitions. Complement of second has 28 states. [2018-11-10 00:33:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 00:33:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 00:33:07,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 00:33:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-10 00:33:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-10 00:33:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:07,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 183 transitions. [2018-11-10 00:33:07,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:33:07,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2018-11-10 00:33:07,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 00:33:07,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 00:33:07,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2018-11-10 00:33:07,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:07,332 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 152 transitions. [2018-11-10 00:33:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2018-11-10 00:33:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-10 00:33:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 00:33:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-11-10 00:33:07,340 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-11-10 00:33:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 00:33:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 00:33:07,341 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2018-11-10 00:33:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:33:07,392 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-10 00:33:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 00:33:07,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2018-11-10 00:33:07,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:33:07,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 144 transitions. [2018-11-10 00:33:07,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 00:33:07,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 00:33:07,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 144 transitions. [2018-11-10 00:33:07,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:07,397 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-11-10 00:33:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 144 transitions. [2018-11-10 00:33:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2018-11-10 00:33:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 00:33:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2018-11-10 00:33:07,403 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 00:33:07,403 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2018-11-10 00:33:07,403 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 00:33:07,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 125 transitions. [2018-11-10 00:33:07,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:33:07,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:07,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:07,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:07,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:07,406 INFO L793 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 711#L25 call main_#t~ret2 := fibo(main_~x~0);< 752#fiboENTRY ~n := #in~n; 755#L6 assume !(~n < 1); 726#L8 assume !(~n == 1); 727#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 741#L6 assume !(~n < 1); 774#L8 assume !(~n == 1); 739#L11 call #t~ret0 := fibo(~n - 1);< 738#fiboENTRY ~n := #in~n; 740#L6 assume !(~n < 1); 775#L8 assume ~n == 1;#res := 1; 773#fiboFINAL assume true; 772#fiboEXIT >#33#return; 729#L11-1 call #t~ret1 := fibo(~n - 2);< 771#fiboENTRY ~n := #in~n; 801#L6 assume ~n < 1;#res := 0; 800#fiboFINAL assume true; 799#fiboEXIT >#35#return; 798#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 797#fiboFINAL assume true; 790#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 00:33:07,406 INFO L795 eck$LassoCheckResult]: Loop: 723#L11-1 call #t~ret1 := fibo(~n - 2);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume !(~n == 1); 724#L11 call #t~ret0 := fibo(~n - 1);< 750#fiboENTRY ~n := #in~n; 776#L6 assume !(~n < 1); 721#L8 assume ~n == 1;#res := 1; 725#fiboFINAL assume true; 791#fiboEXIT >#33#return; 723#L11-1 [2018-11-10 00:33:07,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1557778097, now seen corresponding path program 1 times [2018-11-10 00:33:07,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:07,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:07,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 00:33:07,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:33:07,464 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:33:07,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:07,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 00:33:07,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:33:07,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 00:33:07,506 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:33:07,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -960881524, now seen corresponding path program 2 times [2018-11-10 00:33:07,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:07,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:07,578 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:07,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:07,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:07,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:07,579 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:33:07,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:07,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:07,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:07,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 00:33:07,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:07,579 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:07,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:07,605 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:07,605 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:07,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:07,607 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:07,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:33:07,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:08,530 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:33:08,532 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:08,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:08,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:08,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:08,532 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:33:08,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:08,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:08,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:08,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration4_Loop [2018-11-10 00:33:08,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:08,533 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:08,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:08,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:08,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:08,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:08,570 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:08,570 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:33:08,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:08,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:08,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:08,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:08,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:08,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:08,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:08,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:08,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:08,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:08,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:08,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:08,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:08,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:08,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:08,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:08,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:08,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:08,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:08,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:08,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:08,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:08,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:08,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:08,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:08,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:08,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:08,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:08,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:08,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:08,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:08,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:08,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:08,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:08,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:08,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:33:08,584 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:33:08,584 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:33:08,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:33:08,584 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:33:08,584 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:33:08,584 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 00:33:08,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:33:08,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:08,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:08,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:08,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 00:33:08,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 00:33:08,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 163 states and 217 transitions. Complement of second has 25 states. [2018-11-10 00:33:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 00:33:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 00:33:08,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 00:33:08,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:08,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:08,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:08,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:08,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:08,832 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 00:33:08,832 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 00:33:08,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 288 states and 387 transitions. Complement of second has 25 states. [2018-11-10 00:33:08,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 00:33:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 00:33:08,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 00:33:08,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:08,911 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:08,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:08,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:08,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:08,999 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 00:33:08,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 00:33:09,107 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 125 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 826 states and 1091 transitions. Complement of second has 112 states. [2018-11-10 00:33:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 00:33:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-10 00:33:09,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 10 letters. [2018-11-10 00:33:09,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:09,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 38 letters. Loop has 10 letters. [2018-11-10 00:33:09,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:09,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 28 letters. Loop has 20 letters. [2018-11-10 00:33:09,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:09,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 1091 transitions. [2018-11-10 00:33:09,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 00:33:09,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 413 states and 595 transitions. [2018-11-10 00:33:09,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-10 00:33:09,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2018-11-10 00:33:09,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 595 transitions. [2018-11-10 00:33:09,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:09,134 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 595 transitions. [2018-11-10 00:33:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 595 transitions. [2018-11-10 00:33:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 336. [2018-11-10 00:33:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-10 00:33:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2018-11-10 00:33:09,160 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 463 transitions. [2018-11-10 00:33:09,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 00:33:09,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 00:33:09,161 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 10 states. [2018-11-10 00:33:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:33:09,288 INFO L93 Difference]: Finished difference Result 498 states and 786 transitions. [2018-11-10 00:33:09,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 00:33:09,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 786 transitions. [2018-11-10 00:33:09,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 00:33:09,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 496 states and 783 transitions. [2018-11-10 00:33:09,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-10 00:33:09,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-10 00:33:09,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 783 transitions. [2018-11-10 00:33:09,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:09,304 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 783 transitions. [2018-11-10 00:33:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 783 transitions. [2018-11-10 00:33:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 370. [2018-11-10 00:33:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-10 00:33:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2018-11-10 00:33:09,325 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-10 00:33:09,325 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 523 transitions. [2018-11-10 00:33:09,325 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 00:33:09,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 523 transitions. [2018-11-10 00:33:09,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 00:33:09,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:09,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:09,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:09,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:33:09,331 INFO L793 eck$LassoCheckResult]: Stem: 3582#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 3581#L25 call main_#t~ret2 := fibo(main_~x~0);< 3622#fiboENTRY ~n := #in~n; 3634#L6 assume !(~n < 1); 3633#L8 assume !(~n == 1); 3629#L11 call #t~ret0 := fibo(~n - 1);< 3631#fiboENTRY ~n := #in~n; 3632#L6 assume !(~n < 1); 3628#L8 assume !(~n == 1); 3584#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3627#L6 assume !(~n < 1); 3630#L8 assume !(~n == 1); 3585#L11 call #t~ret0 := fibo(~n - 1);< 3625#fiboENTRY ~n := #in~n; 3626#L6 assume !(~n < 1); 3583#L8 assume ~n == 1;#res := 1; 3586#fiboFINAL assume true; 3676#fiboEXIT >#33#return; 3652#L11-1 call #t~ret1 := fibo(~n - 2);< 3661#fiboENTRY ~n := #in~n; 3720#L6 assume !(~n < 1); 3712#L8 assume !(~n == 1); 3714#L11 call #t~ret0 := fibo(~n - 1);< 3913#fiboENTRY ~n := #in~n; 3918#L6 assume !(~n < 1); 3915#L8 assume !(~n == 1); 3916#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-10 00:33:09,331 INFO L795 eck$LassoCheckResult]: Loop: 3925#fiboENTRY ~n := #in~n; 3932#L6 assume !(~n < 1); 3931#L8 assume !(~n == 1); 3922#L11 call #t~ret0 := fibo(~n - 1);< 3925#fiboENTRY [2018-11-10 00:33:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1816361660, now seen corresponding path program 1 times [2018-11-10 00:33:09,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:09,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:33:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 00:33:09,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:33:09,384 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:33:09,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 00:33:09,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:33:09,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-10 00:33:09,497 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:33:09,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1450956, now seen corresponding path program 2 times [2018-11-10 00:33:09,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:09,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:09,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:33:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:09,518 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:09,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:09,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:09,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:09,519 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:33:09,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:09,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:09,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:09,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 00:33:09,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:09,519 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:09,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,553 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:09,553 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:09,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:09,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:09,558 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:09,559 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:09,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:09,575 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:09,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:33:09,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:09,610 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:33:09,612 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:09,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:09,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:09,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:09,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:33:09,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:09,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:09,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:09,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration5_Loop [2018-11-10 00:33:09,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:09,613 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:09,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:09,652 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:09,652 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:33:09,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:09,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:09,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:09,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:09,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:09,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:09,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:09,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:09,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:33:09,657 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:33:09,657 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:33:09,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:33:09,658 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:33:09,658 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:33:09,658 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-10 00:33:09,658 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:33:09,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:09,721 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 00:33:09,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 00:33:09,771 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-10 00:33:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:33:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 00:33:09,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 00:33:09,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:09,773 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:09,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:09,863 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 00:33:09,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 00:33:09,931 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 380 states and 533 transitions. Complement of second has 13 states. [2018-11-10 00:33:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:33:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 00:33:09,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 00:33:09,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:09,933 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:09,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:09,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:10,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:10,014 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 00:33:10,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-11-10 00:33:10,073 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 370 states and 523 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 495 states and 657 transitions. Complement of second has 14 states. [2018-11-10 00:33:10,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:33:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 00:33:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-10 00:33:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-10 00:33:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-10 00:33:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:10,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 657 transitions. [2018-11-10 00:33:10,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 00:33:10,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 408 states and 568 transitions. [2018-11-10 00:33:10,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-10 00:33:10,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-10 00:33:10,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 568 transitions. [2018-11-10 00:33:10,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:10,084 INFO L705 BuchiCegarLoop]: Abstraction has 408 states and 568 transitions. [2018-11-10 00:33:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 568 transitions. [2018-11-10 00:33:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2018-11-10 00:33:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-10 00:33:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 547 transitions. [2018-11-10 00:33:10,093 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 547 transitions. [2018-11-10 00:33:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 00:33:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 00:33:10,093 INFO L87 Difference]: Start difference. First operand 394 states and 547 transitions. Second operand 14 states. [2018-11-10 00:33:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:33:10,225 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2018-11-10 00:33:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 00:33:10,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 349 transitions. [2018-11-10 00:33:10,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 00:33:10,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 245 states and 314 transitions. [2018-11-10 00:33:10,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-10 00:33:10,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-10 00:33:10,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 314 transitions. [2018-11-10 00:33:10,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:10,230 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 314 transitions. [2018-11-10 00:33:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 314 transitions. [2018-11-10 00:33:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2018-11-10 00:33:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 00:33:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-10 00:33:10,235 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 00:33:10,235 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 00:33:10,235 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 00:33:10,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 261 transitions. [2018-11-10 00:33:10,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 00:33:10,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:10,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:10,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:33:10,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:33:10,237 INFO L793 eck$LassoCheckResult]: Stem: 6358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 6357#L25 call main_#t~ret2 := fibo(main_~x~0);< 6395#fiboENTRY ~n := #in~n; 6465#L6 assume !(~n < 1); 6464#L8 assume !(~n == 1); 6460#L11 call #t~ret0 := fibo(~n - 1);< 6463#fiboENTRY ~n := #in~n; 6462#L6 assume !(~n < 1); 6461#L8 assume !(~n == 1); 6455#L11 call #t~ret0 := fibo(~n - 1);< 6459#fiboENTRY ~n := #in~n; 6457#L6 assume !(~n < 1); 6458#L8 assume !(~n == 1); 6383#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6454#L6 assume !(~n < 1); 6456#L8 assume !(~n == 1); 6384#L11 call #t~ret0 := fibo(~n - 1);< 6453#fiboENTRY ~n := #in~n; 6449#L6 assume !(~n < 1); 6450#L8 assume ~n == 1;#res := 1; 6550#fiboFINAL assume true; 6549#fiboEXIT >#33#return; 6351#L11-1 call #t~ret1 := fibo(~n - 2);< 6385#fiboENTRY ~n := #in~n; 6553#L6 assume ~n < 1;#res := 0; 6552#fiboFINAL assume true; 6350#fiboEXIT >#35#return; 6352#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6538#fiboFINAL assume true; 6523#fiboEXIT >#33#return; 6374#L11-1 call #t~ret1 := fibo(~n - 2);< 6522#fiboENTRY ~n := #in~n; 6541#L6 assume !(~n < 1); 6396#L8 assume !(~n == 1); 6360#L11 call #t~ret0 := fibo(~n - 1);< 6389#fiboENTRY ~n := #in~n; 6445#L6 assume !(~n < 1); 6435#L8 assume !(~n == 1); 6417#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-11-10 00:33:10,237 INFO L795 eck$LassoCheckResult]: Loop: 6416#L11 call #t~ret0 := fibo(~n - 1);< 6418#fiboENTRY ~n := #in~n; 6432#L6 assume !(~n < 1); 6430#L8 assume !(~n == 1); 6416#L11 [2018-11-10 00:33:10,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1127026968, now seen corresponding path program 2 times [2018-11-10 00:33:10,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:10,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:33:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 00:33:10,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:33:10,300 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:33:10,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 00:33:10,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 00:33:10,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 00:33:10,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 00:33:10,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:33:10,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-10 00:33:10,436 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:33:10,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 3 times [2018-11-10 00:33:10,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:10,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:33:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:10,466 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:10,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:10,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:10,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:10,467 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:33:10,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:10,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:10,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:10,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-10 00:33:10,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:10,467 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:10,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:10,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:10,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:10,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:10,499 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:10,499 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:10,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:10,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:10,513 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:10,513 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:10,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:10,531 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:10,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:33:10,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:12,822 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:33:12,823 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:12,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:12,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:12,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:12,823 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:33:12,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:12,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:12,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:12,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration6_Loop [2018-11-10 00:33:12,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:12,824 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:12,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-11-10 00:33:12,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:12,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:12,860 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:12,860 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:33:12,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-11-10 00:33:12,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:12,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:12,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:12,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:12,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:12,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:12,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:12,864 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:33:12,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:33:12,866 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:33:12,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:33:12,866 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:33:12,866 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:33:12,866 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 00:33:12,867 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:33:12,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:12,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:12,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:12,963 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 00:33:12,963 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 00:33:13,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 216 states and 274 transitions. Complement of second has 18 states. [2018-11-10 00:33:13,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 00:33:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 00:33:13,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 00:33:13,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:13,004 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:13,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:13,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:13,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:13,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 00:33:13,108 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 00:33:13,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 222 states and 280 transitions. Complement of second has 17 states. [2018-11-10 00:33:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 00:33:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 00:33:13,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 00:33:13,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:13,166 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:13,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:13,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:13,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:13,246 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 00:33:13,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-10 00:33:13,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 261 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 272 states and 344 transitions. Complement of second has 27 states. [2018-11-10 00:33:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 00:33:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 00:33:13,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-10 00:33:13,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 52 letters. Loop has 4 letters. [2018-11-10 00:33:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 48 letters. Loop has 8 letters. [2018-11-10 00:33:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:13,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 344 transitions. [2018-11-10 00:33:13,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 00:33:13,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 208 states and 266 transitions. [2018-11-10 00:33:13,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 00:33:13,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-10 00:33:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 266 transitions. [2018-11-10 00:33:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:13,295 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2018-11-10 00:33:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 266 transitions. [2018-11-10 00:33:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-11-10 00:33:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 00:33:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2018-11-10 00:33:13,299 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 261 transitions. [2018-11-10 00:33:13,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 00:33:13,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-10 00:33:13,300 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand 20 states. [2018-11-10 00:33:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:33:13,539 INFO L93 Difference]: Finished difference Result 345 states and 474 transitions. [2018-11-10 00:33:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 00:33:13,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 474 transitions. [2018-11-10 00:33:13,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 00:33:13,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 316 states and 438 transitions. [2018-11-10 00:33:13,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2018-11-10 00:33:13,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-10 00:33:13,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 438 transitions. [2018-11-10 00:33:13,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:13,547 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 438 transitions. [2018-11-10 00:33:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 438 transitions. [2018-11-10 00:33:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 271. [2018-11-10 00:33:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 00:33:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 365 transitions. [2018-11-10 00:33:13,554 INFO L728 BuchiCegarLoop]: Abstraction has 271 states and 365 transitions. [2018-11-10 00:33:13,555 INFO L608 BuchiCegarLoop]: Abstraction has 271 states and 365 transitions. [2018-11-10 00:33:13,555 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 00:33:13,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 365 transitions. [2018-11-10 00:33:13,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 00:33:13,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:33:13,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:33:13,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 00:33:13,558 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:33:13,558 INFO L793 eck$LassoCheckResult]: Stem: 8580#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 7; 8570#L25 call main_#t~ret2 := fibo(main_~x~0);< 8616#fiboENTRY ~n := #in~n; 8678#L6 assume !(~n < 1); 8676#L8 assume !(~n == 1); 8673#L11 call #t~ret0 := fibo(~n - 1);< 8674#fiboENTRY ~n := #in~n; 8689#L6 assume !(~n < 1); 8688#L8 assume !(~n == 1); 8683#L11 call #t~ret0 := fibo(~n - 1);< 8687#fiboENTRY ~n := #in~n; 8691#L6 assume !(~n < 1); 8685#L8 assume !(~n == 1); 8680#L11 call #t~ret0 := fibo(~n - 1);< 8684#fiboENTRY ~n := #in~n; 8710#L6 assume !(~n < 1); 8709#L8 assume !(~n == 1); 8609#L11 call #t~ret0 := fibo(~n - 1);< 8704#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8718#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8704#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8718#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8704#fiboENTRY ~n := #in~n; 8719#L6 assume !(~n < 1); 8718#L8 assume !(~n == 1); 8608#L11 call #t~ret0 := fibo(~n - 1);< 8704#fiboENTRY ~n := #in~n; 8720#L6 assume !(~n < 1); 8814#L8 assume ~n == 1;#res := 1; 8812#fiboFINAL assume true; 8810#fiboEXIT >#33#return; 8607#L11-1 call #t~ret1 := fibo(~n - 2);< 8610#fiboENTRY ~n := #in~n; 8767#L6 assume ~n < 1;#res := 0; 8762#fiboFINAL assume true; 8758#fiboEXIT >#35#return; 8742#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8739#fiboFINAL assume true; 8732#fiboEXIT >#33#return; 8727#L11-1 call #t~ret1 := fibo(~n - 2);< 8729#fiboENTRY ~n := #in~n; 8737#L6 assume !(~n < 1); 8735#L8 assume ~n == 1;#res := 1; 8624#fiboFINAL assume true; 8726#fiboEXIT >#35#return; 8694#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8721#fiboFINAL assume true; 8695#fiboEXIT >#33#return; 8621#L11-1 call #t~ret1 := fibo(~n - 2);< 8701#fiboENTRY ~n := #in~n; 8631#L6 assume !(~n < 1); 8620#L8 assume !(~n == 1); 8572#L11 call #t~ret0 := fibo(~n - 1);< 8613#fiboENTRY ~n := #in~n; 8832#L6 assume !(~n < 1); 8833#L8 assume !(~n == 1); 8635#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8659#L6 assume !(~n < 1); 8657#L8 assume !(~n == 1); 8633#L11 [2018-11-10 00:33:13,558 INFO L795 eck$LassoCheckResult]: Loop: 8633#L11 call #t~ret0 := fibo(~n - 1);< 8637#fiboENTRY ~n := #in~n; 8659#L6 assume !(~n < 1); 8657#L8 assume !(~n == 1); 8633#L11 [2018-11-10 00:33:13,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1780673760, now seen corresponding path program 3 times [2018-11-10 00:33:13,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:13,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:13,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:33:13,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 157 proven. 95 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 00:33:13,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:33:13,694 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:33:13,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 00:33:13,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 00:33:13,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 00:33:13,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 00:33:13,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:33:13,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 26 [2018-11-10 00:33:13,829 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:33:13,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1893846, now seen corresponding path program 4 times [2018-11-10 00:33:13,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:33:13,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:33:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:13,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:33:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:33:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:33:13,860 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:13,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:13,861 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:13,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:13,861 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:33:13,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:13,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:13,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:13,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 00:33:13,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:13,861 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:13,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:13,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:13,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:13,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:13,900 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:13,900 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:13,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:13,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:13,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:33:13,907 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:13,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:33:13,933 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8dd0b3e-459f-4595-af70-f20cd1283b78/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:13,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:33:13,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:33:14,966 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:33:14,967 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:33:14,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:33:14,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:33:14,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:33:14,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:33:14,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:33:14,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:33:14,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:33:14,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_7_false-unreach-call_true-termination.c_Iteration7_Loop [2018-11-10 00:33:14,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:33:14,968 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:33:14,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:14,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:14,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:14,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:33:14,996 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:33:14,996 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:33:14,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:14,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:14,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:14,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:14,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:14,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:14,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:14,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:14,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:33:14,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:33:14,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:33:14,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:33:14,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:33:14,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:33:14,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:33:14,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:33:14,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:33:14,999 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:33:15,000 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:33:15,001 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:33:15,001 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:33:15,001 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 00:33:15,001 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:33:15,001 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-10 00:33:15,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 00:33:15,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:15,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:15,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:15,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 00:33:15,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 365 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-10 00:33:15,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 365 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 286 states and 381 transitions. Complement of second has 18 states. [2018-11-10 00:33:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 00:33:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-10 00:33:15,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 00:33:15,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:15,124 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:15,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:15,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:15,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:15,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 00:33:15,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 365 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-10 00:33:15,264 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 365 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 292 states and 387 transitions. Complement of second has 17 states. [2018-11-10 00:33:15,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 00:33:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 00:33:15,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 00:33:15,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:15,265 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 00:33:15,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:33:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:15,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:33:15,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:33:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:33:15,391 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 00:33:15,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 365 transitions. cyclomatic complexity: 98 Second operand 6 states. [2018-11-10 00:33:15,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 365 transitions. cyclomatic complexity: 98. Second operand 6 states. Result 350 states and 463 transitions. Complement of second has 27 states. [2018-11-10 00:33:15,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 00:33:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 00:33:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 00:33:15,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 4 letters. [2018-11-10 00:33:15,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:15,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 69 letters. Loop has 4 letters. [2018-11-10 00:33:15,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 65 letters. Loop has 8 letters. [2018-11-10 00:33:15,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:33:15,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 463 transitions. [2018-11-10 00:33:15,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 00:33:15,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 275 states and 370 transitions. [2018-11-10 00:33:15,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2018-11-10 00:33:15,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-10 00:33:15,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 370 transitions. [2018-11-10 00:33:15,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:33:15,438 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-11-10 00:33:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 370 transitions. [2018-11-10 00:33:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-11-10 00:33:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 00:33:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 365 transitions. [2018-11-10 00:33:15,444 INFO L728 BuchiCegarLoop]: Abstraction has 271 states and 365 transitions. [2018-11-10 00:33:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 00:33:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-11-10 00:33:15,445 INFO L87 Difference]: Start difference. First operand 271 states and 365 transitions. Second operand 26 states. [2018-11-10 00:33:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:33:15,964 INFO L93 Difference]: Finished difference Result 295 states and 336 transitions. [2018-11-10 00:33:15,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 00:33:15,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 336 transitions. [2018-11-10 00:33:15,967 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:33:15,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 0 states and 0 transitions. [2018-11-10 00:33:15,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 00:33:15,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 00:33:15,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 00:33:15,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:33:15,968 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:33:15,968 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:33:15,968 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:33:15,968 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 00:33:15,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:33:15,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:33:15,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 00:33:15,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:33:15 BoogieIcfgContainer [2018-11-10 00:33:15,974 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:33:15,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:33:15,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:33:15,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:33:15,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:33:04" (3/4) ... [2018-11-10 00:33:15,979 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:33:15,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:33:15,980 INFO L168 Benchmark]: Toolchain (without parser) took 11330.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 963.0 MB in the beginning and 973.0 MB in the end (delta: -10.0 MB). Peak memory consumption was 182.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:33:15,981 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:33:15,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.13 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 951.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:33:15,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.95 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:33:15,983 INFO L168 Benchmark]: Boogie Preprocessor took 8.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:33:15,983 INFO L168 Benchmark]: RCFGBuilder took 150.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 00:33:15,984 INFO L168 Benchmark]: BuchiAutomizer took 10992.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 973.0 MB in the end (delta: 144.2 MB). Peak memory consumption was 207.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:33:15,984 INFO L168 Benchmark]: Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 973.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:33:15,986 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.13 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 951.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.95 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 8.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 150.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10992.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 973.0 MB in the end (delta: 144.2 MB). Peak memory consumption was 207.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 973.0 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 12 terminating modules (6 trivial, 2 deterministic, 4 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. 6 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 8 iterations. TraceHistogramMax:13. Analysis of lassos took 7.3s. Construction of modules took 0.7s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 342 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 370 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 262 SDtfs, 631 SDslu, 392 SDs, 0 SdLazy, 1339 SolverSat, 416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...