./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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 cd6d4490a7412402195d3193de0347508566f7c8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:46:58,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:58,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:58,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:58,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:58,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:58,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:58,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:58,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:58,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:58,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:58,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:58,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:58,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:58,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:58,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:58,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:58,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:58,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:58,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:58,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:58,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:58,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:58,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:58,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:58,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:58,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:58,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:58,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:58,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:58,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:58,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:58,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:58,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:58,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:58,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:58,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:58,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:58,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:58,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:58,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:58,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:46:58,713 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:58,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:58,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:58,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:58,725 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:58,725 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:46:58,725 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:46:58,726 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:46:58,726 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:46:58,726 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:46:58,726 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:46:58,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:58,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:58,727 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:46:58,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:58,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:58,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:58,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:46:58,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:46:58,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:46:58,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:58,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:58,730 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:46:58,730 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:58,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:46:58,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:58,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:58,731 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:46:58,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:58,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:58,732 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:46:58,733 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:46:58,733 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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 -> cd6d4490a7412402195d3193de0347508566f7c8 [2019-11-25 08:46:58,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:58,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:58,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:58,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:58,919 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:58,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-25 08:46:58,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/data/95992be3f/e7c65a75dff9493e9608870f06bf02bb/FLAG4221deb85 [2019-11-25 08:46:59,388 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:59,389 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-25 08:46:59,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/data/95992be3f/e7c65a75dff9493e9608870f06bf02bb/FLAG4221deb85 [2019-11-25 08:46:59,812 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/data/95992be3f/e7c65a75dff9493e9608870f06bf02bb [2019-11-25 08:46:59,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:59,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:59,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:59,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:59,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:59,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:59" (1/1) ... [2019-11-25 08:46:59,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e434ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:59, skipping insertion in model container [2019-11-25 08:46:59,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:59" (1/1) ... [2019-11-25 08:46:59,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:59,851 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:00,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:00,045 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:00,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:00,139 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:00,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00 WrapperNode [2019-11-25 08:47:00,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:00,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:00,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:00,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:00,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:00,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:00,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:00,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:00,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... [2019-11-25 08:47:00,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:00,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:00,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:00,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:00,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:00,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-25 08:47:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-25 08:47:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-25 08:47:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-25 08:47:00,568 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:00,569 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:47:00,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:00 BoogieIcfgContainer [2019-11-25 08:47:00,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:00,571 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:47:00,571 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:47:00,575 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:47:00,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:00,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:46:59" (1/3) ... [2019-11-25 08:47:00,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2047ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:47:00, skipping insertion in model container [2019-11-25 08:47:00,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:00,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:00" (2/3) ... [2019-11-25 08:47:00,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2047ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:47:00, skipping insertion in model container [2019-11-25 08:47:00,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:00,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:00" (3/3) ... [2019-11-25 08:47:00,579 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-1.c [2019-11-25 08:47:00,629 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:47:00,629 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:47:00,629 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:47:00,629 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:00,629 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:00,630 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:47:00,630 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:00,630 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:47:00,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-25 08:47:00,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-25 08:47:00,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:00,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:00,672 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:47:00,672 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:00,672 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:47:00,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-25 08:47:00,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-25 08:47:00,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:00,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:00,676 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:47:00,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:00,681 INFO L794 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-25 08:47:00,682 INFO L796 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-25 08:47:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-11-25 08:47:00,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:00,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364213183] [2019-11-25 08:47:00,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:00,783 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-11-25 08:47:00,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:00,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288909490] [2019-11-25 08:47:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:00,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-11-25 08:47:00,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:00,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38904067] [2019-11-25 08:47:00,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:00,822 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:01,022 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:01,023 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:01,023 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:01,023 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:01,024 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:01,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:01,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:01,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-25 08:47:01,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:01,026 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:01,044 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-25 08:47:01,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-25 08:47:01,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-25 08:47:01,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-25 08:47:01,058 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-25 08:47:01,064 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-25 08:47:01,067 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-25 08:47:01,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-25 08:47:01,073 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-25 08:47:01,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-25 08:47:01,172 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:01,172 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:01,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,196 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,203 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,207 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,207 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,217 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-25 08:47:01,225 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,225 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,245 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-25 08:47:01,250 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,250 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,267 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-25 08:47:01,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,272 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:01,292 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,292 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:01,305 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,305 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:01,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,325 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,339 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-25 08:47:01,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:01,346 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:01,363 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:01,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:01,450 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:01,452 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:01,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:01,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:01,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:01,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:01,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:01,453 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:01,453 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-25 08:47:01,453 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:01,453 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:01,455 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-25 08:47:01,461 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-25 08:47:01,463 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-25 08:47:01,467 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-25 08:47:01,476 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-25 08:47:01,481 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-25 08:47:01,483 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-25 08:47:01,486 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-25 08:47:01,490 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-25 08:47:01,504 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-25 08:47:01,582 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:01,586 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:01,603 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-25 08:47:01,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,621 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-25 08:47:01,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:01,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) [2019-11-25 08:47:01,645 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-25 08:47:01,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,673 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-25 08:47:01,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:01,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,696 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-25 08:47:01,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:01,726 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-25 08:47:01,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:01,749 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-25 08:47:01,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:01,778 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-25 08:47:01,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,801 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-25 08:47:01,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:01,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:01,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:01,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:01,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:01,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:01,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:01,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:01,812 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-25 08:47:01,812 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:01,825 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:01,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:01,825 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:01,826 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:01,830 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:01,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:47:01,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:01,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:01,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:01,972 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-25 08:47:01,992 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-25 08:47:01,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-11-25 08:47:02,235 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-25 08:47:02,236 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-25 08:47:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-25 08:47:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-25 08:47:02,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-25 08:47:02,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:02,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-25 08:47:02,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:02,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-25 08:47:02,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:02,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-11-25 08:47:02,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-25 08:47:02,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-11-25 08:47:02,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-25 08:47:02,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-25 08:47:02,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-25 08:47:02,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:02,275 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-25 08:47:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-25 08:47:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-11-25 08:47:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:47:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-25 08:47:02,323 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-25 08:47:02,323 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-25 08:47:02,323 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:47:02,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-25 08:47:02,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-25 08:47:02,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:02,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:02,331 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:02,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:02,332 INFO L794 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-25 08:47:02,332 INFO L796 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-25 08:47:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-11-25 08:47:02,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:02,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302340410] [2019-11-25 08:47:02,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,506 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-25 08:47:02,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302340410] [2019-11-25 08:47:02,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659371755] [2019-11-25 08:47:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:47:02,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:02,564 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-25 08:47:02,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:02,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-25 08:47:02,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031187242] [2019-11-25 08:47:02,569 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-11-25 08:47:02,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:02,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098916603] [2019-11-25 08:47:02,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,615 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-25 08:47:02,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098916603] [2019-11-25 08:47:02,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:02,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:02,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402902424] [2019-11-25 08:47:02,616 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:02,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:02,620 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-25 08:47:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:02,693 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-11-25 08:47:02,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:02,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-11-25 08:47:02,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-25 08:47:02,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-11-25 08:47:02,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-25 08:47:02,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-25 08:47:02,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-11-25 08:47:02,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:02,701 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-11-25 08:47:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-11-25 08:47:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-25 08:47:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 08:47:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-25 08:47:02,708 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-25 08:47:02,708 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-25 08:47:02,709 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:47:02,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-25 08:47:02,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-25 08:47:02,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:02,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:02,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:02,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:02,712 INFO L794 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-25 08:47:02,712 INFO L796 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-25 08:47:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-11-25 08:47:02,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:02,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994431159] [2019-11-25 08:47:02,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,808 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-25 08:47:02,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994431159] [2019-11-25 08:47:02,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405192256] [2019-11-25 08:47:02,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:02,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:47:02,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:02,856 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-25 08:47:02,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:02,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-25 08:47:02,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066826059] [2019-11-25 08:47:02,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-11-25 08:47:02,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:02,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726894124] [2019-11-25 08:47:02,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:02,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:03,068 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:03,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:03,069 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:03,069 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:03,069 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:03,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:03,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:03,070 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:03,070 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-25 08:47:03,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:03,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:03,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-25 08:47:03,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-11-25 08:47:03,094 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-25 08:47:03,115 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-25 08:47:03,119 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-25 08:47:03,125 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-25 08:47:03,128 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-25 08:47:03,131 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-25 08:47:03,133 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-25 08:47:03,204 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:03,204 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) [2019-11-25 08:47:03,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:03,209 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:03,214 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:03,214 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) [2019-11-25 08:47:03,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:03,220 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:03,223 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:03,223 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:03,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:03,232 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:03,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:03,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:04,215 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:04,216 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:04,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:04,216 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:04,216 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:04,217 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:04,217 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:04,217 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:04,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:04,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-25 08:47:04,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:04,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:04,218 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-25 08:47:04,222 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-25 08:47:04,224 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-25 08:47:04,231 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-25 08:47:04,236 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-25 08:47:04,240 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-25 08:47:04,242 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-25 08:47:04,244 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-25 08:47:04,246 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-25 08:47:04,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:04,324 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:04,327 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-25 08:47:04,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:04,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:04,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:04,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:04,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:04,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:04,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:04,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:04,336 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-25 08:47:04,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:04,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:04,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:04,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:04,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:04,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:04,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:04,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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) [2019-11-25 08:47:04,351 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-25 08:47:04,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:04,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:04,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:04,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:04,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:04,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:04,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:04,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:04,364 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-25 08:47:04,364 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:04,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:04,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:04,369 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:04,369 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-25 08:47:04,371 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:47:04,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 08:47:04,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:04,569 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-25 08:47:04,570 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-25 08:47:04,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-25 08:47:04,966 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-25 08:47:04,968 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-25 08:47:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:47:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-11-25 08:47:04,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-11-25 08:47:04,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:04,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-11-25 08:47:04,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:04,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-11-25 08:47:04,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:04,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-11-25 08:47:04,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-25 08:47:04,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-11-25 08:47:04,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-25 08:47:04,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-25 08:47:04,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-11-25 08:47:04,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:04,992 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-11-25 08:47:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-11-25 08:47:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-25 08:47:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-25 08:47:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-11-25 08:47:05,009 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-11-25 08:47:05,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:47:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:47:05,010 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-11-25 08:47:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:05,170 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-11-25 08:47:05,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:05,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-11-25 08:47:05,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-25 08:47:05,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-11-25 08:47:05,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-25 08:47:05,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-25 08:47:05,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-11-25 08:47:05,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:05,187 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-11-25 08:47:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-11-25 08:47:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-11-25 08:47:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-25 08:47:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-11-25 08:47:05,202 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-25 08:47:05,202 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-25 08:47:05,202 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:47:05,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-11-25 08:47:05,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-25 08:47:05,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:05,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:05,209 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-25 08:47:05,210 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-25 08:47:05,210 INFO L794 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~ret3;havoc #t~ret2; 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~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-25 08:47:05,210 INFO L796 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~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-25 08:47:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:05,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-11-25 08:47:05,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:05,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511137362] [2019-11-25 08:47:05,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,595 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-25 08:47:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511137362] [2019-11-25 08:47:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805792077] [2019-11-25 08:47:05,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:05,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:05,759 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-25 08:47:05,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:05,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-25 08:47:05,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233987554] [2019-11-25 08:47:05,761 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-11-25 08:47:05,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:05,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342019653] [2019-11-25 08:47:05,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,897 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-25 08:47:05,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342019653] [2019-11-25 08:47:05,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841899874] [2019-11-25 08:47:05,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:47:05,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:05,958 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-25 08:47:05,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:05,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-11-25 08:47:05,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769506370] [2019-11-25 08:47:05,959 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:05,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:47:05,960 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-11-25 08:47:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:06,018 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-11-25 08:47:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:06,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-11-25 08:47:06,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-25 08:47:06,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-11-25 08:47:06,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-25 08:47:06,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-25 08:47:06,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-11-25 08:47:06,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:06,037 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-11-25 08:47:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-11-25 08:47:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-25 08:47:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-25 08:47:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-11-25 08:47:06,058 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-25 08:47:06,058 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-25 08:47:06,058 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:47:06,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-11-25 08:47:06,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-25 08:47:06,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:06,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:06,069 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-25 08:47:06,070 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-25 08:47:06,070 INFO L794 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~ret3;havoc #t~ret2; 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~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-25 08:47:06,070 INFO L796 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~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-25 08:47:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-11-25 08:47:06,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:06,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405354740] [2019-11-25 08:47:06,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,436 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-25 08:47:06,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405354740] [2019-11-25 08:47:06,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897916865] [2019-11-25 08:47:06,437 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:06,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:06,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:06,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:06,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:06,618 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-25 08:47:06,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:06,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-11-25 08:47:06,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555691868] [2019-11-25 08:47:06,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-11-25 08:47:06,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:06,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332055989] [2019-11-25 08:47:06,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,793 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-25 08:47:06,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332055989] [2019-11-25 08:47:06,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454364823] [2019-11-25 08:47:06,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:06,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:06,924 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-25 08:47:06,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:06,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-25 08:47:06,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010600935] [2019-11-25 08:47:06,926 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:06,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:47:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:47:06,926 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-11-25 08:47:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:07,254 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-11-25 08:47:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:47:07,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-11-25 08:47:07,257 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-25 08:47:07,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-11-25 08:47:07,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-25 08:47:07,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-25 08:47:07,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-11-25 08:47:07,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:07,262 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-11-25 08:47:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-11-25 08:47:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-25 08:47:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-25 08:47:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-11-25 08:47:07,275 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-25 08:47:07,275 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-25 08:47:07,275 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:47:07,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-11-25 08:47:07,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-25 08:47:07,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:07,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:07,280 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-25 08:47:07,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:07,281 INFO L794 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-25 08:47:07,281 INFO L796 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-25 08:47:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-11-25 08:47:07,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:07,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767109135] [2019-11-25 08:47:07,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:07,526 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-25 08:47:07,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767109135] [2019-11-25 08:47:07,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83905308] [2019-11-25 08:47:07,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:07,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:47:07,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:07,619 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-25 08:47:07,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:07,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-11-25 08:47:07,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808083004] [2019-11-25 08:47:07,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-11-25 08:47:07,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:07,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908245790] [2019-11-25 08:47:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:07,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:07,730 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:07,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:07,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:07,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:07,731 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:07,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:07,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:07,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:07,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-25 08:47:07,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:07,731 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:07,732 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-25 08:47:07,734 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-25 08:47:07,735 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-25 08:47:07,737 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-25 08:47:07,738 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-25 08:47:07,744 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-25 08:47:07,746 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-25 08:47:07,753 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-25 08:47:07,755 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-25 08:47:07,806 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:07,806 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:07,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:07,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:07,819 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:07,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:07,825 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:07,825 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:07,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:07,840 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:07,841 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:07,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:07,848 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:07,848 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:07,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:07,854 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:07,854 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:07,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:07,862 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:07,862 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:07,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:07,866 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:07,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:07,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:08,894 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:08,895 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:08,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:08,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:08,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:08,896 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:08,896 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:08,896 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:08,896 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:08,896 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-25 08:47:08,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:08,896 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:08,897 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-25 08:47:08,899 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-25 08:47:08,900 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-25 08:47:08,901 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-25 08:47:08,903 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-25 08:47:08,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-25 08:47:08,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-25 08:47:08,913 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-25 08:47:08,914 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-25 08:47:08,974 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:08,974 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:08,980 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-25 08:47:08,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:08,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:08,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:08,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:08,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:08,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:08,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:08,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:08,990 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-25 08:47:08,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:08,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:08,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:08,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:08,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:08,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:08,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:08,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:09,000 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-25 08:47:09,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:09,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:09,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:09,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:09,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:09,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:09,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:09,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:09,007 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-25 08:47:09,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:09,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:09,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:09,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:09,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:09,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:09,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:09,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:09,013 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-25 08:47:09,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:09,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:09,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:09,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:09,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:09,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:09,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:09,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:09,020 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-25 08:47:09,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:09,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:09,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:09,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:09,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:09,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:09,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:09,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:09,027 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-25 08:47:09,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:09,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:09,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:09,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:09,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:09,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:09,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:09,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:09,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:47:09,033 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/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-25 08:47:09,041 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:09,041 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:09,041 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:09,041 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-25 08:47:09,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:09,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,205 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-25 08:47:09,206 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-25 08:47:09,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-25 08:47:09,346 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-25 08:47:09,348 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-25 08:47:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-25 08:47:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-25 08:47:09,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:09,350 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,517 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-25 08:47:09,517 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-25 08:47:09,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-25 08:47:09,703 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-25 08:47:09,705 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-25 08:47:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-11-25 08:47:09,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-25 08:47:09,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:09,706 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:09,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,898 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-25 08:47:09,898 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-25 08:47:09,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-25 08:47:10,052 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-25 08:47:10,053 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-25 08:47:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-11-25 08:47:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-25 08:47:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-25 08:47:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-11-25 08:47:10,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:10,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-11-25 08:47:10,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-11-25 08:47:10,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-11-25 08:47:10,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-25 08:47:10,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-11-25 08:47:10,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-11-25 08:47:10,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:10,074 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-25 08:47:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-11-25 08:47:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-25 08:47:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-25 08:47:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-11-25 08:47:10,095 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-11-25 08:47:10,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-25 08:47:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:47:10,096 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-11-25 08:47:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:10,397 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-11-25 08:47:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:47:10,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-11-25 08:47:10,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-25 08:47:10,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-11-25 08:47:10,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-25 08:47:10,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-11-25 08:47:10,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-11-25 08:47:10,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:10,404 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-11-25 08:47:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-11-25 08:47:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-25 08:47:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-25 08:47:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-25 08:47:10,410 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-25 08:47:10,410 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-25 08:47:10,410 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:47:10,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-11-25 08:47:10,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-25 08:47:10,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:10,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:10,413 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-25 08:47:10,414 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-25 08:47:10,414 INFO L794 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~ret3;havoc #t~ret2; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-25 08:47:10,414 INFO L796 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~ret3;havoc #t~ret2; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-25 08:47:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-11-25 08:47:10,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:10,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795978316] [2019-11-25 08:47:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,552 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-25 08:47:10,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795978316] [2019-11-25 08:47:10,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557010644] [2019-11-25 08:47:10,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:10,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:10,719 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-25 08:47:10,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:10,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-11-25 08:47:10,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323627935] [2019-11-25 08:47:10,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-11-25 08:47:10,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:10,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126046987] [2019-11-25 08:47:10,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:10,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:10,973 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:10,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:10,973 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:10,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:10,973 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:10,973 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:10,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:10,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:10,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-25 08:47:10,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:10,974 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:10,975 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-25 08:47:10,977 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-25 08:47:10,978 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-25 08:47:10,983 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-25 08:47:10,988 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-25 08:47:10,989 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-25 08:47:10,991 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-25 08:47:10,994 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-25 08:47:10,998 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-25 08:47:11,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:11,044 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:11,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:11,051 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:11,051 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:11,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:11,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:11,060 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:11,065 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:11,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:11,853 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:11,854 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:11,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:11,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:11,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:11,854 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:11,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:11,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:11,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-25 08:47:11,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:11,855 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:11,856 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-25 08:47:11,861 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-25 08:47:11,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-25 08:47:11,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-25 08:47:11,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-25 08:47:11,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-25 08:47:11,885 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-25 08:47:11,887 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-25 08:47:11,889 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-25 08:47:11,928 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:11,928 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,938 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-25 08:47:11,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:11,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:11,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:11,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:11,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:11,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:11,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:11,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,948 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-25 08:47:11,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:11,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:11,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:11,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:11,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:11,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:11,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:11,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,955 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-25 08:47:11,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:11,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:11,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:11,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:11,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:11,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:11,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:11,964 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:11,966 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-25 08:47:11,966 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:11,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:11,971 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:11,971 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:11,971 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-25 08:47:11,973 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:12,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:47:12,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:12,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:12,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:47:12,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:12,171 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-25 08:47:12,171 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-25 08:47:12,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-25 08:47:12,539 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-25 08:47:12,539 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-25 08:47:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-25 08:47:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-11-25 08:47:12,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-25 08:47:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:12,541 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:12,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:47:12,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:12,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:12,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:47:12,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:12,732 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-25 08:47:12,732 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-25 08:47:12,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-25 08:47:12,970 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-25 08:47:12,971 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-25 08:47:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-25 08:47:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-11-25 08:47:12,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-25 08:47:12,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:12,972 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:13,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:47:13,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:13,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:13,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:13,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:47:13,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:13,161 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-25 08:47:13,162 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-25 08:47:13,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-25 08:47:13,506 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-25 08:47:13,512 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-25 08:47:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-25 08:47:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-11-25 08:47:13,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-25 08:47:13,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:13,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-11-25 08:47:13,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:13,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-25 08:47:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:13,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-11-25 08:47:13,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-25 08:47:13,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-11-25 08:47:13,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-25 08:47:13,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-25 08:47:13,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-11-25 08:47:13,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:13,541 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-11-25 08:47:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-11-25 08:47:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-11-25 08:47:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-25 08:47:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-11-25 08:47:13,564 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-11-25 08:47:13,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:47:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:47:13,567 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-11-25 08:47:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:13,951 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-11-25 08:47:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:47:13,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-11-25 08:47:13,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:13,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-11-25 08:47:13,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-11-25 08:47:13,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-11-25 08:47:13,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-11-25 08:47:13,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:13,965 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-11-25 08:47:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-11-25 08:47:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-11-25 08:47:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-25 08:47:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-11-25 08:47:13,981 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-25 08:47:13,982 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-25 08:47:13,982 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:47:13,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-11-25 08:47:13,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:13,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:13,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:13,993 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-25 08:47:13,993 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [48, 47, 34, 33, 28, 24, 24, 24, 24, 24, 23, 23, 20, 17, 17, 17, 17, 16, 16, 11, 10] [2019-11-25 08:47:13,994 INFO L794 eck$LassoCheckResult]: Stem: 8596#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8562#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8563#fibo1ENTRY ~n := #in~n; 8643#L8 assume !(~n < 1); 8642#L10 assume !(1 == ~n); 8638#L13 call #t~ret0 := fibo2(~n - 1);< 8641#fibo2ENTRY ~n := #in~n; 8640#L18 assume !(~n < 1); 8639#L20 assume !(1 == ~n); 8634#L23 call #t~ret2 := fibo1(~n - 1);< 8636#fibo1ENTRY ~n := #in~n; 8637#L8 assume !(~n < 1); 8633#L10 assume !(1 == ~n); 8620#L13 call #t~ret0 := fibo2(~n - 1);< 8625#fibo2ENTRY ~n := #in~n; 8624#L18 assume !(~n < 1); 8622#L20 assume !(1 == ~n); 8571#L23 call #t~ret2 := fibo1(~n - 1);< 8613#fibo1ENTRY ~n := #in~n; 8614#L8 assume !(~n < 1); 8635#L10 assume !(1 == ~n); 8621#L13 call #t~ret0 := fibo2(~n - 1);< 8625#fibo2ENTRY ~n := #in~n; 8624#L18 assume !(~n < 1); 8622#L20 assume !(1 == ~n); 8571#L23 call #t~ret2 := fibo1(~n - 1);< 8613#fibo1ENTRY ~n := #in~n; 8612#L8 assume !(~n < 1); 8611#L10 assume !(1 == ~n); 8570#L13 call #t~ret0 := fibo2(~n - 1);< 8572#fibo2ENTRY ~n := #in~n; 8810#L18 assume !(~n < 1); 8808#L20 assume 1 == ~n;#res := 1; 8806#fibo2FINAL assume true; 8805#fibo2EXIT >#49#return; 8803#L13-1 call #t~ret1 := fibo2(~n - 2);< 8804#fibo2ENTRY ~n := #in~n; 8809#L18 assume ~n < 1;#res := 0; 8807#fibo2FINAL assume true; 8802#fibo2EXIT >#51#return; 8801#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8799#fibo1FINAL assume true; 8795#fibo1EXIT >#45#return; 8792#L23-1 call #t~ret3 := fibo1(~n - 2);< 8793#fibo1ENTRY ~n := #in~n; 8831#L8 assume ~n < 1;#res := 0; 8830#fibo1FINAL assume true; 8791#fibo1EXIT >#47#return; 8780#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8775#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8627#L13-1 [2019-11-25 08:47:13,995 INFO L796 eck$LassoCheckResult]: Loop: 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8893#L18 assume !(~n < 1); 8891#L20 assume !(1 == ~n); 8892#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8943#L8 assume !(~n < 1); 8942#L10 assume 1 == ~n;#res := 1; 8940#fibo1FINAL assume true; 8938#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8893#L18 assume !(~n < 1); 8891#L20 assume !(1 == ~n); 8892#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8943#L8 assume !(~n < 1); 8942#L10 assume 1 == ~n;#res := 1; 8940#fibo1FINAL assume true; 8938#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8893#L18 assume !(~n < 1); 8891#L20 assume !(1 == ~n); 8892#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8943#L8 assume !(~n < 1); 8942#L10 assume 1 == ~n;#res := 1; 8940#fibo1FINAL assume true; 8938#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume 1 == ~n;#res := 1; 8700#fibo1FINAL assume true; 8710#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 [2019-11-25 08:47:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-11-25 08:47:13,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:13,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214585865] [2019-11-25 08:47:13,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,252 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-25 08:47:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214585865] [2019-11-25 08:47:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505726812] [2019-11-25 08:47:14,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:14,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:14,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:14,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:14,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:14,323 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-25 08:47:14,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:14,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-11-25 08:47:14,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976339552] [2019-11-25 08:47:14,324 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1098821556, now seen corresponding path program 1 times [2019-11-25 08:47:14,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:14,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015152792] [2019-11-25 08:47:14,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8447 backedges. 115 proven. 622 refuted. 0 times theorem prover too weak. 7710 trivial. 0 not checked. [2019-11-25 08:47:15,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015152792] [2019-11-25 08:47:15,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800478239] [2019-11-25 08:47:15,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:47:15,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8447 backedges. 996 proven. 3 refuted. 0 times theorem prover too weak. 7448 trivial. 0 not checked. [2019-11-25 08:47:15,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:15,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-11-25 08:47:15,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175919466] [2019-11-25 08:47:15,994 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:15,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:47:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:47:15,995 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-11-25 08:47:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:16,506 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-11-25 08:47:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:47:16,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-11-25 08:47:16,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:16,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-11-25 08:47:16,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-11-25 08:47:16,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-11-25 08:47:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-11-25 08:47:16,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:16,522 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-11-25 08:47:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-11-25 08:47:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-11-25 08:47:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-25 08:47:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-11-25 08:47:16,543 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-25 08:47:16,543 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-25 08:47:16,543 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:47:16,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-11-25 08:47:16,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:16,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:16,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:16,548 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-25 08:47:16,549 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-25 08:47:16,549 INFO L794 eck$LassoCheckResult]: Stem: 15215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 15171#L37 call main_#t~ret4 := fibo1(main_~x~0);< 15172#fibo1ENTRY ~n := #in~n; 15413#L8 assume !(~n < 1); 15405#L10 assume !(1 == ~n); 15406#L13 call #t~ret0 := fibo2(~n - 1);< 15416#fibo2ENTRY ~n := #in~n; 15415#L18 assume !(~n < 1); 15414#L20 assume !(1 == ~n); 15402#L23 call #t~ret2 := fibo1(~n - 1);< 15412#fibo1ENTRY ~n := #in~n; 15408#L8 assume !(~n < 1); 15409#L10 assume !(1 == ~n); 15401#L13 call #t~ret0 := fibo2(~n - 1);< 15403#fibo2ENTRY ~n := #in~n; 15438#L18 assume !(~n < 1); 15429#L20 assume !(1 == ~n); 15399#L23 call #t~ret2 := fibo1(~n - 1);< 15410#fibo1ENTRY ~n := #in~n; 15411#L8 assume !(~n < 1); 15497#L10 assume !(1 == ~n); 15165#L13 call #t~ret0 := fibo2(~n - 1);< 15400#fibo2ENTRY ~n := #in~n; 15431#L18 assume !(~n < 1); 15432#L20 assume !(1 == ~n); 15163#L23 call #t~ret2 := fibo1(~n - 1);< 15166#fibo1ENTRY ~n := #in~n; 15638#L8 assume !(~n < 1); 15637#L10 assume 1 == ~n;#res := 1; 15636#fibo1FINAL assume true; 15634#fibo1EXIT >#45#return; 15174#L23-1 call #t~ret3 := fibo1(~n - 2);< 15187#fibo1ENTRY ~n := #in~n; 15231#L8 assume !(~n < 1); 15173#L10 assume 1 == ~n;#res := 1; 15176#fibo1FINAL assume true; 15201#fibo1EXIT >#47#return; 15643#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 15642#fibo2FINAL assume true; 15641#fibo2EXIT >#49#return; 15317#L13-1 call #t~ret1 := fibo2(~n - 2);< 15210#fibo2ENTRY ~n := #in~n; 15321#L18 assume !(~n < 1); 15316#L20 assume !(1 == ~n); 15270#L23 [2019-11-25 08:47:16,549 INFO L796 eck$LassoCheckResult]: Loop: 15270#L23 call #t~ret2 := fibo1(~n - 1);< 15287#fibo1ENTRY ~n := #in~n; 15283#L8 assume !(~n < 1); 15284#L10 assume !(1 == ~n); 15185#L13 call #t~ret0 := fibo2(~n - 1);< 15271#fibo2ENTRY ~n := #in~n; 15378#L18 assume !(~n < 1); 15360#L20 assume !(1 == ~n); 15336#L23 call #t~ret2 := fibo1(~n - 1);< 15344#fibo1ENTRY ~n := #in~n; 15353#L8 assume !(~n < 1); 15352#L10 assume 1 == ~n;#res := 1; 15346#fibo1FINAL assume true; 15335#fibo1EXIT >#45#return; 15188#L23-1 call #t~ret3 := fibo1(~n - 2);< 15189#fibo1ENTRY ~n := #in~n; 15383#L8 assume ~n < 1;#res := 0; 15202#fibo1FINAL assume true; 15205#fibo1EXIT >#47#return; 15191#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 15183#fibo2FINAL assume true; 15186#fibo2EXIT >#49#return; 15230#L13-1 call #t~ret1 := fibo2(~n - 2);< 15210#fibo2ENTRY ~n := #in~n; 15321#L18 assume !(~n < 1); 15316#L20 assume !(1 == ~n); 15270#L23 [2019-11-25 08:47:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-11-25 08:47:16,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:16,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975661623] [2019-11-25 08:47:16,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:16,894 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-25 08:47:16,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975661623] [2019-11-25 08:47:16,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817273191] [2019-11-25 08:47:16,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:16,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:16,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:17,001 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-25 08:47:17,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:17,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-11-25 08:47:17,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461830430] [2019-11-25 08:47:17,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-11-25 08:47:17,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:17,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099518333] [2019-11-25 08:47:17,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,108 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-25 08:47:17,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099518333] [2019-11-25 08:47:17,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938314664] [2019-11-25 08:47:17,109 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:17,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:17,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:17,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:17,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:17,172 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-25 08:47:17,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:17,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-25 08:47:17,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977309550] [2019-11-25 08:47:17,173 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:17,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:47:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:47:17,174 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-11-25 08:47:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:17,369 INFO L93 Difference]: Finished difference Result 549 states and 744 transitions. [2019-11-25 08:47:17,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:17,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 744 transitions. [2019-11-25 08:47:17,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:17,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 524 states and 708 transitions. [2019-11-25 08:47:17,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2019-11-25 08:47:17,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-25 08:47:17,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 708 transitions. [2019-11-25 08:47:17,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:17,385 INFO L688 BuchiCegarLoop]: Abstraction has 524 states and 708 transitions. [2019-11-25 08:47:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 708 transitions. [2019-11-25 08:47:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2019-11-25 08:47:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-25 08:47:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2019-11-25 08:47:17,407 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-25 08:47:17,407 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-25 08:47:17,407 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:47:17,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 661 transitions. [2019-11-25 08:47:17,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:17,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:17,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:17,414 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-25 08:47:17,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:17,414 INFO L794 eck$LassoCheckResult]: Stem: 16577#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16519#L37 call main_#t~ret4 := fibo1(main_~x~0);< 16533#fibo1ENTRY ~n := #in~n; 16973#L8 assume !(~n < 1); 16518#L10 assume !(1 == ~n); 16520#L13 call #t~ret0 := fibo2(~n - 1);< 16749#fibo2ENTRY ~n := #in~n; 16931#L18 assume !(~n < 1); 16804#L20 assume !(1 == ~n); 16753#L23 call #t~ret2 := fibo1(~n - 1);< 16796#fibo1ENTRY ~n := #in~n; 16827#L8 assume !(~n < 1); 16826#L10 assume !(1 == ~n); 16773#L13 call #t~ret0 := fibo2(~n - 1);< 16824#fibo2ENTRY ~n := #in~n; 16965#L18 assume !(~n < 1); 16913#L20 assume !(1 == ~n); 16750#L23 call #t~ret2 := fibo1(~n - 1);< 16762#fibo1ENTRY ~n := #in~n; 16756#L8 assume !(~n < 1); 16754#L10 assume !(1 == ~n); 16507#L13 call #t~ret0 := fibo2(~n - 1);< 16581#fibo2ENTRY ~n := #in~n; 16582#L18 assume !(~n < 1); 16595#L20 assume !(1 == ~n); 16506#L23 call #t~ret2 := fibo1(~n - 1);< 16509#fibo1ENTRY ~n := #in~n; 16986#L8 assume !(~n < 1); 16984#L10 assume 1 == ~n;#res := 1; 16983#fibo1FINAL assume true; 16977#fibo1EXIT >#45#return; 16527#L23-1 call #t~ret3 := fibo1(~n - 2);< 16528#fibo1ENTRY ~n := #in~n; 16574#L8 assume !(~n < 1); 16945#L10 assume 1 == ~n;#res := 1; 16943#fibo1FINAL assume true; 16940#fibo1EXIT >#47#return; 16939#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 16937#fibo2FINAL assume true; 16935#fibo2EXIT >#49#return; 16799#L13-1 call #t~ret1 := fibo2(~n - 2);< 16807#fibo2ENTRY ~n := #in~n; 16996#L18 assume ~n < 1;#res := 0; 16808#fibo2FINAL assume true; 16797#fibo2EXIT >#51#return; 16801#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16990#fibo1FINAL assume true; 16777#fibo1EXIT >#45#return; 16606#L23-1 call #t~ret3 := fibo1(~n - 2);< 16774#fibo1ENTRY ~n := #in~n; 16605#L8 assume !(~n < 1); 16607#L10 assume !(1 == ~n); 16740#L13 [2019-11-25 08:47:17,415 INFO L796 eck$LassoCheckResult]: Loop: 16740#L13 call #t~ret0 := fibo2(~n - 1);< 16748#fibo2ENTRY ~n := #in~n; 16784#L18 assume !(~n < 1); 16775#L20 assume !(1 == ~n); 16745#L23 call #t~ret2 := fibo1(~n - 1);< 16767#fibo1ENTRY ~n := #in~n; 16958#L8 assume !(~n < 1); 16956#L10 assume !(1 == ~n); 16741#L13 call #t~ret0 := fibo2(~n - 1);< 16747#fibo2ENTRY ~n := #in~n; 16788#L18 assume !(~n < 1); 16785#L20 assume !(1 == ~n); 16787#L23 call #t~ret2 := fibo1(~n - 1);< 16849#fibo1ENTRY ~n := #in~n; 16864#L8 assume !(~n < 1); 16861#L10 assume 1 == ~n;#res := 1; 16859#fibo1FINAL assume true; 16846#fibo1EXIT >#45#return; 16589#L23-1 call #t~ret3 := fibo1(~n - 2);< 16845#fibo1ENTRY ~n := #in~n; 16588#L8 assume ~n < 1;#res := 0; 16590#fibo1FINAL assume true; 16844#fibo1EXIT >#47#return; 16841#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 16842#fibo2FINAL assume true; 16811#fibo2EXIT >#49#return; 16798#L13-1 call #t~ret1 := fibo2(~n - 2);< 16807#fibo2ENTRY ~n := #in~n; 16996#L18 assume ~n < 1;#res := 0; 16808#fibo2FINAL assume true; 16797#fibo2EXIT >#51#return; 16802#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16805#fibo1FINAL assume true; 16763#fibo1EXIT >#45#return; 16759#L23-1 call #t~ret3 := fibo1(~n - 2);< 16772#fibo1ENTRY ~n := #in~n; 16966#L8 assume !(~n < 1); 16915#L10 assume !(1 == ~n); 16740#L13 [2019-11-25 08:47:17,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash 783666534, now seen corresponding path program 1 times [2019-11-25 08:47:17,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:17,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206105672] [2019-11-25 08:47:17,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,599 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-25 08:47:17,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206105672] [2019-11-25 08:47:17,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593785174] [2019-11-25 08:47:17,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:17,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:17,687 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-25 08:47:17,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:17,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-11-25 08:47:17,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653411332] [2019-11-25 08:47:17,688 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1056491202, now seen corresponding path program 2 times [2019-11-25 08:47:17,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:17,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173908350] [2019-11-25 08:47:17,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-25 08:47:17,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173908350] [2019-11-25 08:47:17,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087961871] [2019-11-25 08:47:17,762 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:17,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:17,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:17,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:17,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-25 08:47:17,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:17,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-25 08:47:17,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132091412] [2019-11-25 08:47:17,878 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:17,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:47:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:47:17,879 INFO L87 Difference]: Start difference. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 15 states. [2019-11-25 08:47:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:18,097 INFO L93 Difference]: Finished difference Result 518 states and 690 transitions. [2019-11-25 08:47:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:47:18,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 690 transitions. [2019-11-25 08:47:18,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:18,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 518 states and 690 transitions. [2019-11-25 08:47:18,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-11-25 08:47:18,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-11-25 08:47:18,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 690 transitions. [2019-11-25 08:47:18,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:18,117 INFO L688 BuchiCegarLoop]: Abstraction has 518 states and 690 transitions. [2019-11-25 08:47:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 690 transitions. [2019-11-25 08:47:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2019-11-25 08:47:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-25 08:47:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 650 transitions. [2019-11-25 08:47:18,134 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-25 08:47:18,134 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-25 08:47:18,135 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:47:18,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 650 transitions. [2019-11-25 08:47:18,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-25 08:47:18,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:18,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:18,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:18,141 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-25 08:47:18,141 INFO L794 eck$LassoCheckResult]: Stem: 18021#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 17964#L37 call main_#t~ret4 := fibo1(main_~x~0);< 17965#fibo1ENTRY ~n := #in~n; 18203#L8 assume !(~n < 1); 18189#L10 assume !(1 == ~n); 18179#L13 call #t~ret0 := fibo2(~n - 1);< 18207#fibo2ENTRY ~n := #in~n; 18206#L18 assume !(~n < 1); 18205#L20 assume !(1 == ~n); 18186#L23 call #t~ret2 := fibo1(~n - 1);< 18204#fibo1ENTRY ~n := #in~n; 18195#L8 assume !(~n < 1); 18196#L10 assume !(1 == ~n); 17962#L13 call #t~ret0 := fibo2(~n - 1);< 18187#fibo2ENTRY ~n := #in~n; 18299#L18 assume !(~n < 1); 18033#L20 assume !(1 == ~n); 17961#L23 call #t~ret2 := fibo1(~n - 1);< 17963#fibo1ENTRY ~n := #in~n; 18023#L8 assume !(~n < 1); 18351#L10 assume !(1 == ~n); 17985#L13 call #t~ret0 := fibo2(~n - 1);< 18185#fibo2ENTRY ~n := #in~n; 18202#L18 assume !(~n < 1); 18200#L20 assume !(1 == ~n); 18201#L23 call #t~ret2 := fibo1(~n - 1);< 18376#fibo1ENTRY ~n := #in~n; 18383#L8 assume !(~n < 1); 18381#L10 assume 1 == ~n;#res := 1; 18380#fibo1FINAL assume true; 18375#fibo1EXIT >#45#return; 18358#L23-1 call #t~ret3 := fibo1(~n - 2);< 18360#fibo1ENTRY ~n := #in~n; 18378#L8 assume !(~n < 1); 18377#L10 assume 1 == ~n;#res := 1; 18374#fibo1FINAL assume true; 18356#fibo1EXIT >#47#return; 18359#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 18444#fibo2FINAL assume true; 18443#fibo2EXIT >#49#return; 18013#L13-1 call #t~ret1 := fibo2(~n - 2);< 18015#fibo2ENTRY ~n := #in~n; 18025#L18 assume !(~n < 1); 18031#L20 assume 1 == ~n;#res := 1; 18032#fibo2FINAL assume true; 18414#fibo2EXIT >#51#return; 18018#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18019#fibo1FINAL assume true; 18336#fibo1EXIT >#45#return; 18046#L23-1 call #t~ret3 := fibo1(~n - 2);< 18331#fibo1ENTRY ~n := #in~n; 18045#L8 assume !(~n < 1); 18047#L10 assume !(1 == ~n); 17972#L13 [2019-11-25 08:47:18,141 INFO L796 eck$LassoCheckResult]: Loop: 17972#L13 call #t~ret0 := fibo2(~n - 1);< 18181#fibo2ENTRY ~n := #in~n; 18268#L18 assume !(~n < 1); 18263#L20 assume !(1 == ~n); 18183#L23 call #t~ret2 := fibo1(~n - 1);< 18254#fibo1ENTRY ~n := #in~n; 18253#L8 assume !(~n < 1); 18251#L10 assume !(1 == ~n); 17959#L13 call #t~ret0 := fibo2(~n - 1);< 18184#fibo2ENTRY ~n := #in~n; 18266#L18 assume !(~n < 1); 18260#L20 assume !(1 == ~n); 18182#L23 call #t~ret2 := fibo1(~n - 1);< 18254#fibo1ENTRY ~n := #in~n; 18253#L8 assume !(~n < 1); 18251#L10 assume !(1 == ~n); 17959#L13 call #t~ret0 := fibo2(~n - 1);< 18184#fibo2ENTRY ~n := #in~n; 18266#L18 assume !(~n < 1); 18260#L20 assume 1 == ~n;#res := 1; 18261#fibo2FINAL assume true; 18408#fibo2EXIT >#49#return; 18405#L13-1 call #t~ret1 := fibo2(~n - 2);< 18406#fibo2ENTRY ~n := #in~n; 18409#L18 assume ~n < 1;#res := 0; 18330#fibo2FINAL assume true; 18404#fibo2EXIT >#51#return; 18403#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18401#fibo1FINAL assume true; 18362#fibo1EXIT >#45#return; 18363#L23-1 call #t~ret3 := fibo1(~n - 2);< 18419#fibo1ENTRY ~n := #in~n; 18428#L8 assume !(~n < 1); 18424#L10 assume 1 == ~n;#res := 1; 18422#fibo1FINAL assume true; 18418#fibo1EXIT >#47#return; 18417#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 18415#fibo2FINAL assume true; 18175#fibo2EXIT >#49#return; 17973#L13-1 call #t~ret1 := fibo2(~n - 2);< 18017#fibo2ENTRY ~n := #in~n; 18077#L18 assume !(~n < 1); 18076#L20 assume !(1 == ~n); 18001#L23 call #t~ret2 := fibo1(~n - 1);< 18342#fibo1ENTRY ~n := #in~n; 18435#L8 assume !(~n < 1); 18433#L10 assume 1 == ~n;#res := 1; 18432#fibo1FINAL assume true; 18431#fibo1EXIT >#45#return; 17967#L23-1 call #t~ret3 := fibo1(~n - 2);< 17979#fibo1ENTRY ~n := #in~n; 18022#L8 assume ~n < 1;#res := 0; 18003#fibo1FINAL assume true; 17993#fibo1EXIT >#47#return; 17994#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 18449#fibo2FINAL assume true; 18347#fibo2EXIT >#51#return; 18176#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18345#fibo1FINAL assume true; 18339#fibo1EXIT >#45#return; 18180#L23-1 call #t~ret3 := fibo1(~n - 2);< 18344#fibo1ENTRY ~n := #in~n; 18427#L8 assume !(~n < 1); 18425#L10 assume !(1 == ~n); 17972#L13 [2019-11-25 08:47:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1614825140, now seen corresponding path program 1 times [2019-11-25 08:47:18,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231959912] [2019-11-25 08:47:18,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:18,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231959912] [2019-11-25 08:47:18,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691549601] [2019-11-25 08:47:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:18,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:47:18,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:18,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2019-11-25 08:47:18,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376008463] [2019-11-25 08:47:18,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 41147773, now seen corresponding path program 1 times [2019-11-25 08:47:18,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710947160] [2019-11-25 08:47:18,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:19,195 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:19,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:19,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:19,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:19,196 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:19,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:19,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:19,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-11-25 08:47:19,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:19,196 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:19,197 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-25 08:47:19,199 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-25 08:47:19,200 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-25 08:47:19,202 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-25 08:47:19,203 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-25 08:47:19,211 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-25 08:47:19,213 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-25 08:47:19,214 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-25 08:47:19,216 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-25 08:47:19,277 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:19,277 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:19,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:19,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:19,284 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:19,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:19,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:19,298 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:19,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:19,305 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:19,305 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:19,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:19,312 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:19,312 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:19,321 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:19,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:20,969 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:20,971 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:20,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:20,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:20,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:20,971 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:20,971 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:20,971 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:20,972 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:20,972 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-11-25 08:47:20,972 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:20,972 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:20,972 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-25 08:47:20,974 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-25 08:47:20,975 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-25 08:47:20,978 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-25 08:47:20,986 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-25 08:47:20,988 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-25 08:47:20,989 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-25 08:47:20,992 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-25 08:47:20,993 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-25 08:47:21,052 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:21,052 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,055 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-25 08:47:21,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:21,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:21,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:21,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:21,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:21,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:21,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:21,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,062 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-25 08:47:21,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:21,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:21,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:21,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:21,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:21,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:21,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:21,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,069 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-25 08:47:21,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:21,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:21,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:21,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:21,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:21,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:21,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:21,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,076 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-25 08:47:21,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:21,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:21,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:21,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:21,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:21,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:21,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:21,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:21,082 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-25 08:47:21,082 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:21,085 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:21,085 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:21,086 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-25 08:47:21,087 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:21,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:47:21,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:21,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:21,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:21,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:21,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 08:47:21,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:21,398 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-25 08:47:21,398 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-25 08:47:21,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 14 states. [2019-11-25 08:47:21,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 14 states. Result 1735 states and 2279 transitions. Complement of second has 65 states. [2019-11-25 08:47:21,993 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-25 08:47:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:47:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2019-11-25 08:47:21,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 53 letters. Loop has 64 letters. [2019-11-25 08:47:21,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:21,999 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:22,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:47:22,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:22,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:22,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:22,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:22,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:22,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 08:47:22,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:22,352 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-25 08:47:22,353 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-25 08:47:22,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 14 states. [2019-11-25 08:47:23,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 14 states. Result 1771 states and 2327 transitions. Complement of second has 69 states. [2019-11-25 08:47:23,093 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-25 08:47:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:47:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-25 08:47:23,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 53 letters. Loop has 64 letters. [2019-11-25 08:47:23,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:23,094 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:23,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:47:23,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:23,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:23,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 08:47:23,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:23,484 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-25 08:47:23,485 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-25 08:47:23,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 14 states. [2019-11-25 08:47:24,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 14 states. Result 3836 states and 4969 transitions. Complement of second has 185 states. [2019-11-25 08:47:24,284 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-25 08:47:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:47:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2019-11-25 08:47:24,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 53 letters. Loop has 64 letters. [2019-11-25 08:47:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:24,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 117 letters. Loop has 64 letters. [2019-11-25 08:47:24,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:24,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 88 transitions. Stem has 53 letters. Loop has 128 letters. [2019-11-25 08:47:24,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:24,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3836 states and 4969 transitions. [2019-11-25 08:47:24,330 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2019-11-25 08:47:24,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3836 states to 2394 states and 3166 transitions. [2019-11-25 08:47:24,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 496 [2019-11-25 08:47:24,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 504 [2019-11-25 08:47:24,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2394 states and 3166 transitions. [2019-11-25 08:47:24,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:24,361 INFO L688 BuchiCegarLoop]: Abstraction has 2394 states and 3166 transitions. [2019-11-25 08:47:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states and 3166 transitions. [2019-11-25 08:47:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2096. [2019-11-25 08:47:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-11-25 08:47:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2660 transitions. [2019-11-25 08:47:24,427 INFO L711 BuchiCegarLoop]: Abstraction has 2096 states and 2660 transitions. [2019-11-25 08:47:24,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:47:24,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:47:24,428 INFO L87 Difference]: Start difference. First operand 2096 states and 2660 transitions. Second operand 22 states. [2019-11-25 08:47:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:24,953 INFO L93 Difference]: Finished difference Result 2246 states and 2863 transitions. [2019-11-25 08:47:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:47:24,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2246 states and 2863 transitions. [2019-11-25 08:47:24,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-25 08:47:25,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2246 states to 2189 states and 2806 transitions. [2019-11-25 08:47:25,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2019-11-25 08:47:25,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2019-11-25 08:47:25,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2189 states and 2806 transitions. [2019-11-25 08:47:25,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:25,003 INFO L688 BuchiCegarLoop]: Abstraction has 2189 states and 2806 transitions. [2019-11-25 08:47:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states and 2806 transitions. [2019-11-25 08:47:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2063. [2019-11-25 08:47:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-25 08:47:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2598 transitions. [2019-11-25 08:47:25,059 INFO L711 BuchiCegarLoop]: Abstraction has 2063 states and 2598 transitions. [2019-11-25 08:47:25,059 INFO L591 BuchiCegarLoop]: Abstraction has 2063 states and 2598 transitions. [2019-11-25 08:47:25,060 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:47:25,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2063 states and 2598 transitions. [2019-11-25 08:47:25,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-25 08:47:25,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:25,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:25,071 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-25 08:47:25,072 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:25,072 INFO L794 eck$LassoCheckResult]: Stem: 31942#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 31893#L37 call main_#t~ret4 := fibo1(main_~x~0);< 31894#fibo1ENTRY ~n := #in~n; 32006#L8 assume !(~n < 1); 32005#L10 assume !(1 == ~n); 32000#L13 call #t~ret0 := fibo2(~n - 1);< 32003#fibo2ENTRY ~n := #in~n; 32002#L18 assume !(~n < 1); 32001#L20 assume !(1 == ~n); 31996#L23 call #t~ret2 := fibo1(~n - 1);< 31999#fibo1ENTRY ~n := #in~n; 31998#L8 assume !(~n < 1); 31997#L10 assume !(1 == ~n); 31992#L13 call #t~ret0 := fibo2(~n - 1);< 31995#fibo2ENTRY ~n := #in~n; 31994#L18 assume !(~n < 1); 31993#L20 assume !(1 == ~n); 31989#L23 call #t~ret2 := fibo1(~n - 1);< 31991#fibo1ENTRY ~n := #in~n; 31984#L8 assume !(~n < 1); 31990#L10 assume !(1 == ~n); 31985#L13 call #t~ret0 := fibo2(~n - 1);< 31988#fibo2ENTRY ~n := #in~n; 31987#L18 assume !(~n < 1); 31986#L20 assume !(1 == ~n); 31982#L23 call #t~ret2 := fibo1(~n - 1);< 31981#fibo1ENTRY ~n := #in~n; 31983#L8 assume !(~n < 1); 32800#L10 assume !(1 == ~n); 32775#L13 call #t~ret0 := fibo2(~n - 1);< 32776#fibo2ENTRY ~n := #in~n; 32812#L18 assume !(~n < 1); 32803#L20 assume 1 == ~n;#res := 1; 32799#fibo2FINAL assume true; 32774#fibo2EXIT >#49#return; 32771#L13-1 call #t~ret1 := fibo2(~n - 2);< 32772#fibo2ENTRY ~n := #in~n; 32788#L18 assume ~n < 1;#res := 0; 32787#fibo2FINAL assume true; 32770#fibo2EXIT >#51#return; 32768#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 32766#fibo1FINAL assume true; 32765#fibo1EXIT >#45#return; 32763#L23-1 call #t~ret3 := fibo1(~n - 2);< 32764#fibo1ENTRY ~n := #in~n; 32773#L8 assume !(~n < 1); 32769#L10 assume 1 == ~n;#res := 1; 32767#fibo1FINAL assume true; 32762#fibo1EXIT >#47#return; 32747#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 32742#fibo2FINAL assume true; 32736#fibo2EXIT >#49#return; 32695#L13-1 call #t~ret1 := fibo2(~n - 2);< 32725#fibo2ENTRY ~n := #in~n; 32706#L18 assume !(~n < 1); 32699#L20 assume !(1 == ~n); 32681#L23 call #t~ret2 := fibo1(~n - 1);< 32691#fibo1ENTRY ~n := #in~n; 32689#L8 assume !(~n < 1); 32686#L10 assume !(1 == ~n); 32646#L13 call #t~ret0 := fibo2(~n - 1);< 32647#fibo2ENTRY ~n := #in~n; 32667#L18 assume !(~n < 1); 32658#L20 assume !(1 == ~n); 32659#L23 call #t~ret2 := fibo1(~n - 1);< 33841#fibo1ENTRY ~n := #in~n; 33839#L8 assume !(~n < 1); 33837#L10 assume !(1 == ~n); 31902#L13 [2019-11-25 08:47:25,072 INFO L796 eck$LassoCheckResult]: Loop: 31902#L13 call #t~ret0 := fibo2(~n - 1);< 33832#fibo2ENTRY ~n := #in~n; 33840#L18 assume !(~n < 1); 33835#L20 assume !(1 == ~n); 33830#L23 call #t~ret2 := fibo1(~n - 1);< 33841#fibo1ENTRY ~n := #in~n; 33839#L8 assume !(~n < 1); 33837#L10 assume !(1 == ~n); 31902#L13 [2019-11-25 08:47:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash 902409038, now seen corresponding path program 3 times [2019-11-25 08:47:25,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010123318] [2019-11-25 08:47:25,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,361 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-25 08:47:25,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010123318] [2019-11-25 08:47:25,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959719610] [2019-11-25 08:47:25,362 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:25,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-25 08:47:25,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:25,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:25,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:25,486 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-25 08:47:25,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:25,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2019-11-25 08:47:25,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607047933] [2019-11-25 08:47:25,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 3 times [2019-11-25 08:47:25,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488804684] [2019-11-25 08:47:25,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:25,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:25,628 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:25,628 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:25,628 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:25,628 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:25,628 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:25,628 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:25,628 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:25,628 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:25,628 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration12_Loop [2019-11-25 08:47:25,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:25,629 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:25,629 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-25 08:47:25,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-25 08:47:25,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-25 08:47:25,637 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-25 08:47:25,639 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-25 08:47:25,652 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-25 08:47:25,654 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-25 08:47:25,656 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-25 08:47:25,658 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-25 08:47:25,721 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:25,721 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:25,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:25,734 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:25,737 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:25,737 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:25,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:25,743 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:25,747 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:25,747 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:25,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:25,753 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:25,757 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:25,757 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:25,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:25,764 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:25,767 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:25,767 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_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:25,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:25,774 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:25,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:25,791 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:28,905 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:28,906 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:28,907 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:28,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:28,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:28,907 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:28,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:28,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:28,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:28,907 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration12_Loop [2019-11-25 08:47:28,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:28,907 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:28,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-25 08:47:28,911 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-25 08:47:28,913 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-25 08:47:28,914 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-25 08:47:28,916 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-25 08:47:28,923 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-25 08:47:28,925 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-25 08:47:28,926 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-25 08:47:28,928 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-25 08:47:28,977 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:28,977 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:28,981 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-25 08:47:28,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:28,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:28,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:28,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:28,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:28,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:28,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:28,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:28,988 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-25 08:47:28,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:28,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:28,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:28,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:28,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:28,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:28,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:28,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:28,994 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-25 08:47:28,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:28,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:28,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:28,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:28,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:28,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:28,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:28,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:29,000 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-25 08:47:29,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:29,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:29,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:29,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:29,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:29,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:29,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:29,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:29,008 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-25 08:47:29,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:29,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:29,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:29,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:29,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:29,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:29,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:29,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:29,014 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:47:29,015 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7e9332d-ae32-4f57-a5f5-b8196b115a44/bin/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:29,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:29,017 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:29,018 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:29,018 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-25 08:47:29,019 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:29,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 08:47:29,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:29,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:29,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:29,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:29,219 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-25 08:47:29,219 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-25 08:47:29,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549 Second operand 8 states. [2019-11-25 08:47:29,377 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549. Second operand 8 states. Result 2132 states and 2669 transitions. Complement of second has 19 states. [2019-11-25 08:47:29,378 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-25 08:47:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-25 08:47:29,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-25 08:47:29,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:29,379 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:29,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:29,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 08:47:29,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:29,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:29,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:29,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:29,596 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-25 08:47:29,597 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-25 08:47:29,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549 Second operand 8 states. [2019-11-25 08:47:29,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549. Second operand 8 states. Result 2138 states and 2675 transitions. Complement of second has 27 states. [2019-11-25 08:47:29,781 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-25 08:47:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2019-11-25 08:47:29,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-25 08:47:29,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:29,782 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:29,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 08:47:29,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:29,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:29,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:29,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:30,017 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-25 08:47:30,017 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-25 08:47:30,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549 Second operand 8 states. [2019-11-25 08:47:30,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2063 states and 2598 transitions. cyclomatic complexity: 549. Second operand 8 states. Result 2872 states and 3553 transitions. Complement of second has 33 states. [2019-11-25 08:47:30,185 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-25 08:47:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2019-11-25 08:47:30,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 68 letters. Loop has 8 letters. [2019-11-25 08:47:30,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:30,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 76 letters. Loop has 8 letters. [2019-11-25 08:47:30,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:30,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 68 letters. Loop has 16 letters. [2019-11-25 08:47:30,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:30,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2872 states and 3553 transitions. [2019-11-25 08:47:30,215 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2019-11-25 08:47:30,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2872 states to 2220 states and 2790 transitions. [2019-11-25 08:47:30,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2019-11-25 08:47:30,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-11-25 08:47:30,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2220 states and 2790 transitions. [2019-11-25 08:47:30,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:30,239 INFO L688 BuchiCegarLoop]: Abstraction has 2220 states and 2790 transitions. [2019-11-25 08:47:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states and 2790 transitions. [2019-11-25 08:47:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2106. [2019-11-25 08:47:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-11-25 08:47:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2623 transitions. [2019-11-25 08:47:30,295 INFO L711 BuchiCegarLoop]: Abstraction has 2106 states and 2623 transitions. [2019-11-25 08:47:30,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:30,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-25 08:47:30,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:47:30,297 INFO L87 Difference]: Start difference. First operand 2106 states and 2623 transitions. Second operand 25 states. [2019-11-25 08:47:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:30,856 INFO L93 Difference]: Finished difference Result 1632 states and 1924 transitions. [2019-11-25 08:47:30,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:47:30,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1632 states and 1924 transitions. [2019-11-25 08:47:30,869 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:47:30,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1632 states to 0 states and 0 transitions. [2019-11-25 08:47:30,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:47:30,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:47:30,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:47:30,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:47:30,870 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:30,871 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:30,871 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:30,871 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-25 08:47:30,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:47:30,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:47:30,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:47:30,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:47:30 BoogieIcfgContainer [2019-11-25 08:47:30,878 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:47:30,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:30,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:30,879 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:30,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:00" (3/4) ... [2019-11-25 08:47:30,885 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:47:30,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:30,887 INFO L168 Benchmark]: Toolchain (without parser) took 31070.14 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 680.0 MB). Free memory was 948.7 MB in the beginning and 1.5 GB in the end (delta: -519.1 MB). Peak memory consumption was 160.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:30,887 INFO L168 Benchmark]: CDTParser took 0.22 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-25 08:47:30,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:30,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:30,888 INFO L168 Benchmark]: Boogie Preprocessor took 19.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:30,889 INFO L168 Benchmark]: RCFGBuilder took 380.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:30,889 INFO L168 Benchmark]: BuchiAutomizer took 30306.49 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 561.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -381.3 MB). Peak memory consumption was 179.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:30,890 INFO L168 Benchmark]: Witness Printer took 6.68 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 284.9 kB). Peak memory consumption was 284.9 kB. Max. memory is 11.5 GB. [2019-11-25 08:47:30,892 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.22 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 324.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30306.49 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 561.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -381.3 MB). Peak memory consumption was 179.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.68 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 284.9 kB). Peak memory consumption was 284.9 kB. 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 17 terminating modules (11 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. 11 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.2s and 13 iterations. TraceHistogramMax:48. Analysis of lassos took 18.0s. Construction of modules took 3.9s. Büchi inclusion checks took 7.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 776 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 2063 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 55/126 HoareTripleCheckerStatistics: 544 SDtfs, 1361 SDslu, 1945 SDs, 0 SdLazy, 4932 SolverSat, 871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI6 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: 24ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...