./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:56:21,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:56:21,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:56:21,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:56:21,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:56:21,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:56:21,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:56:21,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:56:21,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:56:21,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:56:21,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:56:21,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:56:21,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:56:21,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:56:21,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:56:21,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:56:21,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:56:21,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:56:21,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:56:21,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:56:21,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:56:21,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:56:21,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:56:21,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:56:21,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:56:21,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:56:21,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:56:21,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:56:21,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:56:21,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:56:21,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:56:21,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:56:21,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:56:21,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:56:21,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:56:21,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:56:21,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:56:21,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:56:21,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:56:21,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:56:21,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:56:21,156 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 19:56:21,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:56:21,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:56:21,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:56:21,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:56:21,191 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:56:21,191 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 19:56:21,192 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 19:56:21,192 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 19:56:21,192 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 19:56:21,193 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 19:56:21,193 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 19:56:21,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:56:21,193 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:56:21,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:56:21,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:56:21,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:56:21,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:56:21,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 19:56:21,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 19:56:21,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 19:56:21,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:56:21,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:56:21,196 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 19:56:21,197 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:56:21,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 19:56:21,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:56:21,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:56:21,198 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 19:56:21,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:56:21,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:56:21,199 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 19:56:21,200 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 19:56:21,200 INFO L138 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/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2019-11-15 19:56:21,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:56:21,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:56:21,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:56:21,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:56:21,248 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:56:21,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-15 19:56:21,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/data/cdc594583/01be3b71e9554e29b10f13eca85699b6/FLAG660fc3443 [2019-11-15 19:56:21,731 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:56:21,731 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-15 19:56:21,738 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/data/cdc594583/01be3b71e9554e29b10f13eca85699b6/FLAG660fc3443 [2019-11-15 19:56:22,162 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/data/cdc594583/01be3b71e9554e29b10f13eca85699b6 [2019-11-15 19:56:22,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:56:22,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:56:22,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:56:22,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:56:22,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:56:22,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a7b909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22, skipping insertion in model container [2019-11-15 19:56:22,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,187 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:56:22,206 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:56:22,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:56:22,534 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:56:22,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:56:22,579 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:56:22,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22 WrapperNode [2019-11-15 19:56:22,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:56:22,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:56:22,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:56:22,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:56:22,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:56:22,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:56:22,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:56:22,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:56:22,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... [2019-11-15 19:56:22,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:56:22,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:56:22,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:56:22,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:56:22,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 [2019-11-15 19:56:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:56:22,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:56:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-15 19:56:22,727 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-15 19:56:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-15 19:56:22,727 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-15 19:56:22,952 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:56:22,953 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 19:56:22,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:22 BoogieIcfgContainer [2019-11-15 19:56:22,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:56:22,955 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 19:56:22,955 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 19:56:22,959 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 19:56:22,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:56:22,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 07:56:22" (1/3) ... [2019-11-15 19:56:22,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ed01657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:56:22, skipping insertion in model container [2019-11-15 19:56:22,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:56:22,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:22" (2/3) ... [2019-11-15 19:56:22,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ed01657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:56:22, skipping insertion in model container [2019-11-15 19:56:22,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:56:22,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:22" (3/3) ... [2019-11-15 19:56:22,964 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-2.c [2019-11-15 19:56:23,015 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 19:56:23,016 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 19:56:23,016 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 19:56:23,016 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:56:23,016 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:56:23,016 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 19:56:23,016 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:56:23,017 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 19:56:23,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-15 19:56:23,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 19:56:23,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:23,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:23,071 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 19:56:23,072 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:23,072 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 19:56:23,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-15 19:56:23,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 19:56:23,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:23,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:23,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 19:56:23,077 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:23,085 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-11-15 19:56:23,086 INFO L793 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2019-11-15 19:56:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-11-15 19:56:23,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:23,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979974953] [2019-11-15 19:56:23,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:23,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:23,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:23,230 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-11-15 19:56:23,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:23,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512635596] [2019-11-15 19:56:23,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:23,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:23,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:23,255 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-11-15 19:56:23,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:23,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126755544] [2019-11-15 19:56:23,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:23,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:23,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:23,277 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:23,507 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:23,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:23,508 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:23,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:23,508 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 19:56:23,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:23,509 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:23,509 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration1_Loop [2019-11-15 19:56:23,509 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:23,509 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:23,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:23,691 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:23,692 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,713 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,725 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,725 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:23,752 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,752 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,771 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,778 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,779 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,800 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,807 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,807 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,828 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,833 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,834 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,851 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,859 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,859 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:23,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 [2019-11-15 19:56:23,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:23,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,889 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,912 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,930 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:23,930 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:23,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:23,957 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:23,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 19:56:23,980 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:24,044 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 19:56:24,046 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:24,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:24,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:24,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:24,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:24,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:24,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:24,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:24,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration1_Loop [2019-11-15 19:56:24,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:24,048 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:24,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:24,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:24,180 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:24,182 INFO L120 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 [2019-11-15 19:56:24,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,192 INFO L120 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 [2019-11-15 19:56:24,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,197 INFO L120 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 [2019-11-15 19:56:24,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,199 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,199 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,208 INFO L120 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 [2019-11-15 19:56:24,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,218 INFO L120 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 [2019-11-15 19:56:24,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,219 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,221 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,223 INFO L120 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 [2019-11-15 19:56:24,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,225 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,227 INFO L120 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 [2019-11-15 19:56:24,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,229 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,229 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,247 INFO L120 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 [2019-11-15 19:56:24,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,249 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:24,251 INFO L120 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 [2019-11-15 19:56:24,252 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:24,252 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:24,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:24,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:24,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:24,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:24,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:24,261 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:24,280 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:24,280 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:24,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:24,283 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:56:24,283 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:24,284 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-11-15 19:56:24,287 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 19:56:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:24,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 19:56:24,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:24,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:24,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:24,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 19:56:24,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-11-15 19:56:24,744 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2019-11-15 19:56:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 19:56:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-15 19:56:24,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 19:56:24,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:24,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-15 19:56:24,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:24,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-15 19:56:24,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:24,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-11-15 19:56:24,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 19:56:24,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-11-15 19:56:24,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-15 19:56:24,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-15 19:56:24,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-15 19:56:24,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:24,806 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-15 19:56:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-15 19:56:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-11-15 19:56:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 19:56:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-15 19:56:24,848 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-15 19:56:24,848 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-15 19:56:24,849 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 19:56:24,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-15 19:56:24,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 19:56:24,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:24,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:24,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:24,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:24,854 INFO L791 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2019-11-15 19:56:24,854 INFO L793 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2019-11-15 19:56:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-11-15 19:56:24,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:24,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095397608] [2019-11-15 19:56:24,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:24,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:24,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:24,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095397608] [2019-11-15 19:56:24,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774811531] [2019-11-15 19:56:24,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:25,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 19:56:25,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:25,099 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:25,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 19:56:25,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999559949] [2019-11-15 19:56:25,102 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-11-15 19:56:25,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:25,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875248817] [2019-11-15 19:56:25,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:25,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:25,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:56:25,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875248817] [2019-11-15 19:56:25,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:25,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:56:25,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558969825] [2019-11-15 19:56:25,171 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:56:25,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:56:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:56:25,176 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-15 19:56:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:25,281 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-11-15 19:56:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:56:25,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-11-15 19:56:25,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 19:56:25,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-11-15 19:56:25,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-15 19:56:25,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-15 19:56:25,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-11-15 19:56:25,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:25,292 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-11-15 19:56:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-11-15 19:56:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-15 19:56:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 19:56:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-15 19:56:25,306 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-15 19:56:25,306 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-15 19:56:25,307 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 19:56:25,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-15 19:56:25,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 19:56:25,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:25,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:25,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:25,315 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:25,316 INFO L791 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 387#L37 call main_#t~ret4 := fibo1(main_~x~0);< 388#fibo1ENTRY ~n := #in~n; 410#L8 assume !(~n < 1); 428#L10 assume !(1 == ~n); 383#L13 call #t~ret0 := fibo2(~n - 1);< 402#fibo2ENTRY ~n := #in~n; 430#L18 assume !(~n < 1); 431#L20 assume !(1 == ~n); 381#L23 call #t~ret2 := fibo1(~n - 1);< 386#fibo1ENTRY ~n := #in~n; 412#L8 assume !(~n < 1); 389#L10 assume 1 == ~n;#res := 1; 390#fibo1FINAL assume true; 406#fibo1EXIT >#45#return; 397#L23-1 [2019-11-15 19:56:25,316 INFO L793 eck$LassoCheckResult]: Loop: 397#L23-1 call #t~ret3 := fibo1(~n - 2);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume !(1 == ~n); 379#L13 call #t~ret0 := fibo2(~n - 1);< 424#fibo2ENTRY ~n := #in~n; 429#L18 assume !(~n < 1); 420#L20 assume !(1 == ~n); 377#L23 call #t~ret2 := fibo1(~n - 1);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume 1 == ~n;#res := 1; 408#fibo1FINAL assume true; 421#fibo1EXIT >#45#return; 397#L23-1 [2019-11-15 19:56:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-11-15 19:56:25,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:25,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230714752] [2019-11-15 19:56:25,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:25,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:25,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:25,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230714752] [2019-11-15 19:56:25,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541328780] [2019-11-15 19:56:25,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:25,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 19:56:25,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:25,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:25,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 19:56:25,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795203266] [2019-11-15 19:56:25,553 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-11-15 19:56:25,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:25,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408710395] [2019-11-15 19:56:25,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:25,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:25,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:25,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:25,868 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:25,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:25,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:25,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:25,869 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 19:56:25,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:25,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:25,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:25,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration3_Loop [2019-11-15 19:56:25,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:25,870 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:25,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:25,991 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:25,991 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 [2019-11-15 19:56:26,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:26,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:26,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:26,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 [2019-11-15 19:56:26,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:26,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:26,040 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:26,040 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:26,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:26,058 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:26,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 19:56:26,084 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:27,267 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 19:56:27,269 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:27,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:27,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:27,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:27,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:27,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:27,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:27,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:27,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration3_Loop [2019-11-15 19:56:27,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:27,270 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:27,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:27,403 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:27,403 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:27,404 INFO L120 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 [2019-11-15 19:56:27,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:27,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:27,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:27,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:27,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:27,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:27,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:27,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:27,409 INFO L120 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 [2019-11-15 19:56:27,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:27,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:27,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:27,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:27,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:27,416 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:27,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:27,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:27,418 INFO L120 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 [2019-11-15 19:56:27,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:27,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:27,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:27,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:27,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:27,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:27,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:27,427 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:27,435 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:27,436 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:27,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:27,443 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:56:27,443 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:27,443 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-15 19:56:27,444 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 19:56:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:27,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 19:56:27,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:27,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 19:56:27,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:27,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-15 19:56:27,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-15 19:56:28,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2019-11-15 19:56:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 19:56:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-11-15 19:56:28,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-11-15 19:56:28,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-11-15 19:56:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-11-15 19:56:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:28,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-11-15 19:56:28,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-15 19:56:28,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-11-15 19:56:28,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-15 19:56:28,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-15 19:56:28,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-11-15 19:56:28,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:28,077 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-11-15 19:56:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-11-15 19:56:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-15 19:56:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-15 19:56:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-11-15 19:56:28,099 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-11-15 19:56:28,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:28,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:56:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:56:28,100 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-11-15 19:56:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:28,290 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-11-15 19:56:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:56:28,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-11-15 19:56:28,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-15 19:56:28,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-11-15 19:56:28,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-15 19:56:28,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-15 19:56:28,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-11-15 19:56:28,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:28,315 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-11-15 19:56:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-11-15 19:56:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-11-15 19:56:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 19:56:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-11-15 19:56:28,334 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-15 19:56:28,334 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-15 19:56:28,334 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 19:56:28,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-11-15 19:56:28,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-15 19:56:28,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:28,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:28,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 19:56:28,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 19:56:28,344 INFO L791 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1188#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1189#fibo1ENTRY ~n := #in~n; 1259#L8 assume !(~n < 1); 1257#L10 assume !(1 == ~n); 1180#L13 call #t~ret0 := fibo2(~n - 1);< 1200#fibo2ENTRY ~n := #in~n; 1218#L18 assume !(~n < 1); 1224#L20 assume !(1 == ~n); 1204#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume !(~n < 1); 1256#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1183#fibo2EXIT >#49#return; 1169#L13-1 call #t~ret1 := fibo2(~n - 2);< 1205#fibo2ENTRY ~n := #in~n; 1226#L18 assume !(~n < 1); 1227#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1253#L8 assume !(~n < 1); 1262#L10 assume 1 == ~n;#res := 1; 1263#fibo1FINAL assume true; 1258#fibo1EXIT >#45#return; 1242#L23-1 call #t~ret3 := fibo1(~n - 2);< 1187#fibo1ENTRY ~n := #in~n; 1252#L8 assume !(~n < 1); 1250#L10 assume !(1 == ~n); 1186#L13 call #t~ret0 := fibo2(~n - 1);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume ~n < 1;#res := 0; 1239#fibo2FINAL assume true; 1244#fibo2EXIT >#49#return; 1185#L13-1 call #t~ret1 := fibo2(~n - 2);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume !(~n < 1); 1233#L20 assume 1 == ~n;#res := 1; 1234#fibo2FINAL assume true; 1219#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-15 19:56:28,345 INFO L793 eck$LassoCheckResult]: Loop: 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-15 19:56:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-11-15 19:56:28,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:28,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633845140] [2019-11-15 19:56:28,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:28,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 89 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-15 19:56:28,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633845140] [2019-11-15 19:56:28,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089239785] [2019-11-15 19:56:28,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:28,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:56:28,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-15 19:56:28,999 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:28,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-15 19:56:28,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058816723] [2019-11-15 19:56:29,000 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-11-15 19:56:29,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:29,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178133477] [2019-11-15 19:56:29,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:29,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:29,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 19:56:29,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178133477] [2019-11-15 19:56:29,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667231900] [2019-11-15 19:56:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 19:56:29,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 19:56:29,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:56:29,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-11-15 19:56:29,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405733520] [2019-11-15 19:56:29,303 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:56:29,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:56:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:56:29,305 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-11-15 19:56:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:29,384 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-11-15 19:56:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:56:29,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-11-15 19:56:29,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-15 19:56:29,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-11-15 19:56:29,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-15 19:56:29,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-15 19:56:29,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-11-15 19:56:29,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:29,416 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-11-15 19:56:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-11-15 19:56:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-15 19:56:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 19:56:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-11-15 19:56:29,441 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-15 19:56:29,441 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-15 19:56:29,441 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 19:56:29,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-11-15 19:56:29,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-15 19:56:29,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:29,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:29,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-15 19:56:29,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 19:56:29,450 INFO L791 eck$LassoCheckResult]: Stem: 2260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 2232#L37 call main_#t~ret4 := fibo1(main_~x~0);< 2233#fibo1ENTRY ~n := #in~n; 2266#L8 assume !(~n < 1); 2231#L10 assume !(1 == ~n); 2217#L13 call #t~ret0 := fibo2(~n - 1);< 2245#fibo2ENTRY ~n := #in~n; 2351#L18 assume !(~n < 1); 2350#L20 assume !(1 == ~n); 2216#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume 1 == ~n;#res := 1; 2221#fibo2FINAL assume true; 2223#fibo2EXIT >#49#return; 2248#L13-1 call #t~ret1 := fibo2(~n - 2);< 2250#fibo2ENTRY ~n := #in~n; 2264#L18 assume !(~n < 1); 2268#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2259#L8 assume !(~n < 1); 2303#L10 assume 1 == ~n;#res := 1; 2301#fibo1FINAL assume true; 2300#fibo1EXIT >#45#return; 2229#L23-1 call #t~ret3 := fibo1(~n - 2);< 2227#fibo1ENTRY ~n := #in~n; 2293#L8 assume !(~n < 1); 2292#L10 assume !(1 == ~n); 2226#L13 call #t~ret0 := fibo2(~n - 1);< 2288#fibo2ENTRY ~n := #in~n; 2281#L18 assume !(~n < 1); 2277#L20 assume 1 == ~n;#res := 1; 2278#fibo2FINAL assume true; 2329#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-15 19:56:29,450 INFO L793 eck$LassoCheckResult]: Loop: 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-15 19:56:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-11-15 19:56:29,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:29,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956221481] [2019-11-15 19:56:29,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:29,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:29,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-15 19:56:29,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956221481] [2019-11-15 19:56:29,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888252674] [2019-11-15 19:56:29,832 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:29,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:56:29,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:56:29,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:56:29,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 19:56:30,011 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:30,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-11-15 19:56:30,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772442891] [2019-11-15 19:56:30,012 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-11-15 19:56:30,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:30,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281756878] [2019-11-15 19:56:30,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:30,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:30,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:56:30,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281756878] [2019-11-15 19:56:30,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204520505] [2019-11-15 19:56:30,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 19:56:30,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 19:56:30,445 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:30,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-15 19:56:30,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293730711] [2019-11-15 19:56:30,446 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:56:30,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:30,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 19:56:30,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-15 19:56:30,450 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-11-15 19:56:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:30,817 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-11-15 19:56:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:56:30,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-11-15 19:56:30,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-15 19:56:30,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-11-15 19:56:30,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-15 19:56:30,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-15 19:56:30,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-11-15 19:56:30,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:30,826 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-11-15 19:56:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-11-15 19:56:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-15 19:56:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 19:56:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-11-15 19:56:30,837 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-15 19:56:30,837 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-15 19:56:30,837 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 19:56:30,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-11-15 19:56:30,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-15 19:56:30,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:30,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:30,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:30,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:30,841 INFO L791 eck$LassoCheckResult]: Stem: 3324#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 3300#L37 call main_#t~ret4 := fibo1(main_~x~0);< 3301#fibo1ENTRY ~n := #in~n; 3338#L8 assume !(~n < 1); 3356#L10 assume !(1 == ~n); 3298#L13 call #t~ret0 := fibo2(~n - 1);< 3320#fibo2ENTRY ~n := #in~n; 3330#L18 assume !(~n < 1); 3334#L20 assume !(1 == ~n); 3297#L23 call #t~ret2 := fibo1(~n - 1);< 3299#fibo1ENTRY ~n := #in~n; 3327#L8 assume !(~n < 1); 3399#L10 assume !(1 == ~n); 3336#L13 call #t~ret0 := fibo2(~n - 1);< 3349#fibo2ENTRY ~n := #in~n; 3335#L18 assume !(~n < 1); 3337#L20 assume 1 == ~n;#res := 1; 3401#fibo2FINAL assume true; 3341#fibo2EXIT >#49#return; 3309#L13-1 call #t~ret1 := fibo2(~n - 2);< 3328#fibo2ENTRY ~n := #in~n; 3329#L18 assume ~n < 1;#res := 0; 3308#fibo2FINAL assume true; 3310#fibo2EXIT >#51#return; 3322#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3323#fibo1FINAL assume true; 3402#fibo1EXIT >#45#return; 3311#L23-1 call #t~ret3 := fibo1(~n - 2);< 3312#fibo1ENTRY ~n := #in~n; 3397#L8 assume !(~n < 1); 3395#L10 assume !(1 == ~n); 3293#L13 call #t~ret0 := fibo2(~n - 1);< 3381#fibo2ENTRY ~n := #in~n; 3398#L18 assume !(~n < 1); 3396#L20 assume !(1 == ~n); 3292#L23 [2019-11-15 19:56:30,841 INFO L793 eck$LassoCheckResult]: Loop: 3292#L23 call #t~ret2 := fibo1(~n - 1);< 3294#fibo1ENTRY ~n := #in~n; 3325#L8 assume !(~n < 1); 3332#L10 assume !(1 == ~n); 3296#L13 call #t~ret0 := fibo2(~n - 1);< 3319#fibo2ENTRY ~n := #in~n; 3384#L18 assume !(~n < 1); 3383#L20 assume !(1 == ~n); 3292#L23 [2019-11-15 19:56:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-11-15 19:56:30,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:30,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872730012] [2019-11-15 19:56:30,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:30,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:30,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:56:31,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872730012] [2019-11-15 19:56:31,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868366468] [2019-11-15 19:56:31,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:31,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 19:56:31,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:56:31,278 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:31,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-11-15 19:56:31,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495069811] [2019-11-15 19:56:31,279 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-11-15 19:56:31,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:31,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938905466] [2019-11-15 19:56:31,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:31,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:31,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:31,285 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:31,401 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:31,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:31,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:31,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:31,402 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 19:56:31,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:31,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:31,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration6_Loop [2019-11-15 19:56:31,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:31,403 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:31,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:31,526 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:31,527 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 19:56:31,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,551 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:31,557 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/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 [2019-11-15 19:56:31,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:31,587 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:31,587 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:31,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:31,599 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:31,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:31,608 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:31,618 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:31,618 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:31,632 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:31,632 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:31,639 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:31,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 19:56:31,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:32,846 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 19:56:32,848 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:32,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:32,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:32,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:32,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:32,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:32,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:32,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:32,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration6_Loop [2019-11-15 19:56:32,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:32,849 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:32,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:32,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:32,957 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:32,957 INFO L120 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 [2019-11-15 19:56:32,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:32,960 INFO L120 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 [2019-11-15 19:56:32,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,961 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:32,967 INFO L120 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 [2019-11-15 19:56:32,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:32,973 INFO L120 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 [2019-11-15 19:56:32,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:32,976 INFO L120 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 [2019-11-15 19:56:32,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:32,979 INFO L120 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 [2019-11-15 19:56:32,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:32,982 INFO L120 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 [2019-11-15 19:56:32,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:32,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:32,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:32,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:32,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:32,985 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:32,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:32,988 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:32,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:32,991 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:32,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:32,992 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:56:32,992 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:32,992 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-15 19:56:32,993 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 19:56:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:33,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 19:56:33,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:33,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:33,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:33,177 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 19:56:33,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-15 19:56:33,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 194 states and 238 transitions. Complement of second has 20 states. [2019-11-15 19:56:33,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 19:56:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-15 19:56:33,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-15 19:56:33,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:33,360 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:33,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 19:56:33,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:33,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:33,525 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 19:56:33,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-15 19:56:33,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 251 states and 297 transitions. Complement of second has 33 states. [2019-11-15 19:56:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 19:56:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-11-15 19:56:33,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-15 19:56:33,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:33,758 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:33,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:33,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 19:56:33,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:33,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:33,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:33,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:33,968 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 6 loop predicates [2019-11-15 19:56:33,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-15 19:56:34,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 315 states and 394 transitions. Complement of second has 32 states. [2019-11-15 19:56:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 19:56:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-11-15 19:56:34,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-15 19:56:34,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:34,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-15 19:56:34,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:34,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-11-15 19:56:34,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:34,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-11-15 19:56:34,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-11-15 19:56:34,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-11-15 19:56:34,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-15 19:56:34,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-11-15 19:56:34,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-11-15 19:56:34,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:34,176 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-15 19:56:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-11-15 19:56:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-15 19:56:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 19:56:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-11-15 19:56:34,188 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-11-15 19:56:34,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 19:56:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-15 19:56:34,189 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-11-15 19:56:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:34,534 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-11-15 19:56:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:56:34,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-11-15 19:56:34,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-15 19:56:34,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-11-15 19:56:34,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-15 19:56:34,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-11-15 19:56:34,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-11-15 19:56:34,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:34,543 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-11-15 19:56:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-11-15 19:56:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-15 19:56:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 19:56:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-15 19:56:34,549 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-15 19:56:34,549 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-15 19:56:34,549 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 19:56:34,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-11-15 19:56:34,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-15 19:56:34,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:34,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:34,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:34,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:34,554 INFO L791 eck$LassoCheckResult]: Stem: 5261#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 5240#L37 call main_#t~ret4 := fibo1(main_~x~0);< 5246#fibo1ENTRY ~n := #in~n; 5299#L8 assume !(~n < 1); 5239#L10 assume !(1 == ~n); 5241#L13 call #t~ret0 := fibo2(~n - 1);< 5252#fibo2ENTRY ~n := #in~n; 5265#L18 assume !(~n < 1); 5273#L20 assume !(1 == ~n); 5294#L23 call #t~ret2 := fibo1(~n - 1);< 5296#fibo1ENTRY ~n := #in~n; 5290#L8 assume !(~n < 1); 5295#L10 assume !(1 == ~n); 5231#L13 call #t~ret0 := fibo2(~n - 1);< 5293#fibo2ENTRY ~n := #in~n; 5292#L18 assume !(~n < 1); 5291#L20 assume !(1 == ~n); 5250#L23 call #t~ret2 := fibo1(~n - 1);< 5289#fibo1ENTRY ~n := #in~n; 5284#L8 assume !(~n < 1); 5285#L10 assume !(1 == ~n); 5244#L13 call #t~ret0 := fibo2(~n - 1);< 5251#fibo2ENTRY ~n := #in~n; 5286#L18 assume !(~n < 1); 5267#L20 assume 1 == ~n;#res := 1; 5243#fibo2FINAL assume true; 5245#fibo2EXIT >#49#return; 5254#L13-1 call #t~ret1 := fibo2(~n - 2);< 5255#fibo2ENTRY ~n := #in~n; 5271#L18 assume ~n < 1;#res := 0; 5272#fibo2FINAL assume true; 5342#fibo2EXIT >#51#return; 5256#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5257#fibo1FINAL assume true; 5249#fibo1EXIT >#45#return; 5237#L23-1 call #t~ret3 := fibo1(~n - 2);< 5242#fibo1ENTRY ~n := #in~n; 5258#L8 assume ~n < 1;#res := 0; 5238#fibo1FINAL assume true; 5253#fibo1EXIT >#47#return; 5247#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-15 19:56:34,554 INFO L793 eck$LassoCheckResult]: Loop: 5281#L13-1 call #t~ret1 := fibo2(~n - 2);< 5302#fibo2ENTRY ~n := #in~n; 5279#L18 assume !(~n < 1); 5283#L20 assume !(1 == ~n); 5260#L23 call #t~ret2 := fibo1(~n - 1);< 5235#fibo1ENTRY ~n := #in~n; 5259#L8 assume !(~n < 1); 5266#L10 assume !(1 == ~n); 5234#L13 call #t~ret0 := fibo2(~n - 1);< 5298#fibo2ENTRY ~n := #in~n; 5297#L18 assume !(~n < 1); 5268#L20 assume !(1 == ~n); 5270#L23 call #t~ret2 := fibo1(~n - 1);< 5335#fibo1ENTRY ~n := #in~n; 5339#L8 assume !(~n < 1); 5337#L10 assume 1 == ~n;#res := 1; 5336#fibo1FINAL assume true; 5333#fibo1EXIT >#45#return; 5320#L23-1 call #t~ret3 := fibo1(~n - 2);< 5322#fibo1ENTRY ~n := #in~n; 5326#L8 assume ~n < 1;#res := 0; 5324#fibo1FINAL assume true; 5319#fibo1EXIT >#47#return; 5316#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-15 19:56:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-11-15 19:56:34,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:34,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332687324] [2019-11-15 19:56:34,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:34,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:34,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 19:56:34,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332687324] [2019-11-15 19:56:34,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239373359] [2019-11-15 19:56:34,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:34,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:56:34,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 19:56:34,924 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:34,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-11-15 19:56:34,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314495071] [2019-11-15 19:56:34,925 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-11-15 19:56:34,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:34,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467961438] [2019-11-15 19:56:34,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:34,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:34,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:34,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:35,157 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:35,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:35,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:35,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:35,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 19:56:35,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:35,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:35,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:35,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration7_Loop [2019-11-15 19:56:35,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:35,158 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:35,222 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:35,222 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:35,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:35,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:35,228 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:35,229 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:35,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:35,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:35,236 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:35,236 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:35,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:35,240 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:35,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 19:56:35,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:36,154 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 19:56:36,156 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:36,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:36,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:36,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:36,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:36,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:36,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:36,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:36,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration7_Loop [2019-11-15 19:56:36,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:36,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:36,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:36,217 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:36,217 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:36,217 INFO L120 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 [2019-11-15 19:56:36,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:36,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:36,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:36,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:36,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:36,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:36,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:36,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:36,220 INFO L120 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 [2019-11-15 19:56:36,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:36,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:36,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:36,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:36,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:36,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:36,221 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:36,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:36,222 INFO L120 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 [2019-11-15 19:56:36,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:36,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:36,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:36,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:36,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:36,223 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:36,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:36,225 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:36,227 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:36,227 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:36,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:36,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:56:36,228 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:36,228 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-15 19:56:36,228 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 19:56:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:36,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 19:56:36,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:36,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:36,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:36,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:36,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 19:56:36,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 19:56:36,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-15 19:56:36,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-15 19:56:36,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 364 states and 473 transitions. Complement of second has 40 states. [2019-11-15 19:56:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 19:56:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-11-15 19:56:36,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-15 19:56:36,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:36,939 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:37,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 19:56:37,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:37,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:37,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 19:56:37,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 19:56:37,150 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-15 19:56:37,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-15 19:56:37,449 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 242 states and 301 transitions. Complement of second has 26 states. [2019-11-15 19:56:37,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 19:56:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-11-15 19:56:37,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-15 19:56:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:37,452 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:37,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 19:56:37,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:37,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:37,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 19:56:37,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 19:56:37,682 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 8 loop predicates [2019-11-15 19:56:37,682 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-15 19:56:38,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 579 states and 748 transitions. Complement of second has 119 states. [2019-11-15 19:56:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 19:56:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-11-15 19:56:38,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-15 19:56:38,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:38,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-11-15 19:56:38,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:38,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-15 19:56:38,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:38,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-11-15 19:56:38,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-15 19:56:38,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-11-15 19:56:38,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-15 19:56:38,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-15 19:56:38,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-11-15 19:56:38,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:38,141 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-11-15 19:56:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-11-15 19:56:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-11-15 19:56:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-15 19:56:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-11-15 19:56:38,167 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-11-15 19:56:38,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:38,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 19:56:38,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-15 19:56:38,168 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-11-15 19:56:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:38,685 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-11-15 19:56:38,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 19:56:38,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-11-15 19:56:38,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-15 19:56:38,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-11-15 19:56:38,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-11-15 19:56:38,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-11-15 19:56:38,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-11-15 19:56:38,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:38,703 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-11-15 19:56:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-11-15 19:56:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-11-15 19:56:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-15 19:56:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-11-15 19:56:38,725 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-15 19:56:38,725 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-15 19:56:38,725 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 19:56:38,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-11-15 19:56:38,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-15 19:56:38,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:38,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:38,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:38,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-15 19:56:38,735 INFO L791 eck$LassoCheckResult]: Stem: 8604#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8567#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8568#fibo1ENTRY ~n := #in~n; 8646#L8 assume !(~n < 1); 8645#L10 assume !(1 == ~n); 8637#L13 call #t~ret0 := fibo2(~n - 1);< 8644#fibo2ENTRY ~n := #in~n; 8643#L18 assume !(~n < 1); 8642#L20 assume !(1 == ~n); 8639#L23 call #t~ret2 := fibo1(~n - 1);< 8641#fibo1ENTRY ~n := #in~n; 8640#L8 assume !(~n < 1); 8638#L10 assume !(1 == ~n); 8631#L13 call #t~ret0 := fibo2(~n - 1);< 8636#fibo2ENTRY ~n := #in~n; 8635#L18 assume !(~n < 1); 8633#L20 assume !(1 == ~n); 8577#L23 call #t~ret2 := fibo1(~n - 1);< 8627#fibo1ENTRY ~n := #in~n; 8628#L8 assume !(~n < 1); 8722#L10 assume !(1 == ~n); 8632#L13 call #t~ret0 := fibo2(~n - 1);< 8636#fibo2ENTRY ~n := #in~n; 8635#L18 assume !(~n < 1); 8633#L20 assume !(1 == ~n); 8577#L23 call #t~ret2 := fibo1(~n - 1);< 8627#fibo1ENTRY ~n := #in~n; 8625#L8 assume !(~n < 1); 8626#L10 assume !(1 == ~n); 8576#L13 call #t~ret0 := fibo2(~n - 1);< 8578#fibo2ENTRY ~n := #in~n; 8824#L18 assume !(~n < 1); 8823#L20 assume 1 == ~n;#res := 1; 8822#fibo2FINAL assume true; 8819#fibo2EXIT >#49#return; 8815#L13-1 call #t~ret1 := fibo2(~n - 2);< 8816#fibo2ENTRY ~n := #in~n; 8821#L18 assume ~n < 1;#res := 0; 8818#fibo2FINAL assume true; 8814#fibo2EXIT >#51#return; 8813#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8812#fibo1FINAL assume true; 8809#fibo1EXIT >#45#return; 8806#L23-1 call #t~ret3 := fibo1(~n - 2);< 8807#fibo1ENTRY ~n := #in~n; 8845#L8 assume ~n < 1;#res := 0; 8844#fibo1FINAL assume true; 8805#fibo1EXIT >#47#return; 8802#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8800#fibo2FINAL assume true; 8719#fibo2EXIT >#49#return; 8669#L13-1 [2019-11-15 19:56:38,735 INFO L793 eck$LassoCheckResult]: Loop: 8669#L13-1 call #t~ret1 := fibo2(~n - 2);< 8595#fibo2ENTRY ~n := #in~n; 8693#L18 assume !(~n < 1); 8689#L20 assume !(1 == ~n); 8594#L23 call #t~ret2 := fibo1(~n - 1);< 8671#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8749#fibo2ENTRY ~n := #in~n; 8792#L18 assume !(~n < 1); 8787#L20 assume !(1 == ~n); 8788#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8855#L8 assume !(~n < 1); 8854#L10 assume 1 == ~n;#res := 1; 8853#fibo1FINAL assume true; 8852#fibo1EXIT >#45#return; 8560#L23-1 call #t~ret3 := fibo1(~n - 2);< 8556#fibo1ENTRY ~n := #in~n; 8613#L8 assume ~n < 1;#res := 0; 8562#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8653#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8748#fibo2EXIT >#49#return; 8741#L13-1 call #t~ret1 := fibo2(~n - 2);< 8742#fibo2ENTRY ~n := #in~n; 8782#L18 assume ~n < 1;#res := 0; 8772#fibo2FINAL assume true; 8766#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8708#fibo1FINAL assume true; 8709#fibo1EXIT >#45#return; 8622#L23-1 call #t~ret3 := fibo1(~n - 2);< 8629#fibo1ENTRY ~n := #in~n; 8630#L8 assume !(~n < 1); 8620#L10 assume !(1 == ~n); 8624#L13 call #t~ret0 := fibo2(~n - 1);< 8698#fibo2ENTRY ~n := #in~n; 8692#L18 assume !(~n < 1); 8687#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8667#fibo1ENTRY ~n := #in~n; 8780#L8 assume !(~n < 1); 8777#L10 assume 1 == ~n;#res := 1; 8774#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8744#L23-1 call #t~ret3 := fibo1(~n - 2);< 8747#fibo1ENTRY ~n := #in~n; 8803#L8 assume ~n < 1;#res := 0; 8801#fibo1FINAL assume true; 8743#fibo1EXIT >#47#return; 8738#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8726#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8669#L13-1 [2019-11-15 19:56:38,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-11-15 19:56:38,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:38,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616538301] [2019-11-15 19:56:38,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:38,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:38,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:56:39,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616538301] [2019-11-15 19:56:39,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057628107] [2019-11-15 19:56:39,014 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:39,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:56:39,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:56:39,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 19:56:39,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 19:56:39,148 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:39,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-11-15 19:56:39,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491196722] [2019-11-15 19:56:39,149 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash -564433099, now seen corresponding path program 1 times [2019-11-15 19:56:39,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:39,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237234236] [2019-11-15 19:56:39,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:39,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:39,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 19:56:39,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237234236] [2019-11-15 19:56:39,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237809403] [2019-11-15 19:56:39,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:56:39,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 19:56:39,465 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:39,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-11-15 19:56:39,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062079565] [2019-11-15 19:56:39,466 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:56:39,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 19:56:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:56:39,467 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-11-15 19:56:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:40,058 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-11-15 19:56:40,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 19:56:40,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-11-15 19:56:40,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-15 19:56:40,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-11-15 19:56:40,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-11-15 19:56:40,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-11-15 19:56:40,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-11-15 19:56:40,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:40,118 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-11-15 19:56:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-11-15 19:56:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-11-15 19:56:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-15 19:56:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-11-15 19:56:40,140 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-15 19:56:40,140 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-15 19:56:40,140 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 19:56:40,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-11-15 19:56:40,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-15 19:56:40,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:40,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:40,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:40,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:40,149 INFO L791 eck$LassoCheckResult]: Stem: 10062#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10007#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10008#fibo1ENTRY ~n := #in~n; 10260#L8 assume !(~n < 1); 10239#L10 assume !(1 == ~n); 10240#L13 call #t~ret0 := fibo2(~n - 1);< 10263#fibo2ENTRY ~n := #in~n; 10262#L18 assume !(~n < 1); 10261#L20 assume !(1 == ~n); 10237#L23 call #t~ret2 := fibo1(~n - 1);< 10259#fibo1ENTRY ~n := #in~n; 10253#L8 assume !(~n < 1); 10254#L10 assume !(1 == ~n); 10236#L13 call #t~ret0 := fibo2(~n - 1);< 10238#fibo2ENTRY ~n := #in~n; 10276#L18 assume !(~n < 1); 10274#L20 assume !(1 == ~n); 10252#L23 call #t~ret2 := fibo1(~n - 1);< 10264#fibo1ENTRY ~n := #in~n; 10265#L8 assume !(~n < 1); 10251#L10 assume !(1 == ~n); 10004#L13 call #t~ret0 := fibo2(~n - 1);< 10235#fibo2ENTRY ~n := #in~n; 10299#L18 assume !(~n < 1); 10295#L20 assume !(1 == ~n); 10296#L23 call #t~ret2 := fibo1(~n - 1);< 10453#fibo1ENTRY ~n := #in~n; 10456#L8 assume !(~n < 1); 10455#L10 assume 1 == ~n;#res := 1; 10454#fibo1FINAL assume true; 10452#fibo1EXIT >#45#return; 10377#L23-1 call #t~ret3 := fibo1(~n - 2);< 10379#fibo1ENTRY ~n := #in~n; 10402#L8 assume !(~n < 1); 10403#L10 assume 1 == ~n;#res := 1; 10440#fibo1FINAL assume true; 10439#fibo1EXIT >#47#return; 10437#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10435#fibo2FINAL assume true; 10369#fibo2EXIT >#49#return; 10027#L13-1 call #t~ret1 := fibo2(~n - 2);< 10051#fibo2ENTRY ~n := #in~n; 10159#L18 assume !(~n < 1); 10157#L20 assume !(1 == ~n); 10050#L23 [2019-11-15 19:56:40,149 INFO L793 eck$LassoCheckResult]: Loop: 10050#L23 call #t~ret2 := fibo1(~n - 1);< 10129#fibo1ENTRY ~n := #in~n; 10125#L8 assume !(~n < 1); 10122#L10 assume !(1 == ~n); 10030#L13 call #t~ret0 := fibo2(~n - 1);< 10118#fibo2ENTRY ~n := #in~n; 10225#L18 assume !(~n < 1); 10224#L20 assume !(1 == ~n); 10175#L23 call #t~ret2 := fibo1(~n - 1);< 10179#fibo1ENTRY ~n := #in~n; 10191#L8 assume !(~n < 1); 10190#L10 assume 1 == ~n;#res := 1; 10183#fibo1FINAL assume true; 10173#fibo1EXIT >#45#return; 10029#L23-1 call #t~ret3 := fibo1(~n - 2);< 10032#fibo1ENTRY ~n := #in~n; 10215#L8 assume ~n < 1;#res := 0; 10044#fibo1FINAL assume true; 10047#fibo1EXIT >#47#return; 10222#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 10223#fibo2FINAL assume true; 10077#fibo2EXIT >#49#return; 10022#L13-1 call #t~ret1 := fibo2(~n - 2);< 10051#fibo2ENTRY ~n := #in~n; 10159#L18 assume !(~n < 1); 10157#L20 assume !(1 == ~n); 10050#L23 [2019-11-15 19:56:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-11-15 19:56:40,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:40,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376184862] [2019-11-15 19:56:40,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:40,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:40,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:56:40,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376184862] [2019-11-15 19:56:40,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442678179] [2019-11-15 19:56:40,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 19:56:40,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:56:40,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:40,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-11-15 19:56:40,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027024853] [2019-11-15 19:56:40,678 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-11-15 19:56:40,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:40,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521531487] [2019-11-15 19:56:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:40,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 19:56:40,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521531487] [2019-11-15 19:56:40,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524207596] [2019-11-15 19:56:40,791 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:40,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:56:40,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:56:40,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 19:56:40,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 19:56:40,943 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:40,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-15 19:56:40,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655270263] [2019-11-15 19:56:40,944 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:56:40,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:40,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 19:56:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:56:40,944 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-11-15 19:56:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:41,155 INFO L93 Difference]: Finished difference Result 549 states and 744 transitions. [2019-11-15 19:56:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 19:56:41,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 744 transitions. [2019-11-15 19:56:41,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-15 19:56:41,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 524 states and 708 transitions. [2019-11-15 19:56:41,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2019-11-15 19:56:41,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-15 19:56:41,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 708 transitions. [2019-11-15 19:56:41,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:41,178 INFO L688 BuchiCegarLoop]: Abstraction has 524 states and 708 transitions. [2019-11-15 19:56:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 708 transitions. [2019-11-15 19:56:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2019-11-15 19:56:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-15 19:56:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2019-11-15 19:56:41,202 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-15 19:56:41,202 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-15 19:56:41,202 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 19:56:41,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 661 transitions. [2019-11-15 19:56:41,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-15 19:56:41,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:41,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:41,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:41,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-15 19:56:41,214 INFO L791 eck$LassoCheckResult]: Stem: 11401#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 11363#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11364#fibo1ENTRY ~n := #in~n; 11594#L8 assume !(~n < 1); 11585#L10 assume !(1 == ~n); 11586#L13 call #t~ret0 := fibo2(~n - 1);< 11598#fibo2ENTRY ~n := #in~n; 11597#L18 assume !(~n < 1); 11596#L20 assume !(1 == ~n); 11576#L23 call #t~ret2 := fibo1(~n - 1);< 11595#fibo1ENTRY ~n := #in~n; 11588#L8 assume !(~n < 1); 11589#L10 assume !(1 == ~n); 11567#L13 call #t~ret0 := fibo2(~n - 1);< 11577#fibo2ENTRY ~n := #in~n; 11621#L18 assume !(~n < 1); 11620#L20 assume !(1 == ~n); 11574#L23 call #t~ret2 := fibo1(~n - 1);< 11618#fibo1ENTRY ~n := #in~n; 11757#L8 assume !(~n < 1); 11755#L10 assume !(1 == ~n); 11573#L13 call #t~ret0 := fibo2(~n - 1);< 11575#fibo2ENTRY ~n := #in~n; 11693#L18 assume !(~n < 1); 11692#L20 assume !(1 == ~n); 11690#L23 call #t~ret2 := fibo1(~n - 1);< 11691#fibo1ENTRY ~n := #in~n; 11696#L8 assume !(~n < 1); 11695#L10 assume 1 == ~n;#res := 1; 11694#fibo1FINAL assume true; 11689#fibo1EXIT >#45#return; 11685#L23-1 call #t~ret3 := fibo1(~n - 2);< 11688#fibo1ENTRY ~n := #in~n; 11758#L8 assume !(~n < 1); 11700#L10 assume 1 == ~n;#res := 1; 11697#fibo1FINAL assume true; 11684#fibo1EXIT >#47#return; 11683#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11681#fibo2FINAL assume true; 11679#fibo2EXIT >#49#return; 11632#L13-1 call #t~ret1 := fibo2(~n - 2);< 11584#fibo2ENTRY ~n := #in~n; 11770#L18 assume ~n < 1;#res := 0; 11660#fibo2FINAL assume true; 11631#fibo2EXIT >#51#return; 11635#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11640#fibo1FINAL assume true; 11614#fibo1EXIT >#45#return; 11583#L23-1 call #t~ret3 := fibo1(~n - 2);< 11611#fibo1ENTRY ~n := #in~n; 11756#L8 assume !(~n < 1); 11754#L10 assume !(1 == ~n); 11561#L13 [2019-11-15 19:56:41,216 INFO L793 eck$LassoCheckResult]: Loop: 11561#L13 call #t~ret0 := fibo2(~n - 1);< 11569#fibo2ENTRY ~n := #in~n; 11619#L18 assume !(~n < 1); 11612#L20 assume !(1 == ~n); 11571#L23 call #t~ret2 := fibo1(~n - 1);< 11603#fibo1ENTRY ~n := #in~n; 11760#L8 assume !(~n < 1); 11753#L10 assume !(1 == ~n); 11562#L13 call #t~ret0 := fibo2(~n - 1);< 11572#fibo2ENTRY ~n := #in~n; 11629#L18 assume !(~n < 1); 11625#L20 assume !(1 == ~n); 11570#L23 call #t~ret2 := fibo1(~n - 1);< 11603#fibo1ENTRY ~n := #in~n; 11760#L8 assume !(~n < 1); 11753#L10 assume !(1 == ~n); 11562#L13 call #t~ret0 := fibo2(~n - 1);< 11572#fibo2ENTRY ~n := #in~n; 11629#L18 assume !(~n < 1); 11625#L20 assume 1 == ~n;#res := 1; 11626#fibo2FINAL assume true; 11670#fibo2EXIT >#49#return; 11633#L13-1 call #t~ret1 := fibo2(~n - 2);< 11637#fibo2ENTRY ~n := #in~n; 11675#L18 assume ~n < 1;#res := 0; 11660#fibo2FINAL assume true; 11631#fibo2EXIT >#51#return; 11630#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11628#fibo1FINAL assume true; 11624#fibo1EXIT >#45#return; 11591#L23-1 call #t~ret3 := fibo1(~n - 2);< 11593#fibo1ENTRY ~n := #in~n; 11642#L8 assume !(~n < 1); 11638#L10 assume 1 == ~n;#res := 1; 11608#fibo1FINAL assume true; 11590#fibo1EXIT >#47#return; 11592#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11682#fibo2FINAL assume true; 11560#fibo2EXIT >#49#return; 11540#L13-1 call #t~ret1 := fibo2(~n - 2);< 11386#fibo2ENTRY ~n := #in~n; 11622#L18 assume !(~n < 1); 11538#L20 assume !(1 == ~n); 11385#L23 call #t~ret2 := fibo1(~n - 1);< 11607#fibo1ENTRY ~n := #in~n; 11734#L8 assume !(~n < 1); 11732#L10 assume 1 == ~n;#res := 1; 11730#fibo1FINAL assume true; 11720#fibo1EXIT >#45#return; 11718#L23-1 call #t~ret3 := fibo1(~n - 2);< 11719#fibo1ENTRY ~n := #in~n; 11735#L8 assume ~n < 1;#res := 0; 11736#fibo1FINAL assume true; 11744#fibo1EXIT >#47#return; 11743#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11737#fibo2FINAL assume true; 11661#fibo2EXIT >#51#return; 11564#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11609#fibo1FINAL assume true; 11602#fibo1EXIT >#45#return; 11582#L23-1 call #t~ret3 := fibo1(~n - 2);< 11610#fibo1ENTRY ~n := #in~n; 11672#L8 assume !(~n < 1); 11639#L10 assume !(1 == ~n); 11561#L13 [2019-11-15 19:56:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash 783666534, now seen corresponding path program 1 times [2019-11-15 19:56:41,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:41,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694368516] [2019-11-15 19:56:41,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:41,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:41,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:56:41,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694368516] [2019-11-15 19:56:41,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026784818] [2019-11-15 19:56:41,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 19:56:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 19:56:41,536 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:41,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-11-15 19:56:41,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014868116] [2019-11-15 19:56:41,537 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash 41147773, now seen corresponding path program 1 times [2019-11-15 19:56:41,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:41,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557680455] [2019-11-15 19:56:41,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:41,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:41,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:41,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:42,183 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:42,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:42,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:42,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:42,184 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 19:56:42,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:42,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:42,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration10_Loop [2019-11-15 19:56:42,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:42,184 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:42,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:42,289 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:42,289 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:42,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:42,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:42,296 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:42,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:42,304 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:42,304 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:42,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:42,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:42,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:42,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:42,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:42,320 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:42,326 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:42,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 19:56:42,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:44,283 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 19:56:44,285 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:44,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:44,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:44,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:44,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:44,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:44,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:44,286 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:44,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration10_Loop [2019-11-15 19:56:44,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:44,286 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:44,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:44,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:44,385 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:44,385 INFO L120 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 [2019-11-15 19:56:44,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:44,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:44,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:44,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:44,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:44,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:44,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:44,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:44,387 INFO L120 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 [2019-11-15 19:56:44,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:44,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:44,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:44,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:44,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:44,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:44,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:44,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:44,388 INFO L120 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 [2019-11-15 19:56:44,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:44,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:44,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:44,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:44,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:44,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:44,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:44,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:44,390 INFO L120 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 [2019-11-15 19:56:44,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:44,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:44,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:44,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:44,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:44,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:44,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:44,394 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:44,396 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:44,396 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:44,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:44,397 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:56:44,397 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:44,397 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-15 19:56:44,398 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 19:56:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:44,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 19:56:44,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:44,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:44,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:44,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:44,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:44,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 19:56:44,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 19:56:44,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2019-11-15 19:56:44,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 14 states. [2019-11-15 19:56:45,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 661 transitions. cyclomatic complexity: 170. Second operand 14 states. Result 1735 states and 2335 transitions. Complement of second has 65 states. [2019-11-15 19:56:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 19:56:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2019-11-15 19:56:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 52 letters. Loop has 64 letters. [2019-11-15 19:56:45,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:45,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:45,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 19:56:45,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:45,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:45,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:45,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 19:56:45,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 19:56:45,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2019-11-15 19:56:45,961 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 14 states. [2019-11-15 19:56:46,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 661 transitions. cyclomatic complexity: 170. Second operand 14 states. Result 1771 states and 2383 transitions. Complement of second has 69 states. [2019-11-15 19:56:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 19:56:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-15 19:56:46,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 52 letters. Loop has 64 letters. [2019-11-15 19:56:46,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:46,852 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:46,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 19:56:46,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:46,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:46,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:46,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:46,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:47,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 19:56:47,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 19:56:47,301 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 12 loop predicates [2019-11-15 19:56:47,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 14 states. [2019-11-15 19:56:48,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 661 transitions. cyclomatic complexity: 170. Second operand 14 states. Result 3836 states and 5105 transitions. Complement of second has 185 states. [2019-11-15 19:56:48,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 19:56:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2019-11-15 19:56:48,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 52 letters. Loop has 64 letters. [2019-11-15 19:56:48,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:48,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 116 letters. Loop has 64 letters. [2019-11-15 19:56:48,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 52 letters. Loop has 128 letters. [2019-11-15 19:56:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:48,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3836 states and 5105 transitions. [2019-11-15 19:56:48,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2019-11-15 19:56:48,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3836 states to 2436 states and 3272 transitions. [2019-11-15 19:56:48,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 504 [2019-11-15 19:56:48,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2019-11-15 19:56:48,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2436 states and 3272 transitions. [2019-11-15 19:56:48,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:48,132 INFO L688 BuchiCegarLoop]: Abstraction has 2436 states and 3272 transitions. [2019-11-15 19:56:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states and 3272 transitions. [2019-11-15 19:56:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2096. [2019-11-15 19:56:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-11-15 19:56:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2696 transitions. [2019-11-15 19:56:48,209 INFO L711 BuchiCegarLoop]: Abstraction has 2096 states and 2696 transitions. [2019-11-15 19:56:48,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 19:56:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-11-15 19:56:48,210 INFO L87 Difference]: Start difference. First operand 2096 states and 2696 transitions. Second operand 20 states. [2019-11-15 19:56:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:49,033 INFO L93 Difference]: Finished difference Result 2246 states and 2902 transitions. [2019-11-15 19:56:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 19:56:49,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2246 states and 2902 transitions. [2019-11-15 19:56:49,058 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-15 19:56:49,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2246 states to 2189 states and 2845 transitions. [2019-11-15 19:56:49,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2019-11-15 19:56:49,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2019-11-15 19:56:49,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2189 states and 2845 transitions. [2019-11-15 19:56:49,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:49,089 INFO L688 BuchiCegarLoop]: Abstraction has 2189 states and 2845 transitions. [2019-11-15 19:56:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states and 2845 transitions. [2019-11-15 19:56:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2063. [2019-11-15 19:56:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-15 19:56:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2633 transitions. [2019-11-15 19:56:49,151 INFO L711 BuchiCegarLoop]: Abstraction has 2063 states and 2633 transitions. [2019-11-15 19:56:49,151 INFO L591 BuchiCegarLoop]: Abstraction has 2063 states and 2633 transitions. [2019-11-15 19:56:49,151 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 19:56:49,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2063 states and 2633 transitions. [2019-11-15 19:56:49,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-15 19:56:49,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:49,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:49,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:49,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:49,170 INFO L791 eck$LassoCheckResult]: Stem: 25321#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 25288#L37 call main_#t~ret4 := fibo1(main_~x~0);< 25289#fibo1ENTRY ~n := #in~n; 25381#L8 assume !(~n < 1); 25380#L10 assume !(1 == ~n); 25353#L13 call #t~ret0 := fibo2(~n - 1);< 25378#fibo2ENTRY ~n := #in~n; 25377#L18 assume !(~n < 1); 25376#L20 assume !(1 == ~n); 25372#L23 call #t~ret2 := fibo1(~n - 1);< 25375#fibo1ENTRY ~n := #in~n; 25374#L8 assume !(~n < 1); 25373#L10 assume !(1 == ~n); 25368#L13 call #t~ret0 := fibo2(~n - 1);< 25371#fibo2ENTRY ~n := #in~n; 25370#L18 assume !(~n < 1); 25369#L20 assume !(1 == ~n); 25365#L23 call #t~ret2 := fibo1(~n - 1);< 25367#fibo1ENTRY ~n := #in~n; 25359#L8 assume !(~n < 1); 25366#L10 assume !(1 == ~n); 25361#L13 call #t~ret0 := fibo2(~n - 1);< 25364#fibo2ENTRY ~n := #in~n; 25363#L18 assume !(~n < 1); 25362#L20 assume !(1 == ~n); 25300#L23 call #t~ret2 := fibo1(~n - 1);< 25358#fibo1ENTRY ~n := #in~n; 25360#L8 assume !(~n < 1); 25344#L10 assume !(1 == ~n); 25299#L13 call #t~ret0 := fibo2(~n - 1);< 25301#fibo2ENTRY ~n := #in~n; 26425#L18 assume !(~n < 1); 26424#L20 assume 1 == ~n;#res := 1; 26422#fibo2FINAL assume true; 26420#fibo2EXIT >#49#return; 26417#L13-1 call #t~ret1 := fibo2(~n - 2);< 26418#fibo2ENTRY ~n := #in~n; 26588#L18 assume ~n < 1;#res := 0; 26587#fibo2FINAL assume true; 26416#fibo2EXIT >#51#return; 26414#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 26412#fibo1FINAL assume true; 26410#fibo1EXIT >#45#return; 26257#L23-1 call #t~ret3 := fibo1(~n - 2);< 26258#fibo1ENTRY ~n := #in~n; 26270#L8 assume !(~n < 1); 26268#L10 assume 1 == ~n;#res := 1; 26266#fibo1FINAL assume true; 26256#fibo1EXIT >#47#return; 26249#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 26246#fibo2FINAL assume true; 26243#fibo2EXIT >#49#return; 26236#L13-1 call #t~ret1 := fibo2(~n - 2);< 26240#fibo2ENTRY ~n := #in~n; 26239#L18 assume !(~n < 1); 26237#L20 assume !(1 == ~n); 25868#L23 call #t~ret2 := fibo1(~n - 1);< 26234#fibo1ENTRY ~n := #in~n; 26232#L8 assume !(~n < 1); 26101#L10 assume !(1 == ~n); 25839#L13 call #t~ret0 := fibo2(~n - 1);< 25869#fibo2ENTRY ~n := #in~n; 25853#L18 assume !(~n < 1); 25854#L20 assume !(1 == ~n); 25821#L23 call #t~ret2 := fibo1(~n - 1);< 25835#fibo1ENTRY ~n := #in~n; 25834#L8 assume !(~n < 1); 25832#L10 assume !(1 == ~n); 25825#L13 [2019-11-15 19:56:49,170 INFO L793 eck$LassoCheckResult]: Loop: 25825#L13 call #t~ret0 := fibo2(~n - 1);< 25826#fibo2ENTRY ~n := #in~n; 25833#L18 assume !(~n < 1); 25831#L20 assume !(1 == ~n); 25822#L23 call #t~ret2 := fibo1(~n - 1);< 25835#fibo1ENTRY ~n := #in~n; 25834#L8 assume !(~n < 1); 25832#L10 assume !(1 == ~n); 25825#L13 [2019-11-15 19:56:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 902409038, now seen corresponding path program 3 times [2019-11-15 19:56:49,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:49,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740141954] [2019-11-15 19:56:49,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:49,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:49,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 91 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 19:56:49,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740141954] [2019-11-15 19:56:49,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354998025] [2019-11-15 19:56:49,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:49,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 19:56:49,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:56:49,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:56:49,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 87 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 19:56:49,735 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:49,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2019-11-15 19:56:49,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471458965] [2019-11-15 19:56:49,736 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:56:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 3 times [2019-11-15 19:56:49,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:49,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668726682] [2019-11-15 19:56:49,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:49,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:49,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:49,748 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:49,872 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:49,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:49,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:49,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:49,872 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 19:56:49,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:49,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:49,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:49,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration11_Loop [2019-11-15 19:56:49,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:49,873 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:49,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:49,974 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:49,975 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:49,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:49,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:49,984 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:49,984 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:49,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:49,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:49,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:49,991 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:49,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:49,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:50,001 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:50,002 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:50,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:50,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:50,009 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 19:56:50,009 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:50,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 19:56:50,015 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98242d0-67e4-4288-a27f-247436e96f0d/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:50,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 19:56:50,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 19:56:53,617 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 19:56:53,619 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:53,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:53,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:53,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:53,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:53,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:53,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:53,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:53,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-2.c_Iteration11_Loop [2019-11-15 19:56:53,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:53,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:53,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:53,712 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:53,712 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:53,713 INFO L120 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 [2019-11-15 19:56:53,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:53,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:53,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:53,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:53,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:53,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:53,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:53,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:53,718 INFO L120 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 [2019-11-15 19:56:53,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:53,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:53,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:53,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:53,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:53,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:53,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:53,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:53,720 INFO L120 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 [2019-11-15 19:56:53,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:53,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:53,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:53,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:53,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:53,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:53,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:53,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:53,722 INFO L120 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 [2019-11-15 19:56:53,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:53,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:53,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:53,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:53,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:53,723 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:53,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:53,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:53,724 INFO L120 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 [2019-11-15 19:56:53,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:53,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:53,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:53,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:53,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:53,725 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:53,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:53,727 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:53,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:53,729 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:53,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:53,729 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:56:53,729 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:53,729 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-15 19:56:53,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 19:56:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:53,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 19:56:53,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:53,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:53,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:53,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:53,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:53,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:53,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:53,945 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 19:56:53,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2633 transitions. cyclomatic complexity: 584 Second operand 8 states. [2019-11-15 19:56:54,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2633 transitions. cyclomatic complexity: 584. Second operand 8 states. Result 2132 states and 2704 transitions. Complement of second has 19 states. [2019-11-15 19:56:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 19:56:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-15 19:56:54,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-15 19:56:54,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:54,069 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:54,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 19:56:54,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:54,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:54,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:54,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:54,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 19:56:54,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2633 transitions. cyclomatic complexity: 584 Second operand 8 states. [2019-11-15 19:56:54,528 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2633 transitions. cyclomatic complexity: 584. Second operand 8 states. Result 2138 states and 2710 transitions. Complement of second has 27 states. [2019-11-15 19:56:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 19:56:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2019-11-15 19:56:54,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-15 19:56:54,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:54,530 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:56:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:54,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 19:56:54,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:54,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:54,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 19:56:54,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:54,785 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 19:56:54,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2633 transitions. cyclomatic complexity: 584 Second operand 8 states. [2019-11-15 19:56:54,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2633 transitions. cyclomatic complexity: 584. Second operand 8 states. Result 2872 states and 3588 transitions. Complement of second has 33 states. [2019-11-15 19:56:54,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 19:56:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 19:56:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2019-11-15 19:56:54,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-15 19:56:54,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:54,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 76 letters. Loop has 8 letters. [2019-11-15 19:56:54,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:54,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 68 letters. Loop has 16 letters. [2019-11-15 19:56:54,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:56:54,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2872 states and 3588 transitions. [2019-11-15 19:56:55,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-15 19:56:55,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2872 states to 2230 states and 2836 transitions. [2019-11-15 19:56:55,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2019-11-15 19:56:55,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2019-11-15 19:56:55,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2230 states and 2836 transitions. [2019-11-15 19:56:55,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:56:55,034 INFO L688 BuchiCegarLoop]: Abstraction has 2230 states and 2836 transitions. [2019-11-15 19:56:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states and 2836 transitions. [2019-11-15 19:56:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2106. [2019-11-15 19:56:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-11-15 19:56:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2646 transitions. [2019-11-15 19:56:55,096 INFO L711 BuchiCegarLoop]: Abstraction has 2106 states and 2646 transitions. [2019-11-15 19:56:55,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 19:56:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-11-15 19:56:55,097 INFO L87 Difference]: Start difference. First operand 2106 states and 2646 transitions. Second operand 25 states. [2019-11-15 19:56:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:55,818 INFO L93 Difference]: Finished difference Result 1672 states and 2010 transitions. [2019-11-15 19:56:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 19:56:55,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1672 states and 2010 transitions. [2019-11-15 19:56:55,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:56:55,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1672 states to 0 states and 0 transitions. [2019-11-15 19:56:55,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 19:56:55,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 19:56:55,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 19:56:55,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:56:55,837 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:56:55,837 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:56:55,838 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:56:55,838 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 19:56:55,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 19:56:55,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:56:55,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 19:56:55,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 07:56:55 BoogieIcfgContainer [2019-11-15 19:56:55,846 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 19:56:55,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:56:55,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:56:55,847 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:56:55,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:22" (3/4) ... [2019-11-15 19:56:55,851 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 19:56:55,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:56:55,853 INFO L168 Benchmark]: Toolchain (without parser) took 33686.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 946.1 MB in the beginning and 1.3 GB in the end (delta: -359.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:56:55,854 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:56:55,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -203.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:56:55,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:56:55,855 INFO L168 Benchmark]: Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:56:55,856 INFO L168 Benchmark]: RCFGBuilder took 308.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 19:56:55,856 INFO L168 Benchmark]: BuchiAutomizer took 32890.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:56:55,857 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:56:55,859 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -203.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 308.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32890.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (10 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function n and consists of 15 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 10 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.8s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 18.7s. Construction of modules took 4.5s. Büchi inclusion checks took 8.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 805 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 2063 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 55/126 HoareTripleCheckerStatistics: 527 SDtfs, 1287 SDslu, 1881 SDs, 0 SdLazy, 4837 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI5 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf99 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp80 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...