./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-cad4683 [2019-11-16 00:00:59,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:00:59,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:00:59,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:00:59,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:00:59,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:00:59,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:00:59,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:00:59,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:00:59,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:00:59,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:00:59,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:00:59,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:00:59,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:00:59,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:00:59,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:00:59,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:00:59,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:00:59,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:00:59,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:00:59,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:00:59,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:00:59,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:00:59,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:00:59,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:00:59,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:00:59,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:00:59,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:00:59,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:00:59,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:00:59,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:00:59,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:00:59,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:00:59,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:00:59,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:00:59,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:00:59,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:00:59,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:00:59,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:00:59,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:00:59,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:00:59,366 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:00:59,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:00:59,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:00:59,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:00:59,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:00:59,382 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:00:59,383 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:00:59,383 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:00:59,383 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:00:59,383 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:00:59,383 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:00:59,384 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:00:59,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:00:59,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:00:59,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:00:59,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:00:59,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:00:59,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:00:59,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:00:59,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:00:59,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:00:59,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:00:59,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:00:59,386 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:00:59,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:00:59,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:00:59,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:00:59,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:00:59,387 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:00:59,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:00:59,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:00:59,388 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:00:59,389 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:00:59,389 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:00:59,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:00:59,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:00:59,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:00:59,434 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:00:59,434 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:00:59,435 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-16 00:00:59,491 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/data/815420cc0/fa2426aa618241c797cb07b391885650/FLAG29f47f1c5 [2019-11-16 00:00:59,819 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:00:59,819 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-16 00:00:59,825 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/data/815420cc0/fa2426aa618241c797cb07b391885650/FLAG29f47f1c5 [2019-11-16 00:01:00,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/data/815420cc0/fa2426aa618241c797cb07b391885650 [2019-11-16 00:01:00,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:01:00,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:01:00,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:01:00,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:01:00,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:01:00,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642a0a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00, skipping insertion in model container [2019-11-16 00:01:00,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,240 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:01:00,254 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:01:00,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:01:00,386 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:01:00,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:01:00,476 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:01:00,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00 WrapperNode [2019-11-16 00:01:00,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:01:00,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:01:00,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:01:00,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:01:00,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:01:00,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:01:00,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:01:00,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:01:00,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... [2019-11-16 00:01:00,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:01:00,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:01:00,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:01:00,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:01:00,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:01:00,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:01:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-16 00:01:00,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-16 00:01:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-16 00:01:00,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-16 00:01:00,831 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:01:00,832 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:01:00,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:00 BoogieIcfgContainer [2019-11-16 00:01:00,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:01:00,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:01:00,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:01:00,847 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:01:00,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:01:00,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:01:00" (1/3) ... [2019-11-16 00:01:00,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ff9faa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:01:00, skipping insertion in model container [2019-11-16 00:01:00,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:01:00,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:00" (2/3) ... [2019-11-16 00:01:00,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ff9faa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:01:00, skipping insertion in model container [2019-11-16 00:01:00,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:01:00,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:00" (3/3) ... [2019-11-16 00:01:00,863 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-1.c [2019-11-16 00:01:00,949 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:01:00,949 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:01:00,957 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:01:00,957 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:01:00,957 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:01:00,958 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:01:00,958 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:01:00,958 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:01:00,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-16 00:01:01,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:01:01,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:01,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:01,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:01:01,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:01,026 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:01:01,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-16 00:01:01,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:01:01,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:01,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:01,033 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:01:01,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:01,041 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-11-16 00:01:01,042 INFO L793 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2019-11-16 00:01:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-11-16 00:01:01,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:01,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421839050] [2019-11-16 00:01:01,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:01,169 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-11-16 00:01:01,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:01,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979034636] [2019-11-16 00:01:01,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:01,193 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-11-16 00:01:01,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:01,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844414653] [2019-11-16 00:01:01,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:01,212 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:01,410 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:01,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:01,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:01,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:01,411 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:01,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:01,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:01,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:01,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-16 00:01:01,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:01,412 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:01,428 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-16 00:01:01,433 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-16 00:01:01,436 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-16 00:01:01,439 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-16 00:01:01,442 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-16 00:01:01,445 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-16 00:01:01,448 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-16 00:01:01,450 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-16 00:01:01,452 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-16 00:01: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-16 00:01:01,559 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:01,559 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:01:01,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,576 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:01,585 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,585 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:01,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:01,607 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,607 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,630 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-16 00:01:01,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,637 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,655 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-16 00:01:01,661 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,661 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,679 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-16 00:01:01,683 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,684 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:01,703 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,703 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:01,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,719 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:01,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,728 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:01,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:01,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:01,742 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:01,749 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:01,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:01,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:01,814 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:01,816 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:01,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:01,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:01,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:01,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:01,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:01,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:01,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:01,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-16 00:01:01,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:01,817 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:01,819 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-16 00:01:01,821 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-16 00:01:01,823 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-16 00:01:01,826 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-16 00:01:01,828 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-16 00:01:01,830 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-16 00:01:01,838 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-16 00:01:01,840 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-16 00:01:01,843 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-16 00:01:01,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:01,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:01,929 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:01,931 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-16 00:01:01,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,932 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,935 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,935 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,939 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-16 00:01:01,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,941 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,943 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-16 00:01:01,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,947 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-16 00:01:01,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,950 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-16 00:01:01,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,952 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,954 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-16 00:01:01,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:01:01,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,961 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-16 00:01:01,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:01,965 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-16 00:01:01,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:01,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:01,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:01,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:01,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:01,966 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:01,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:01,973 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:01,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:01,978 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:01,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:01,980 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:01,981 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:01,981 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-11-16 00:01:01,984 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:01:02,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:01:02,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:02,107 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-16 00:01:02,122 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-16 00:01:02,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-11-16 00:01:02,345 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-16 00:01:02,346 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-16 00:01:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:01:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-16 00:01:02,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-16 00:01:02,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:02,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-16 00:01:02,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:02,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-16 00:01:02,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:02,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-11-16 00:01:02,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:01:02,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-11-16 00:01:02,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-16 00:01:02,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-16 00:01:02,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-16 00:01:02,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:02,389 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-16 00:01:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-16 00:01:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-11-16 00:01:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:01:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-16 00:01:02,433 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-16 00:01:02,434 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-16 00:01:02,434 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:01:02,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-16 00:01:02,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:01:02,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:02,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:02,440 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:02,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:02,441 INFO L791 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2019-11-16 00:01:02,441 INFO L793 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2019-11-16 00:01:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-11-16 00:01:02,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:02,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317586910] [2019-11-16 00:01:02,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,603 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-16 00:01:02,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317586910] [2019-11-16 00:01:02,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297218947] [2019-11-16 00:01:02,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:01:02,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:02,668 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-16 00:01:02,669 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:02,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-16 00:01:02,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462820033] [2019-11-16 00:01:02,672 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-11-16 00:01:02,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:02,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090105577] [2019-11-16 00:01:02,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,749 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-16 00:01:02,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090105577] [2019-11-16 00:01:02,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:02,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:02,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033881844] [2019-11-16 00:01:02,751 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:02,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:02,755 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-16 00:01:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:02,866 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-11-16 00:01:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:01:02,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-11-16 00:01:02,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:01:02,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-11-16 00:01:02,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-16 00:01:02,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-16 00:01:02,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-11-16 00:01:02,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:02,886 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-11-16 00:01:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-11-16 00:01:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-16 00:01:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:01:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-16 00:01:02,896 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-16 00:01:02,896 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-16 00:01:02,896 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:01:02,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-16 00:01:02,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:01:02,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:02,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:02,902 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:02,902 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:02,902 INFO L791 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 387#L37 call main_#t~ret4 := fibo1(main_~x~0);< 388#fibo1ENTRY ~n := #in~n; 410#L8 assume !(~n < 1); 428#L10 assume !(1 == ~n); 383#L13 call #t~ret0 := fibo2(~n - 1);< 402#fibo2ENTRY ~n := #in~n; 430#L18 assume !(~n < 1); 431#L20 assume !(1 == ~n); 381#L23 call #t~ret2 := fibo1(~n - 1);< 386#fibo1ENTRY ~n := #in~n; 412#L8 assume !(~n < 1); 389#L10 assume 1 == ~n;#res := 1; 390#fibo1FINAL assume true; 406#fibo1EXIT >#45#return; 397#L23-1 [2019-11-16 00:01:02,903 INFO L793 eck$LassoCheckResult]: Loop: 397#L23-1 call #t~ret3 := fibo1(~n - 2);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume !(1 == ~n); 379#L13 call #t~ret0 := fibo2(~n - 1);< 424#fibo2ENTRY ~n := #in~n; 429#L18 assume !(~n < 1); 420#L20 assume !(1 == ~n); 377#L23 call #t~ret2 := fibo1(~n - 1);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume 1 == ~n;#res := 1; 408#fibo1FINAL assume true; 421#fibo1EXIT >#45#return; 397#L23-1 [2019-11-16 00:01:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:02,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-11-16 00:01:02,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:02,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201523839] [2019-11-16 00:01:02,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:03,009 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-16 00:01:03,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201523839] [2019-11-16 00:01:03,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706016662] [2019-11-16 00:01:03,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:03,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:01:03,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:03,073 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-16 00:01:03,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:03,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-16 00:01:03,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071770924] [2019-11-16 00:01:03,074 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-11-16 00:01:03,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:03,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447228902] [2019-11-16 00:01:03,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:03,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:03,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:03,097 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:03,309 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:03,309 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:03,309 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:03,309 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:03,309 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:03,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:03,310 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:03,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:03,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-16 00:01:03,310 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:03,310 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:03,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:03,315 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-16 00:01:03,317 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-16 00:01:03,327 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-16 00:01:03,330 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-16 00:01:03,336 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-16 00:01:03,339 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-16 00:01:03,342 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-16 00:01:03,344 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-16 00:01:03,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:03,420 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:03,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:03,433 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:03,438 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:03,438 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:03,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:03,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:03,458 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:03,458 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:03,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:03,466 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:03,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:03,485 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:04,453 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:04,455 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:04,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:04,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:04,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:04,455 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:04,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:04,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:04,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:04,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-16 00:01:04,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:04,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:04,457 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-16 00:01:04,472 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-16 00:01:04,474 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-16 00:01:04,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-16 00:01:04,485 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-16 00:01:04,488 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-16 00:01:04,491 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-16 00:01:04,493 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-16 00:01:04,496 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-16 00:01:04,582 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:04,582 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:04,583 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-16 00:01:04,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:04,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:04,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:04,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:04,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:04,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:04,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:04,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:04,587 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-16 00:01:04,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:04,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:04,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:04,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:04,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:04,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:04,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:04,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:04,590 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-16 00:01:04,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:04,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:04,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:04,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:04,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:04,615 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:04,615 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:04,626 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:04,634 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:04,642 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:04,643 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:04,644 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:04,644 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:04,645 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-16 00:01:04,646 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:04,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:01:04,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:04,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:01:04,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:04,831 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-16 00:01:04,832 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-16 00:01:04,832 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-16 00:01:05,165 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-16 00:01:05,166 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-16 00:01:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:01:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-11-16 00:01:05,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-11-16 00:01:05,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:05,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-11-16 00:01:05,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:05,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-11-16 00:01:05,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:05,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-11-16 00:01:05,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:01:05,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-11-16 00:01:05,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-16 00:01:05,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-16 00:01:05,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-11-16 00:01:05,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:05,186 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-11-16 00:01:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-11-16 00:01:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-16 00:01:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-16 00:01:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-11-16 00:01:05,204 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-11-16 00:01:05,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:01:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:05,204 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-11-16 00:01:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:05,345 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-11-16 00:01:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:01:05,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-11-16 00:01:05,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:01:05,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-11-16 00:01:05,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-16 00:01:05,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-16 00:01:05,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-11-16 00:01:05,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:05,362 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-11-16 00:01:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-11-16 00:01:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-11-16 00:01:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-16 00:01:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-11-16 00:01:05,375 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-16 00:01:05,375 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-16 00:01:05,375 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:01:05,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-11-16 00:01:05,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:01:05,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:05,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:05,382 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-16 00:01:05,383 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-16 00:01:05,383 INFO L791 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1188#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1189#fibo1ENTRY ~n := #in~n; 1259#L8 assume !(~n < 1); 1257#L10 assume !(1 == ~n); 1180#L13 call #t~ret0 := fibo2(~n - 1);< 1200#fibo2ENTRY ~n := #in~n; 1218#L18 assume !(~n < 1); 1224#L20 assume !(1 == ~n); 1204#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume !(~n < 1); 1256#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1183#fibo2EXIT >#49#return; 1169#L13-1 call #t~ret1 := fibo2(~n - 2);< 1205#fibo2ENTRY ~n := #in~n; 1226#L18 assume !(~n < 1); 1227#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1253#L8 assume !(~n < 1); 1262#L10 assume 1 == ~n;#res := 1; 1263#fibo1FINAL assume true; 1258#fibo1EXIT >#45#return; 1242#L23-1 call #t~ret3 := fibo1(~n - 2);< 1187#fibo1ENTRY ~n := #in~n; 1252#L8 assume !(~n < 1); 1250#L10 assume !(1 == ~n); 1186#L13 call #t~ret0 := fibo2(~n - 1);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume ~n < 1;#res := 0; 1239#fibo2FINAL assume true; 1244#fibo2EXIT >#49#return; 1185#L13-1 call #t~ret1 := fibo2(~n - 2);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume !(~n < 1); 1233#L20 assume 1 == ~n;#res := 1; 1234#fibo2FINAL assume true; 1219#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-16 00:01:05,383 INFO L793 eck$LassoCheckResult]: Loop: 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-16 00:01:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-11-16 00:01:05,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:05,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706201915] [2019-11-16 00:01:05,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:05,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:05,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,738 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-16 00:01:05,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706201915] [2019-11-16 00:01:05,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508698828] [2019-11-16 00:01:05,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:01:05,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:05,883 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-16 00:01:05,883 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:05,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-16 00:01:05,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209955415] [2019-11-16 00:01:05,885 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:05,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:05,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-11-16 00:01:05,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:05,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187591390] [2019-11-16 00:01:05,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:05,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:05,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,020 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-16 00:01:06,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187591390] [2019-11-16 00:01:06,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904806390] [2019-11-16 00:01:06,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:01:06,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:06,116 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-16 00:01:06,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:06,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-11-16 00:01:06,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142714303] [2019-11-16 00:01:06,118 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:06,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:01:06,118 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-11-16 00:01:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:06,188 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-11-16 00:01:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:01:06,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-11-16 00:01:06,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:01:06,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-11-16 00:01:06,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-16 00:01:06,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-16 00:01:06,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-11-16 00:01:06,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:06,208 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-11-16 00:01:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-11-16 00:01:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-16 00:01:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-16 00:01:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-11-16 00:01:06,232 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-16 00:01:06,232 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-16 00:01:06,232 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:01:06,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-11-16 00:01:06,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:01:06,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:06,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:06,242 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-16 00:01:06,243 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-16 00:01:06,245 INFO L791 eck$LassoCheckResult]: Stem: 2260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 2232#L37 call main_#t~ret4 := fibo1(main_~x~0);< 2233#fibo1ENTRY ~n := #in~n; 2266#L8 assume !(~n < 1); 2231#L10 assume !(1 == ~n); 2217#L13 call #t~ret0 := fibo2(~n - 1);< 2245#fibo2ENTRY ~n := #in~n; 2351#L18 assume !(~n < 1); 2350#L20 assume !(1 == ~n); 2216#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume 1 == ~n;#res := 1; 2221#fibo2FINAL assume true; 2223#fibo2EXIT >#49#return; 2248#L13-1 call #t~ret1 := fibo2(~n - 2);< 2250#fibo2ENTRY ~n := #in~n; 2264#L18 assume !(~n < 1); 2268#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2259#L8 assume !(~n < 1); 2303#L10 assume 1 == ~n;#res := 1; 2301#fibo1FINAL assume true; 2300#fibo1EXIT >#45#return; 2229#L23-1 call #t~ret3 := fibo1(~n - 2);< 2227#fibo1ENTRY ~n := #in~n; 2293#L8 assume !(~n < 1); 2292#L10 assume !(1 == ~n); 2226#L13 call #t~ret0 := fibo2(~n - 1);< 2288#fibo2ENTRY ~n := #in~n; 2281#L18 assume !(~n < 1); 2277#L20 assume 1 == ~n;#res := 1; 2278#fibo2FINAL assume true; 2329#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-16 00:01:06,245 INFO L793 eck$LassoCheckResult]: Loop: 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-16 00:01:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-11-16 00:01:06,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:06,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846609603] [2019-11-16 00:01:06,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,562 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-16 00:01:06,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846609603] [2019-11-16 00:01:06,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038423871] [2019-11-16 00:01:06,563 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:06,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:06,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:06,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:01:06,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:06,745 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-16 00:01:06,746 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:06,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-11-16 00:01:06,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263470652] [2019-11-16 00:01:06,747 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-11-16 00:01:06,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:06,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869637064] [2019-11-16 00:01:06,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,884 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-16 00:01:06,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869637064] [2019-11-16 00:01:06,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111344903] [2019-11-16 00:01:06,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:01:06,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:07,061 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-16 00:01:07,062 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:07,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-16 00:01:07,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947571730] [2019-11-16 00:01:07,066 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:07,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:07,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:01:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:01:07,067 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-11-16 00:01:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:07,381 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-11-16 00:01:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:01:07,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-11-16 00:01:07,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-16 00:01:07,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-11-16 00:01:07,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-16 00:01:07,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-16 00:01:07,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-11-16 00:01:07,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:07,388 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-11-16 00:01:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-11-16 00:01:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-16 00:01:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-16 00:01:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-11-16 00:01:07,397 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-16 00:01:07,397 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-16 00:01:07,397 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:01:07,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-11-16 00:01:07,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-16 00:01:07,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:07,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:07,399 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-16 00:01:07,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:07,400 INFO L791 eck$LassoCheckResult]: Stem: 3324#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 3300#L37 call main_#t~ret4 := fibo1(main_~x~0);< 3301#fibo1ENTRY ~n := #in~n; 3338#L8 assume !(~n < 1); 3356#L10 assume !(1 == ~n); 3298#L13 call #t~ret0 := fibo2(~n - 1);< 3320#fibo2ENTRY ~n := #in~n; 3330#L18 assume !(~n < 1); 3334#L20 assume !(1 == ~n); 3297#L23 call #t~ret2 := fibo1(~n - 1);< 3299#fibo1ENTRY ~n := #in~n; 3327#L8 assume !(~n < 1); 3399#L10 assume !(1 == ~n); 3336#L13 call #t~ret0 := fibo2(~n - 1);< 3349#fibo2ENTRY ~n := #in~n; 3335#L18 assume !(~n < 1); 3337#L20 assume 1 == ~n;#res := 1; 3401#fibo2FINAL assume true; 3341#fibo2EXIT >#49#return; 3309#L13-1 call #t~ret1 := fibo2(~n - 2);< 3328#fibo2ENTRY ~n := #in~n; 3329#L18 assume ~n < 1;#res := 0; 3308#fibo2FINAL assume true; 3310#fibo2EXIT >#51#return; 3322#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3323#fibo1FINAL assume true; 3402#fibo1EXIT >#45#return; 3311#L23-1 call #t~ret3 := fibo1(~n - 2);< 3312#fibo1ENTRY ~n := #in~n; 3397#L8 assume !(~n < 1); 3395#L10 assume !(1 == ~n); 3293#L13 call #t~ret0 := fibo2(~n - 1);< 3381#fibo2ENTRY ~n := #in~n; 3398#L18 assume !(~n < 1); 3396#L20 assume !(1 == ~n); 3292#L23 [2019-11-16 00:01:07,400 INFO L793 eck$LassoCheckResult]: Loop: 3292#L23 call #t~ret2 := fibo1(~n - 1);< 3294#fibo1ENTRY ~n := #in~n; 3325#L8 assume !(~n < 1); 3332#L10 assume !(1 == ~n); 3296#L13 call #t~ret0 := fibo2(~n - 1);< 3319#fibo2ENTRY ~n := #in~n; 3384#L18 assume !(~n < 1); 3383#L20 assume !(1 == ~n); 3292#L23 [2019-11-16 00:01:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-11-16 00:01:07,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:07,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804764187] [2019-11-16 00:01:07,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:07,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:07,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:07,684 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-16 00:01:07,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804764187] [2019-11-16 00:01:07,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307611079] [2019-11-16 00:01:07,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:07,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:01:07,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:07,795 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-16 00:01:07,796 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:07,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-11-16 00:01:07,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007849302] [2019-11-16 00:01:07,796 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-11-16 00:01:07,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:07,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797593528] [2019-11-16 00:01:07,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:07,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:07,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:07,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:07,909 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:07,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:07,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:07,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:07,910 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:07,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:07,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:07,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:07,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-16 00:01:07,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:07,910 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:07,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-16 00:01:07,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-16 00:01:07,915 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-16 00:01:07,918 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-16 00:01:07,921 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-16 00:01:07,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-16 00:01:07,930 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-16 00:01:07,942 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-16 00:01:07,944 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-16 00:01:08,001 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:08,001 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:08,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:08,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:08,015 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:08,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:08,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:08,023 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:08,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:08,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:08,034 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:08,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:08,042 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:08,042 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:08,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:08,050 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:08,050 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:08,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:08,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:08,058 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:08,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:08,063 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:08,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:08,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:09,118 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:09,120 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:09,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:09,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:09,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:09,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:09,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:09,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:09,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:09,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-16 00:01:09,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:09,121 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:09,121 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-16 00:01:09,124 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-16 00:01:09,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-16 00:01:09,138 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-16 00:01:09,140 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-16 00:01:09,142 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-16 00:01:09,144 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-16 00:01:09,151 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-16 00:01:09,152 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-16 00:01:09,191 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:09,192 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:09,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:01:09,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:09,194 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-16 00:01:09,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:09,196 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-16 00:01:09,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,197 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:09,198 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-16 00:01:09,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,199 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,199 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:09,199 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-16 00:01:09,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,201 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:09,201 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-16 00:01:09,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:09,203 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-16 00:01:09,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:09,203 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:09,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:09,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:09,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:09,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:09,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:09,208 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:09,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:09,210 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:09,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:09,210 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:09,210 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:09,211 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-16 00:01:09,211 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:09,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:01:09,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:09,368 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-16 00:01:09,369 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-16 00:01:09,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-16 00:01:09,494 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-16 00:01:09,494 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-16 00:01:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:01:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-16 00:01:09,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-16 00:01:09,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:09,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:09,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:09,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:01:09,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:09,621 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-16 00:01:09,621 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-16 00:01:09,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-16 00:01:09,808 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-16 00:01:09,810 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-16 00:01:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:01:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-11-16 00:01:09,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-16 00:01:09,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:09,811 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:09,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:09,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:01:09,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:09,964 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-16 00:01:09,964 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-16 00:01:09,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-16 00:01:10,107 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-16 00:01:10,109 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-16 00:01:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:01:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-11-16 00:01:10,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-16 00:01:10,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:10,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-16 00:01:10,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:10,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-11-16 00:01:10,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:10,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-11-16 00:01:10,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-11-16 00:01:10,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-11-16 00:01:10,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-16 00:01:10,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-11-16 00:01:10,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-11-16 00:01:10,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:10,125 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-16 00:01:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-11-16 00:01:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-16 00:01:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-16 00:01:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-11-16 00:01:10,135 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-11-16 00:01:10,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:01:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:01:10,136 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-11-16 00:01:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:10,446 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-11-16 00:01:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:01:10,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-11-16 00:01:10,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-16 00:01:10,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-11-16 00:01:10,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-16 00:01:10,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-11-16 00:01:10,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-11-16 00:01:10,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:10,453 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-11-16 00:01:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-11-16 00:01:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-16 00:01:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-16 00:01:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-16 00:01:10,458 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-16 00:01:10,458 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-16 00:01:10,459 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:01:10,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-11-16 00:01:10,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-16 00:01:10,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:10,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:10,461 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-16 00:01:10,461 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-16 00:01:10,461 INFO L791 eck$LassoCheckResult]: Stem: 5261#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 5240#L37 call main_#t~ret4 := fibo1(main_~x~0);< 5246#fibo1ENTRY ~n := #in~n; 5299#L8 assume !(~n < 1); 5239#L10 assume !(1 == ~n); 5241#L13 call #t~ret0 := fibo2(~n - 1);< 5252#fibo2ENTRY ~n := #in~n; 5265#L18 assume !(~n < 1); 5273#L20 assume !(1 == ~n); 5294#L23 call #t~ret2 := fibo1(~n - 1);< 5296#fibo1ENTRY ~n := #in~n; 5290#L8 assume !(~n < 1); 5295#L10 assume !(1 == ~n); 5231#L13 call #t~ret0 := fibo2(~n - 1);< 5293#fibo2ENTRY ~n := #in~n; 5292#L18 assume !(~n < 1); 5291#L20 assume !(1 == ~n); 5250#L23 call #t~ret2 := fibo1(~n - 1);< 5289#fibo1ENTRY ~n := #in~n; 5284#L8 assume !(~n < 1); 5285#L10 assume !(1 == ~n); 5244#L13 call #t~ret0 := fibo2(~n - 1);< 5251#fibo2ENTRY ~n := #in~n; 5286#L18 assume !(~n < 1); 5267#L20 assume 1 == ~n;#res := 1; 5243#fibo2FINAL assume true; 5245#fibo2EXIT >#49#return; 5254#L13-1 call #t~ret1 := fibo2(~n - 2);< 5255#fibo2ENTRY ~n := #in~n; 5271#L18 assume ~n < 1;#res := 0; 5272#fibo2FINAL assume true; 5342#fibo2EXIT >#51#return; 5256#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5257#fibo1FINAL assume true; 5249#fibo1EXIT >#45#return; 5237#L23-1 call #t~ret3 := fibo1(~n - 2);< 5242#fibo1ENTRY ~n := #in~n; 5258#L8 assume ~n < 1;#res := 0; 5238#fibo1FINAL assume true; 5253#fibo1EXIT >#47#return; 5247#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-16 00:01:10,461 INFO L793 eck$LassoCheckResult]: Loop: 5281#L13-1 call #t~ret1 := fibo2(~n - 2);< 5302#fibo2ENTRY ~n := #in~n; 5279#L18 assume !(~n < 1); 5283#L20 assume !(1 == ~n); 5260#L23 call #t~ret2 := fibo1(~n - 1);< 5235#fibo1ENTRY ~n := #in~n; 5259#L8 assume !(~n < 1); 5266#L10 assume !(1 == ~n); 5234#L13 call #t~ret0 := fibo2(~n - 1);< 5298#fibo2ENTRY ~n := #in~n; 5297#L18 assume !(~n < 1); 5268#L20 assume !(1 == ~n); 5270#L23 call #t~ret2 := fibo1(~n - 1);< 5335#fibo1ENTRY ~n := #in~n; 5339#L8 assume !(~n < 1); 5337#L10 assume 1 == ~n;#res := 1; 5336#fibo1FINAL assume true; 5333#fibo1EXIT >#45#return; 5320#L23-1 call #t~ret3 := fibo1(~n - 2);< 5322#fibo1ENTRY ~n := #in~n; 5326#L8 assume ~n < 1;#res := 0; 5324#fibo1FINAL assume true; 5319#fibo1EXIT >#47#return; 5316#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-16 00:01:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-11-16 00:01:10,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:10,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119027619] [2019-11-16 00:01:10,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,600 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-16 00:01:10,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119027619] [2019-11-16 00:01:10,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112474511] [2019-11-16 00:01:10,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:01:10,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:10,814 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-16 00:01:10,814 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:10,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-11-16 00:01:10,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24306800] [2019-11-16 00:01:10,815 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-11-16 00:01:10,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:10,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370874344] [2019-11-16 00:01:10,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:10,829 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:11,078 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:11,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:11,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:11,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:11,078 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:11,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:11,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:11,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:11,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-16 00:01:11,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:11,079 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:11,080 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-16 00:01:11,083 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-16 00:01:11,085 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-16 00:01:11,106 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-16 00:01:11,108 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-16 00:01:11,109 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-16 00:01:11,110 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-16 00:01:11,112 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-16 00:01:11,117 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-16 00:01:11,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:11,159 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:11,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:11,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:11,165 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:11,165 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:11,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:11,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:11,172 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:11,172 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:11,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:11,176 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:11,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:11,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:11,934 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:11,935 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:11,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:11,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:11,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:11,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:11,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:11,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:11,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:11,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-16 00:01:11,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:11,936 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:11,937 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-16 00:01:11,939 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-16 00:01:11,942 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-16 00:01:11,948 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-16 00:01:11,949 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-16 00:01:11,950 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-16 00:01:11,952 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-16 00:01:11,953 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-16 00:01:11,955 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-16 00:01:11,990 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:11,991 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:11,991 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-16 00:01:11,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:11,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:11,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:11,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:11,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:11,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:11,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:11,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:11,993 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-16 00:01:11,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:11,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:11,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:11,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:11,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:11,994 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:11,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:11,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:11,995 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-16 00:01:11,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:11,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:11,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:11,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:11,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:11,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:11,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:11,997 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:11,998 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:11,998 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:11,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:11,998 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:11,998 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:11,998 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-16 00:01:11,999 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:12,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:01:12,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:12,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:12,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:01:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:12,196 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-16 00:01:12,196 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-16 00:01:12,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-16 00:01:12,555 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-16 00:01:12,556 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-16 00:01:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:01:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-11-16 00:01:12,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-16 00:01:12,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:12,557 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:12,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:01:12,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:12,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:12,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:01:12,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:12,752 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-16 00:01:12,753 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-16 00:01:12,753 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-16 00:01:12,995 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-16 00:01:12,997 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-16 00:01:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:01:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-11-16 00:01:12,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-16 00:01:12,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:12,998 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:13,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:01:13,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:13,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:13,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:13,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:13,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:13,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:01:13,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:13,178 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-16 00:01:13,178 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-16 00:01:13,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-16 00:01:13,507 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-16 00:01:13,518 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-16 00:01:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:01:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-11-16 00:01:13,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-16 00:01:13,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:13,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-11-16 00:01:13,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-16 00:01:13,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:13,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-11-16 00:01:13,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-16 00:01:13,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-11-16 00:01:13,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-16 00:01:13,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-16 00:01:13,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-11-16 00:01:13,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:13,550 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-11-16 00:01:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-11-16 00:01:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-11-16 00:01:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-16 00:01:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-11-16 00:01:13,573 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-11-16 00:01:13,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:13,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:01:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:01:13,574 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-11-16 00:01:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:13,904 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-11-16 00:01:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:01:13,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-11-16 00:01:13,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:13,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-11-16 00:01:13,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-11-16 00:01:13,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-11-16 00:01:13,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-11-16 00:01:13,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:13,919 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-11-16 00:01:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-11-16 00:01:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-11-16 00:01:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-16 00:01:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-11-16 00:01:13,934 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-16 00:01:13,934 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-16 00:01:13,934 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:01:13,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-11-16 00:01:13,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:13,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:13,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:13,956 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-16 00:01:13,957 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-16 00:01:13,957 INFO L791 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~ret2;havoc #t~ret3; 8775#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8627#L13-1 [2019-11-16 00:01:13,960 INFO L793 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 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~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 [2019-11-16 00:01:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-11-16 00:01:13,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:13,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304713788] [2019-11-16 00:01:13,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,200 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-16 00:01:14,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304713788] [2019-11-16 00:01:14,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56957861] [2019-11-16 00:01:14,201 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:14,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:14,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:14,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:14,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01: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-16 00:01:14,323 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:14,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-11-16 00:01:14,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679993207] [2019-11-16 00:01:14,324 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1098821556, now seen corresponding path program 1 times [2019-11-16 00:01:14,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:14,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945719149] [2019-11-16 00:01:14,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:14,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:14,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,717 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-16 00:01:15,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945719149] [2019-11-16 00:01:15,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813717464] [2019-11-16 00:01:15,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:15,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:01:15,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:16,088 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-16 00:01:16,088 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:16,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-11-16 00:01:16,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428387616] [2019-11-16 00:01:16,089 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:16,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:01:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:01:16,090 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-11-16 00:01:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:16,581 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-11-16 00:01:16,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:01:16,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-11-16 00:01:16,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:16,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-11-16 00:01:16,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-11-16 00:01:16,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-11-16 00:01:16,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-11-16 00:01:16,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:16,599 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-11-16 00:01:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-11-16 00:01:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-11-16 00:01:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-16 00:01:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-11-16 00:01:16,620 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-16 00:01:16,620 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-16 00:01:16,620 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:01:16,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-11-16 00:01:16,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:16,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:16,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:16,625 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-16 00:01:16,625 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-16 00:01:16,626 INFO L791 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~ret2;havoc #t~ret3; 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-16 00:01:16,626 INFO L793 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~ret2;havoc #t~ret3; 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-16 00:01:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-11-16 00:01:16,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:16,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581283431] [2019-11-16 00:01:16,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:16,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:16,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,031 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-16 00:01:17,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581283431] [2019-11-16 00:01:17,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288060686] [2019-11-16 00:01:17,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:17,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:17,207 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-16 00:01:17,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:17,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-11-16 00:01:17,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54871730] [2019-11-16 00:01:17,209 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-11-16 00:01:17,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:17,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835058940] [2019-11-16 00:01:17,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:17,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:17,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,318 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-16 00:01:17,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835058940] [2019-11-16 00:01:17,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408275960] [2019-11-16 00:01:17,319 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:17,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:17,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:17,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:01:17,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:17,463 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-16 00:01:17,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:17,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-16 00:01:17,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623661645] [2019-11-16 00:01:17,464 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:17,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:01:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:01:17,464 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-11-16 00:01:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:17,672 INFO L93 Difference]: Finished difference Result 549 states and 744 transitions. [2019-11-16 00:01:17,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:01:17,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 744 transitions. [2019-11-16 00:01:17,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:17,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 524 states and 708 transitions. [2019-11-16 00:01:17,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2019-11-16 00:01:17,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-16 00:01:17,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 708 transitions. [2019-11-16 00:01:17,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:17,687 INFO L688 BuchiCegarLoop]: Abstraction has 524 states and 708 transitions. [2019-11-16 00:01:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 708 transitions. [2019-11-16 00:01:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2019-11-16 00:01:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-16 00:01:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2019-11-16 00:01:17,702 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-16 00:01:17,703 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-16 00:01:17,703 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:01:17,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 661 transitions. [2019-11-16 00:01:17,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:17,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:17,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:17,709 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-16 00:01:17,709 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-16 00:01:17,710 INFO L791 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~ret2;havoc #t~ret3; 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-16 00:01:17,710 INFO L793 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~ret2;havoc #t~ret3; 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-16 00:01:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 783666534, now seen corresponding path program 1 times [2019-11-16 00:01:17,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:17,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186179210] [2019-11-16 00:01:17,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:17,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:17,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,881 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-16 00:01:17,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186179210] [2019-11-16 00:01:17,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210674073] [2019-11-16 00:01:17,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:17,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:17,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:18,050 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-16 00:01:18,050 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:18,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-11-16 00:01:18,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114449962] [2019-11-16 00:01:18,051 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1056491202, now seen corresponding path program 2 times [2019-11-16 00:01:18,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:18,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071106465] [2019-11-16 00:01:18,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:18,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,122 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-16 00:01:18,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071106465] [2019-11-16 00:01:18,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052388272] [2019-11-16 00:01:18,123 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:18,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:18,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:18,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:01:18,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:18,307 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-16 00:01:18,307 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:18,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-16 00:01:18,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817845876] [2019-11-16 00:01:18,308 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:18,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:01:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:01:18,309 INFO L87 Difference]: Start difference. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 15 states. [2019-11-16 00:01:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:18,539 INFO L93 Difference]: Finished difference Result 518 states and 690 transitions. [2019-11-16 00:01:18,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:01:18,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 690 transitions. [2019-11-16 00:01:18,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:18,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 518 states and 690 transitions. [2019-11-16 00:01:18,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-11-16 00:01:18,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-11-16 00:01:18,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 690 transitions. [2019-11-16 00:01:18,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:18,559 INFO L688 BuchiCegarLoop]: Abstraction has 518 states and 690 transitions. [2019-11-16 00:01:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 690 transitions. [2019-11-16 00:01:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2019-11-16 00:01:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-16 00:01:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 650 transitions. [2019-11-16 00:01:18,577 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-16 00:01:18,577 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-16 00:01:18,577 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:01:18,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 650 transitions. [2019-11-16 00:01:18,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-16 00:01:18,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:18,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:18,583 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-16 00:01:18,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:18,583 INFO L791 eck$LassoCheckResult]: Stem: 18014#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 17965#L37 call main_#t~ret4 := fibo1(main_~x~0);< 17966#fibo1ENTRY ~n := #in~n; 18204#L8 assume !(~n < 1); 18191#L10 assume !(1 == ~n); 18182#L13 call #t~ret0 := fibo2(~n - 1);< 18208#fibo2ENTRY ~n := #in~n; 18207#L18 assume !(~n < 1); 18206#L20 assume !(1 == ~n); 18188#L23 call #t~ret2 := fibo1(~n - 1);< 18205#fibo1ENTRY ~n := #in~n; 18197#L8 assume !(~n < 1); 18198#L10 assume !(1 == ~n); 17963#L13 call #t~ret0 := fibo2(~n - 1);< 18189#fibo2ENTRY ~n := #in~n; 18268#L18 assume !(~n < 1); 18261#L20 assume !(1 == ~n); 17962#L23 call #t~ret2 := fibo1(~n - 1);< 17964#fibo1ENTRY ~n := #in~n; 18017#L8 assume !(~n < 1); 18406#L10 assume !(1 == ~n); 17960#L13 call #t~ret0 := fibo2(~n - 1);< 18187#fibo2ENTRY ~n := #in~n; 18203#L18 assume !(~n < 1); 18202#L20 assume !(1 == ~n); 17958#L23 call #t~ret2 := fibo1(~n - 1);< 17961#fibo1ENTRY ~n := #in~n; 18432#L8 assume !(~n < 1); 18431#L10 assume 1 == ~n;#res := 1; 18428#fibo1FINAL assume true; 18424#fibo1EXIT >#45#return; 18419#L23-1 call #t~ret3 := fibo1(~n - 2);< 17973#fibo1ENTRY ~n := #in~n; 18429#L8 assume !(~n < 1); 18427#L10 assume 1 == ~n;#res := 1; 18423#fibo1FINAL assume true; 18418#fibo1EXIT >#47#return; 18415#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 18410#fibo2FINAL assume true; 18404#fibo2EXIT >#49#return; 18007#L13-1 call #t~ret1 := fibo2(~n - 2);< 18009#fibo2ENTRY ~n := #in~n; 18021#L18 assume !(~n < 1); 18032#L20 assume 1 == ~n;#res := 1; 18033#fibo2FINAL assume true; 18396#fibo2EXIT >#51#return; 18397#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18452#fibo1FINAL assume true; 18447#fibo1EXIT >#45#return; 17989#L23-1 call #t~ret3 := fibo1(~n - 2);< 18352#fibo1ENTRY ~n := #in~n; 18391#L8 assume !(~n < 1); 18040#L10 assume !(1 == ~n); 18041#L13 [2019-11-16 00:01:18,583 INFO L793 eck$LassoCheckResult]: Loop: 18041#L13 call #t~ret0 := fibo2(~n - 1);< 18183#fibo2ENTRY ~n := #in~n; 18269#L18 assume !(~n < 1); 18262#L20 assume !(1 == ~n); 18185#L23 call #t~ret2 := fibo1(~n - 1);< 18255#fibo1ENTRY ~n := #in~n; 18254#L8 assume !(~n < 1); 18252#L10 assume !(1 == ~n); 18177#L13 call #t~ret0 := fibo2(~n - 1);< 18186#fibo2ENTRY ~n := #in~n; 18270#L18 assume !(~n < 1); 18264#L20 assume !(1 == ~n); 18266#L23 call #t~ret2 := fibo1(~n - 1);< 18414#fibo1ENTRY ~n := #in~n; 18435#L8 assume !(~n < 1); 18434#L10 assume 1 == ~n;#res := 1; 18433#fibo1FINAL assume true; 18411#fibo1EXIT >#45#return; 17968#L23-1 call #t~ret3 := fibo1(~n - 2);< 18015#fibo1ENTRY ~n := #in~n; 18016#L8 assume ~n < 1;#res := 0; 18030#fibo1FINAL assume true; 18409#fibo1EXIT >#47#return; 18408#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 18407#fibo2FINAL assume true; 18355#fibo2EXIT >#49#return; 18019#L13-1 call #t~ret1 := fibo2(~n - 2);< 18009#fibo2ENTRY ~n := #in~n; 18021#L18 assume !(~n < 1); 18032#L20 assume 1 == ~n;#res := 1; 18033#fibo2FINAL assume true; 18396#fibo2EXIT >#51#return; 18394#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18350#fibo1FINAL assume true; 18343#fibo1EXIT >#45#return; 18340#L23-1 call #t~ret3 := fibo1(~n - 2);< 18351#fibo1ENTRY ~n := #in~n; 18372#L8 assume !(~n < 1); 18361#L10 assume !(1 == ~n); 18041#L13 [2019-11-16 00:01:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1614825140, now seen corresponding path program 1 times [2019-11-16 00:01:18,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:18,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421971976] [2019-11-16 00:01:18,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:18,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:18,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,786 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-16 00:01:18,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421971976] [2019-11-16 00:01:18,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466400195] [2019-11-16 00:01:18,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:18,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:01:18,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:18,957 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-16 00:01:18,957 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:18,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2019-11-16 00:01:18,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792781705] [2019-11-16 00:01:18,958 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1482455256, now seen corresponding path program 1 times [2019-11-16 00:01:18,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:18,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650556706] [2019-11-16 00:01:18,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:18,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:18,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:18,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:19,262 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:19,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:19,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:19,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:19,263 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:19,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:19,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:19,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:19,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-11-16 00:01:19,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:19,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:19,263 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-16 00:01:19,265 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-16 00:01:19,270 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-16 00:01:19,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:19,273 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-16 00:01:19,274 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-16 00:01:19,275 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-16 00:01:19,277 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-16 00:01:19,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:19,309 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:19,309 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:19,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:19,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:19,315 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:19,315 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:19,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:19,320 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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-16 00:01:19,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:19,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:01:19,401 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:19,402 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:19,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:19,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:19,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:19,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:19,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:19,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:19,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:19,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-11-16 00:01:19,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:19,403 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:19,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:19,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:19,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:19,424 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-16 00:01:19,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:19,427 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-16 00:01:19,428 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-16 00:01:19,430 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-16 00:01:19,431 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-16 00:01:19,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:19,470 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:19,470 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-16 00:01:19,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:19,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:19,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:19,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:19,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:19,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:19,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:19,474 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:19,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:19,475 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:19,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:19,476 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:19,476 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:19,476 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-16 00:01:19,477 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:19,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:01:19,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:19,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:19,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:19,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:19,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:19,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:01:19,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:01:19,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-16 00:01:19,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-11-16 00:01:20,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 1572 states and 2057 transitions. Complement of second has 49 states. [2019-11-16 00:01:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-16 00:01:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:01:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2019-11-16 00:01:20,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 53 letters. Loop has 39 letters. [2019-11-16 00:01:20,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:20,366 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:20,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:01:20,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:20,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:20,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:01:20,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:01:20,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-16 00:01:20,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-11-16 00:01:21,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 1677 states and 2221 transitions. Complement of second has 51 states. [2019-11-16 00:01:21,260 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-16 00:01:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:01:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2019-11-16 00:01:21,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 53 letters. Loop has 39 letters. [2019-11-16 00:01:21,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:21,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:21,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:01:21,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:21,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:21,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:21,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:21,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:21,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:01:21,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:01:21,632 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 11 loop predicates [2019-11-16 00:01:21,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-11-16 00:01:22,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 2658 states and 3274 transitions. Complement of second has 128 states. [2019-11-16 00:01:22,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-16 00:01:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:01:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-11-16 00:01:22,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 53 letters. Loop has 39 letters. [2019-11-16 00:01:22,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:22,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 92 letters. Loop has 39 letters. [2019-11-16 00:01:22,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 53 letters. Loop has 78 letters. [2019-11-16 00:01:22,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:22,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2658 states and 3274 transitions. [2019-11-16 00:01:22,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-16 00:01:22,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2658 states to 1693 states and 2197 transitions. [2019-11-16 00:01:22,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 324 [2019-11-16 00:01:22,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2019-11-16 00:01:22,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1693 states and 2197 transitions. [2019-11-16 00:01:22,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:22,448 INFO L688 BuchiCegarLoop]: Abstraction has 1693 states and 2197 transitions. [2019-11-16 00:01:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states and 2197 transitions. [2019-11-16 00:01:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1488. [2019-11-16 00:01:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-11-16 00:01:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1848 transitions. [2019-11-16 00:01:22,498 INFO L711 BuchiCegarLoop]: Abstraction has 1488 states and 1848 transitions. [2019-11-16 00:01:22,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:01:22,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:01:22,499 INFO L87 Difference]: Start difference. First operand 1488 states and 1848 transitions. Second operand 22 states. [2019-11-16 00:01:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:22,966 INFO L93 Difference]: Finished difference Result 1553 states and 1910 transitions. [2019-11-16 00:01:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:01:22,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1553 states and 1910 transitions. [2019-11-16 00:01:22,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-11-16 00:01:22,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1553 states to 1494 states and 1849 transitions. [2019-11-16 00:01:22,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2019-11-16 00:01:22,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2019-11-16 00:01:22,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1494 states and 1849 transitions. [2019-11-16 00:01:22,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:22,995 INFO L688 BuchiCegarLoop]: Abstraction has 1494 states and 1849 transitions. [2019-11-16 00:01:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states and 1849 transitions. [2019-11-16 00:01:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1449. [2019-11-16 00:01:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-11-16 00:01:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1778 transitions. [2019-11-16 00:01:23,032 INFO L711 BuchiCegarLoop]: Abstraction has 1449 states and 1778 transitions. [2019-11-16 00:01:23,033 INFO L591 BuchiCegarLoop]: Abstraction has 1449 states and 1778 transitions. [2019-11-16 00:01:23,033 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:01:23,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1449 states and 1778 transitions. [2019-11-16 00:01:23,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-11-16 00:01:23,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:23,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:23,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 12, 12, 11, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 1, 1, 1] [2019-11-16 00:01:23,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:23,044 INFO L791 eck$LassoCheckResult]: Stem: 28886#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 28851#L37 call main_#t~ret4 := fibo1(main_~x~0);< 28852#fibo1ENTRY ~n := #in~n; 29189#L8 assume !(~n < 1); 29188#L10 assume !(1 == ~n); 29186#L13 call #t~ret0 := fibo2(~n - 1);< 29187#fibo2ENTRY ~n := #in~n; 29202#L18 assume !(~n < 1); 29200#L20 assume !(1 == ~n); 29197#L23 call #t~ret2 := fibo1(~n - 1);< 29198#fibo1ENTRY ~n := #in~n; 29225#L8 assume !(~n < 1); 29224#L10 assume !(1 == ~n); 29222#L13 call #t~ret0 := fibo2(~n - 1);< 29223#fibo2ENTRY ~n := #in~n; 29552#L18 assume !(~n < 1); 29550#L20 assume !(1 == ~n); 29546#L23 call #t~ret2 := fibo1(~n - 1);< 29547#fibo1ENTRY ~n := #in~n; 29562#L8 assume !(~n < 1); 29559#L10 assume !(1 == ~n); 28826#L13 call #t~ret0 := fibo2(~n - 1);< 29553#fibo2ENTRY ~n := #in~n; 29551#L18 assume !(~n < 1); 29548#L20 assume !(1 == ~n); 29543#L23 call #t~ret2 := fibo1(~n - 1);< 29544#fibo1ENTRY ~n := #in~n; 29569#L8 assume !(~n < 1); 29591#L10 assume !(1 == ~n); 29587#L13 call #t~ret0 := fibo2(~n - 1);< 29588#fibo2ENTRY ~n := #in~n; 29593#L18 assume !(~n < 1); 29592#L20 assume 1 == ~n;#res := 1; 29590#fibo2FINAL assume true; 29586#fibo2EXIT >#49#return; 29582#L13-1 call #t~ret1 := fibo2(~n - 2);< 29583#fibo2ENTRY ~n := #in~n; 29589#L18 assume ~n < 1;#res := 0; 29585#fibo2FINAL assume true; 29581#fibo2EXIT >#51#return; 29580#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29578#fibo1FINAL assume true; 29575#fibo1EXIT >#45#return; 29567#L23-1 call #t~ret3 := fibo1(~n - 2);< 29568#fibo1ENTRY ~n := #in~n; 29579#L8 assume !(~n < 1); 29577#L10 assume 1 == ~n;#res := 1; 29574#fibo1FINAL assume true; 29566#fibo1EXIT >#47#return; 29560#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29557#fibo2FINAL assume true; 29555#fibo2EXIT >#49#return; 29209#L13-1 call #t~ret1 := fibo2(~n - 2);< 29238#fibo2ENTRY ~n := #in~n; 29349#L18 assume !(~n < 1); 29348#L20 assume 1 == ~n;#res := 1; 29347#fibo2FINAL assume true; 29343#fibo2EXIT >#51#return; 29214#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29549#fibo1FINAL assume true; 29545#fibo1EXIT >#45#return; 29284#L23-1 call #t~ret3 := fibo1(~n - 2);< 29331#fibo1ENTRY ~n := #in~n; 29507#L8 assume !(~n < 1); 29508#L10 assume !(1 == ~n); 29597#L13 call #t~ret0 := fibo2(~n - 1);< 29598#fibo2ENTRY ~n := #in~n; 29612#L18 assume !(~n < 1); 29610#L20 assume 1 == ~n;#res := 1; 29609#fibo2FINAL assume true; 29608#fibo2EXIT >#49#return; 29602#L13-1 call #t~ret1 := fibo2(~n - 2);< 29606#fibo2ENTRY ~n := #in~n; 29601#L18 assume ~n < 1;#res := 0; 29603#fibo2FINAL assume true; 29607#fibo2EXIT >#51#return; 29335#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29334#fibo1FINAL assume true; 29329#fibo1EXIT >#47#return; 29286#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29324#fibo2FINAL assume true; 29221#fibo2EXIT >#49#return; 29210#L13-1 call #t~ret1 := fibo2(~n - 2);< 29215#fibo2ENTRY ~n := #in~n; 29321#L18 assume !(~n < 1); 29317#L20 assume !(1 == ~n); 29281#L23 call #t~ret2 := fibo1(~n - 1);< 29288#fibo1ENTRY ~n := #in~n; 29358#L8 assume !(~n < 1); 29355#L10 assume !(1 == ~n); 29356#L13 call #t~ret0 := fibo2(~n - 1);< 29409#fibo2ENTRY ~n := #in~n; 29448#L18 assume !(~n < 1); 29445#L20 assume !(1 == ~n); 29446#L23 call #t~ret2 := fibo1(~n - 1);< 29463#fibo1ENTRY ~n := #in~n; 29470#L8 assume !(~n < 1); 29468#L10 assume 1 == ~n;#res := 1; 29465#fibo1FINAL assume true; 29461#fibo1EXIT >#45#return; 29454#L23-1 call #t~ret3 := fibo1(~n - 2);< 29459#fibo1ENTRY ~n := #in~n; 29478#L8 assume ~n < 1;#res := 0; 29473#fibo1FINAL assume true; 29453#fibo1EXIT >#47#return; 29452#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29451#fibo2FINAL assume true; 29450#fibo2EXIT >#49#return; 29439#L13-1 call #t~ret1 := fibo2(~n - 2);< 29449#fibo2ENTRY ~n := #in~n; 29498#L18 assume !(~n < 1); 29497#L20 assume 1 == ~n;#res := 1; 29493#fibo2FINAL assume true; 29483#fibo2EXIT >#51#return; 29386#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29372#fibo1FINAL assume true; 29280#fibo1EXIT >#45#return; 29250#L23-1 call #t~ret3 := fibo1(~n - 2);< 29251#fibo1ENTRY ~n := #in~n; 29432#L8 assume !(~n < 1); 29429#L10 assume 1 == ~n;#res := 1; 29430#fibo1FINAL assume true; 29413#fibo1EXIT >#47#return; 29244#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29237#fibo2FINAL assume true; 29204#fibo2EXIT >#51#return; 29203#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29201#fibo1FINAL assume true; 29196#fibo1EXIT >#45#return; 28876#L23-1 call #t~ret3 := fibo1(~n - 2);< 29194#fibo1ENTRY ~n := #in~n; 29745#L8 assume !(~n < 1); 29743#L10 assume !(1 == ~n); 28989#L13 call #t~ret0 := fibo2(~n - 1);< 29019#fibo2ENTRY ~n := #in~n; 28994#L18 assume !(~n < 1); 28993#L20 assume !(1 == ~n); 28991#L23 call #t~ret2 := fibo1(~n - 1);< 28992#fibo1ENTRY ~n := #in~n; 29314#L8 assume !(~n < 1); 29312#L10 assume !(1 == ~n); 29275#L13 call #t~ret0 := fibo2(~n - 1);< 29276#fibo2ENTRY ~n := #in~n; 29302#L18 assume !(~n < 1); 29299#L20 assume 1 == ~n;#res := 1; 29277#fibo2FINAL assume true; 29273#fibo2EXIT >#49#return; 29265#L13-1 call #t~ret1 := fibo2(~n - 2);< 29272#fibo2ENTRY ~n := #in~n; 29316#L18 assume ~n < 1;#res := 0; 29298#fibo2FINAL assume true; 29263#fibo2EXIT >#51#return; 29262#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29248#fibo1FINAL assume true; 29243#fibo1EXIT >#45#return; 29231#L23-1 call #t~ret3 := fibo1(~n - 2);< 29236#fibo1ENTRY ~n := #in~n; 29369#L8 assume !(~n < 1); 29368#L10 assume 1 == ~n;#res := 1; 28901#fibo1FINAL assume true; 29230#fibo1EXIT >#47#return; 29220#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29219#fibo2FINAL assume true; 29218#fibo2EXIT >#49#return; 28923#L13-1 call #t~ret1 := fibo2(~n - 2);< 28927#fibo2ENTRY ~n := #in~n; 28926#L18 assume !(~n < 1); 28921#L20 assume !(1 == ~n); 28870#L23 [2019-11-16 00:01:23,045 INFO L793 eck$LassoCheckResult]: Loop: 28870#L23 call #t~ret2 := fibo1(~n - 1);< 28952#fibo1ENTRY ~n := #in~n; 28948#L8 assume !(~n < 1); 28949#L10 assume !(1 == ~n); 28931#L13 call #t~ret0 := fibo2(~n - 1);< 28932#fibo2ENTRY ~n := #in~n; 28947#L18 assume !(~n < 1); 28946#L20 assume !(1 == ~n); 28943#L23 call #t~ret2 := fibo1(~n - 1);< 28945#fibo1ENTRY ~n := #in~n; 29791#L8 assume !(~n < 1); 29790#L10 assume !(1 == ~n); 29783#L13 call #t~ret0 := fibo2(~n - 1);< 29789#fibo2ENTRY ~n := #in~n; 29978#L18 assume !(~n < 1); 29972#L20 assume 1 == ~n;#res := 1; 29973#fibo2FINAL assume true; 30049#fibo2EXIT >#49#return; 30042#L13-1 call #t~ret1 := fibo2(~n - 2);< 30047#fibo2ENTRY ~n := #in~n; 30051#L18 assume ~n < 1;#res := 0; 30050#fibo2FINAL assume true; 30041#fibo2EXIT >#51#return; 30045#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 30183#fibo1FINAL assume true; 30173#fibo1EXIT >#45#return; 28938#L23-1 call #t~ret3 := fibo1(~n - 2);< 28939#fibo1ENTRY ~n := #in~n; 30188#L8 assume !(~n < 1); 30185#L10 assume 1 == ~n;#res := 1; 30156#fibo1FINAL assume true; 30179#fibo1EXIT >#47#return; 28934#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 28933#fibo2FINAL assume true; 28929#fibo2EXIT >#49#return; 28922#L13-1 call #t~ret1 := fibo2(~n - 2);< 28927#fibo2ENTRY ~n := #in~n; 28926#L18 assume !(~n < 1); 28921#L20 assume !(1 == ~n); 28870#L23 [2019-11-16 00:01:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2142147031, now seen corresponding path program 1 times [2019-11-16 00:01:23,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:23,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317421463] [2019-11-16 00:01:23,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:23,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:23,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 221 proven. 312 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-11-16 00:01:23,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317421463] [2019-11-16 00:01:23,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539970914] [2019-11-16 00:01:23,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:23,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:01:23,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 390 proven. 162 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-11-16 00:01:23,762 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:23,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 30 [2019-11-16 00:01:23,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444555067] [2019-11-16 00:01:23,763 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1831895155, now seen corresponding path program 1 times [2019-11-16 00:01:23,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:23,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888106589] [2019-11-16 00:01:23,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:23,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:23,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:23,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:24,107 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:24,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:24,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:24,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:24,107 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:24,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:24,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:24,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration12_Loop [2019-11-16 00:01:24,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:24,108 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:24,108 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-16 00:01:24,111 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-16 00:01:24,112 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-16 00:01:24,114 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-16 00:01:24,116 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-16 00:01:24,118 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-16 00:01:24,120 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-16 00:01:24,127 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-16 00:01:24,129 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-16 00:01:24,167 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:24,167 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,179 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:24,183 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,190 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,194 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:24,194 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,203 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:24,208 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,215 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,219 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:24,219 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,227 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:24,231 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,237 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:24,242 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:24,242 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:01:24,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:24,253 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:24,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:24,271 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:26,510 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:26,511 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:26,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:26,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:26,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:26,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:26,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:26,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:26,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:26,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration12_Loop [2019-11-16 00:01:26,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:26,512 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:26,513 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-16 00:01:26,514 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-16 00:01:26,515 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-16 00:01:26,517 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-16 00:01:26,518 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-16 00:01:26,520 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-16 00:01:26,525 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-16 00:01:26,526 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-16 00:01:26,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:26,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:26,567 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:26,567 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-16 00:01:26,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:26,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:26,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:26,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:26,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:26,569 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:26,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:26,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:26,570 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-16 00:01:26,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:26,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:26,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:26,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:26,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:26,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:26,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:26,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:26,571 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-16 00:01:26,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:26,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:26,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:26,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:26,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:26,572 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:26,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:26,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:26,573 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-16 00:01:26,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:26,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:26,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:26,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:26,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:26,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:26,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:26,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:26,575 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-16 00:01:26,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:26,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:26,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:26,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:26,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:26,576 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:26,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:26,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:26,576 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-16 00:01:26,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:26,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:26,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:26,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:26,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:26,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:26,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:26,580 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:26,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:26,582 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:26,582 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:26,582 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:26,582 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:26,583 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-16 00:01:26,583 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:26,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-16 00:01:26,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:26,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:26,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:01:26,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:01:27,097 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-16 00:01:27,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-11-16 00:01:27,629 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 2883 states and 3513 transitions. Complement of second has 50 states. [2019-11-16 00:01:27,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-16 00:01:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:01:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2019-11-16 00:01:27,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 168 letters. Loop has 39 letters. [2019-11-16 00:01:27,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:27,632 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:27,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-16 00:01:27,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:27,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:27,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:01:27,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:01:28,147 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-16 00:01:28,148 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-11-16 00:01:28,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 2999 states and 3662 transitions. Complement of second has 52 states. [2019-11-16 00:01:28,746 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-16 00:01:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:01:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2019-11-16 00:01:28,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 168 letters. Loop has 39 letters. [2019-11-16 00:01:28,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:28,747 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:01:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:28,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-16 00:01:28,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:28,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:28,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:01:28,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:01:29,163 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 11 loop predicates [2019-11-16 00:01:29,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-11-16 00:01:29,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 4589 states and 5376 transitions. Complement of second has 127 states. [2019-11-16 00:01:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-16 00:01:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:01:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-11-16 00:01:29,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 168 letters. Loop has 39 letters. [2019-11-16 00:01:29,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:29,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 207 letters. Loop has 39 letters. [2019-11-16 00:01:29,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:29,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 168 letters. Loop has 78 letters. [2019-11-16 00:01:29,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:29,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4589 states and 5376 transitions. [2019-11-16 00:01:29,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-16 00:01:29,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4589 states to 3185 states and 3878 transitions. [2019-11-16 00:01:29,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-11-16 00:01:29,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2019-11-16 00:01:29,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3185 states and 3878 transitions. [2019-11-16 00:01:29,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:29,814 INFO L688 BuchiCegarLoop]: Abstraction has 3185 states and 3878 transitions. [2019-11-16 00:01:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states and 3878 transitions. [2019-11-16 00:01:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 2761. [2019-11-16 00:01:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2019-11-16 00:01:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3277 transitions. [2019-11-16 00:01:29,898 INFO L711 BuchiCegarLoop]: Abstraction has 2761 states and 3277 transitions. [2019-11-16 00:01:29,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:29,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:01:29,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:01:29,901 INFO L87 Difference]: Start difference. First operand 2761 states and 3277 transitions. Second operand 30 states. [2019-11-16 00:01:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:31,224 INFO L93 Difference]: Finished difference Result 4283 states and 5397 transitions. [2019-11-16 00:01:31,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-16 00:01:31,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4283 states and 5397 transitions. [2019-11-16 00:01:31,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-16 00:01:31,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4283 states to 2695 states and 3264 transitions. [2019-11-16 00:01:31,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-11-16 00:01:31,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2019-11-16 00:01:31,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2695 states and 3264 transitions. [2019-11-16 00:01:31,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:31,285 INFO L688 BuchiCegarLoop]: Abstraction has 2695 states and 3264 transitions. [2019-11-16 00:01:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states and 3264 transitions. [2019-11-16 00:01:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2337. [2019-11-16 00:01:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-11-16 00:01:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 2749 transitions. [2019-11-16 00:01:31,350 INFO L711 BuchiCegarLoop]: Abstraction has 2337 states and 2749 transitions. [2019-11-16 00:01:31,350 INFO L591 BuchiCegarLoop]: Abstraction has 2337 states and 2749 transitions. [2019-11-16 00:01:31,350 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:01:31,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2337 states and 2749 transitions. [2019-11-16 00:01:31,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-16 00:01:31,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:31,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:31,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [24, 24, 23, 23, 20, 19, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1] [2019-11-16 00:01:31,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [22, 21, 20, 19, 17, 17, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 6, 5, 3] [2019-11-16 00:01:31,365 INFO L791 eck$LassoCheckResult]: Stem: 51118#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 51079#L37 call main_#t~ret4 := fibo1(main_~x~0);< 51080#fibo1ENTRY ~n := #in~n; 51163#L8 assume !(~n < 1); 51162#L10 assume !(1 == ~n); 51158#L13 call #t~ret0 := fibo2(~n - 1);< 51161#fibo2ENTRY ~n := #in~n; 51160#L18 assume !(~n < 1); 51159#L20 assume !(1 == ~n); 51154#L23 call #t~ret2 := fibo1(~n - 1);< 51157#fibo1ENTRY ~n := #in~n; 51156#L8 assume !(~n < 1); 51155#L10 assume !(1 == ~n); 51151#L13 call #t~ret0 := fibo2(~n - 1);< 51153#fibo2ENTRY ~n := #in~n; 51152#L18 assume !(~n < 1); 51150#L20 assume !(1 == ~n); 51144#L23 call #t~ret2 := fibo1(~n - 1);< 51147#fibo1ENTRY ~n := #in~n; 51148#L8 assume !(~n < 1); 51143#L10 assume !(1 == ~n); 51050#L13 call #t~ret0 := fibo2(~n - 1);< 51142#fibo2ENTRY ~n := #in~n; 51141#L18 assume !(~n < 1); 51137#L20 assume !(1 == ~n); 51127#L23 call #t~ret2 := fibo1(~n - 1);< 51149#fibo1ENTRY ~n := #in~n; 51126#L8 assume !(~n < 1); 51128#L10 assume !(1 == ~n); 52915#L13 call #t~ret0 := fibo2(~n - 1);< 52916#fibo2ENTRY ~n := #in~n; 52921#L18 assume !(~n < 1); 52919#L20 assume 1 == ~n;#res := 1; 52918#fibo2FINAL assume true; 52914#fibo2EXIT >#49#return; 52911#L13-1 call #t~ret1 := fibo2(~n - 2);< 52912#fibo2ENTRY ~n := #in~n; 52935#L18 assume ~n < 1;#res := 0; 52933#fibo2FINAL assume true; 52910#fibo2EXIT >#51#return; 52908#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52906#fibo1FINAL assume true; 52905#fibo1EXIT >#45#return; 52903#L23-1 call #t~ret3 := fibo1(~n - 2);< 52904#fibo1ENTRY ~n := #in~n; 52913#L8 assume !(~n < 1); 52909#L10 assume 1 == ~n;#res := 1; 52907#fibo1FINAL assume true; 52902#fibo1EXIT >#47#return; 52881#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52882#fibo2FINAL assume true; 52866#fibo2EXIT >#49#return; 52221#L13-1 call #t~ret1 := fibo2(~n - 2);< 52222#fibo2ENTRY ~n := #in~n; 53100#L18 assume !(~n < 1); 53098#L20 assume !(1 == ~n); 53094#L23 call #t~ret2 := fibo1(~n - 1);< 53097#fibo1ENTRY ~n := #in~n; 53109#L8 assume !(~n < 1); 53103#L10 assume 1 == ~n;#res := 1; 53104#fibo1FINAL assume true; 53093#fibo1EXIT >#45#return; 53095#L23-1 call #t~ret3 := fibo1(~n - 2);< 53126#fibo1ENTRY ~n := #in~n; 53123#L8 assume ~n < 1;#res := 0; 53110#fibo1FINAL assume true; 53111#fibo1EXIT >#47#return; 52883#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52880#fibo2FINAL assume true; 52868#fibo2EXIT >#51#return; 52210#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52208#fibo1FINAL assume true; 51702#fibo1EXIT >#45#return; 51691#L23-1 call #t~ret3 := fibo1(~n - 2);< 51695#fibo1ENTRY ~n := #in~n; 53014#L8 assume !(~n < 1); 53015#L10 assume !(1 == ~n); 53047#L13 call #t~ret0 := fibo2(~n - 1);< 53048#fibo2ENTRY ~n := #in~n; 53066#L18 assume !(~n < 1); 53065#L20 assume !(1 == ~n); 53062#L23 call #t~ret2 := fibo1(~n - 1);< 53063#fibo1ENTRY ~n := #in~n; 53070#L8 assume !(~n < 1); 53068#L10 assume 1 == ~n;#res := 1; 53067#fibo1FINAL assume true; 53061#fibo1EXIT >#45#return; 53058#L23-1 call #t~ret3 := fibo1(~n - 2);< 53059#fibo1ENTRY ~n := #in~n; 53071#L8 assume ~n < 1;#res := 0; 53069#fibo1FINAL assume true; 53057#fibo1EXIT >#47#return; 53055#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 53054#fibo2FINAL assume true; 53046#fibo2EXIT >#49#return; 52939#L13-1 call #t~ret1 := fibo2(~n - 2);< 53045#fibo2ENTRY ~n := #in~n; 53064#L18 assume !(~n < 1); 53060#L20 assume 1 == ~n;#res := 1; 53056#fibo2FINAL assume true; 53044#fibo2EXIT >#51#return; 53043#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 53027#fibo1FINAL assume true; 51689#fibo1EXIT >#47#return; 51681#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51680#fibo2FINAL assume true; 51674#fibo2EXIT >#49#return; 51658#L13-1 call #t~ret1 := fibo2(~n - 2);< 51663#fibo2ENTRY ~n := #in~n; 52165#L18 assume !(~n < 1); 52158#L20 assume !(1 == ~n); 51973#L23 call #t~ret2 := fibo1(~n - 1);< 52085#fibo1ENTRY ~n := #in~n; 52086#L8 assume !(~n < 1); 52079#L10 assume !(1 == ~n); 52080#L13 call #t~ret0 := fibo2(~n - 1);< 52782#fibo2ENTRY ~n := #in~n; 52844#L18 assume !(~n < 1); 52842#L20 assume !(1 == ~n); 52837#L23 call #t~ret2 := fibo1(~n - 1);< 52839#fibo1ENTRY ~n := #in~n; 52846#L8 assume !(~n < 1); 52845#L10 assume 1 == ~n;#res := 1; 52841#fibo1FINAL assume true; 52836#fibo1EXIT >#45#return; 52829#L23-1 call #t~ret3 := fibo1(~n - 2);< 52832#fibo1ENTRY ~n := #in~n; 52840#L8 assume ~n < 1;#res := 0; 52833#fibo1FINAL assume true; 52828#fibo1EXIT >#47#return; 52827#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52825#fibo2FINAL assume true; 52781#fibo2EXIT >#49#return; 52778#L13-1 call #t~ret1 := fibo2(~n - 2);< 52779#fibo2ENTRY ~n := #in~n; 52786#L18 assume !(~n < 1); 52785#L20 assume 1 == ~n;#res := 1; 52784#fibo2FINAL assume true; 52777#fibo2EXIT >#51#return; 52776#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52775#fibo1FINAL assume true; 52753#fibo1EXIT >#45#return; 52750#L23-1 call #t~ret3 := fibo1(~n - 2);< 52752#fibo1ENTRY ~n := #in~n; 52826#L8 assume !(~n < 1); 52801#L10 assume !(1 == ~n); 52797#L13 call #t~ret0 := fibo2(~n - 1);< 52798#fibo2ENTRY ~n := #in~n; 52822#L18 assume !(~n < 1); 52821#L20 assume 1 == ~n;#res := 1; 52819#fibo2FINAL assume true; 52796#fibo2EXIT >#49#return; 52758#L13-1 call #t~ret1 := fibo2(~n - 2);< 52760#fibo2ENTRY ~n := #in~n; 52788#L18 assume ~n < 1;#res := 0; 52787#fibo2FINAL assume true; 52757#fibo2EXIT >#51#return; 52755#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52754#fibo1FINAL assume true; 52749#fibo1EXIT >#47#return; 51975#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52748#fibo2FINAL assume true; 51653#fibo2EXIT >#51#return; 51651#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51646#fibo1FINAL assume true; 51643#fibo1EXIT >#45#return; 51626#L23-1 call #t~ret3 := fibo1(~n - 2);< 51637#fibo1ENTRY ~n := #in~n; 52737#L8 assume !(~n < 1); 52736#L10 assume !(1 == ~n); 51621#L13 call #t~ret0 := fibo2(~n - 1);< 51625#fibo2ENTRY ~n := #in~n; 51664#L18 assume !(~n < 1); 51652#L20 assume !(1 == ~n); 51648#L23 call #t~ret2 := fibo1(~n - 1);< 51649#fibo1ENTRY ~n := #in~n; 51799#L8 assume !(~n < 1); 51796#L10 assume !(1 == ~n); 51791#L13 call #t~ret0 := fibo2(~n - 1);< 51792#fibo2ENTRY ~n := #in~n; 51798#L18 assume !(~n < 1); 51795#L20 assume 1 == ~n;#res := 1; 51794#fibo2FINAL assume true; 51789#fibo2EXIT >#49#return; 51781#L13-1 call #t~ret1 := fibo2(~n - 2);< 51784#fibo2ENTRY ~n := #in~n; 51793#L18 assume ~n < 1;#res := 0; 51786#fibo2FINAL assume true; 51780#fibo2EXIT >#51#return; 51778#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51777#fibo1FINAL assume true; 51764#fibo1EXIT >#45#return; 51760#L23-1 call #t~ret3 := fibo1(~n - 2);< 51761#fibo1ENTRY ~n := #in~n; 51868#L8 assume !(~n < 1); 51864#L10 assume 1 == ~n;#res := 1; 51813#fibo1FINAL assume true; 51759#fibo1EXIT >#47#return; 51758#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51757#fibo2FINAL assume true; 51756#fibo2EXIT >#49#return; 51084#L13-1 call #t~ret1 := fibo2(~n - 2);< 51749#fibo2ENTRY ~n := #in~n; 51785#L18 assume !(~n < 1); 51779#L20 assume !(1 == ~n); 51075#L23 call #t~ret2 := fibo1(~n - 1);< 51765#fibo1ENTRY ~n := #in~n; 51811#L8 assume !(~n < 1); 51810#L10 assume !(1 == ~n); 51774#L13 call #t~ret0 := fibo2(~n - 1);< 51776#fibo2ENTRY ~n := #in~n; 51956#L18 assume !(~n < 1); 51807#L20 assume 1 == ~n;#res := 1; 51806#fibo2FINAL assume true; 51773#fibo2EXIT >#49#return; 51769#L13-1 call #t~ret1 := fibo2(~n - 2);< 51772#fibo2ENTRY ~n := #in~n; 51808#L18 assume ~n < 1;#res := 0; 51804#fibo2FINAL assume true; 51768#fibo2EXIT >#51#return; 51767#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51766#fibo1FINAL assume true; 51762#fibo1EXIT >#45#return; 51763#L23-1 call #t~ret3 := fibo1(~n - 2);< 51815#fibo1ENTRY ~n := #in~n; 52814#L8 assume !(~n < 1); 52813#L10 assume 1 == ~n;#res := 1; 52812#fibo1FINAL assume true; 52810#fibo1EXIT >#47#return; 51758#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51757#fibo2FINAL assume true; 51756#fibo2EXIT >#51#return; 51623#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51741#fibo1FINAL assume true; 51636#fibo1EXIT >#47#return; 51634#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51630#fibo2FINAL assume true; 51618#fibo2EXIT >#49#return; 51211#L13-1 call #t~ret1 := fibo2(~n - 2);< 51248#fibo2ENTRY ~n := #in~n; 51249#L18 assume !(~n < 1); 51666#L20 assume !(1 == ~n); 51189#L23 call #t~ret2 := fibo1(~n - 1);< 51198#fibo1ENTRY ~n := #in~n; 51199#L8 assume !(~n < 1); 51188#L10 assume !(1 == ~n); 51171#L13 call #t~ret0 := fibo2(~n - 1);< 51172#fibo2ENTRY ~n := #in~n; 51193#L18 assume !(~n < 1); 51187#L20 assume !(1 == ~n); 51185#L23 call #t~ret2 := fibo1(~n - 1);< 51186#fibo1ENTRY ~n := #in~n; 51217#L8 assume !(~n < 1); 51216#L10 assume !(1 == ~n); 51213#L13 call #t~ret0 := fibo2(~n - 1);< 51215#fibo2ENTRY ~n := #in~n; 51403#L18 assume !(~n < 1); 51401#L20 assume 1 == ~n;#res := 1; 51402#fibo2FINAL assume true; 51438#fibo2EXIT >#49#return; 51433#L13-1 call #t~ret1 := fibo2(~n - 2);< 51436#fibo2ENTRY ~n := #in~n; 51442#L18 assume ~n < 1;#res := 0; 51439#fibo2FINAL assume true; 51432#fibo2EXIT >#51#return; 51430#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51429#fibo1FINAL assume true; 51343#fibo1EXIT >#45#return; 51326#L23-1 call #t~ret3 := fibo1(~n - 2);< 51353#fibo1ENTRY ~n := #in~n; 51445#L8 assume !(~n < 1); 51444#L10 assume 1 == ~n;#res := 1; 51355#fibo1FINAL assume true; 51325#fibo1EXIT >#47#return; 51330#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51812#fibo2FINAL assume true; 51751#fibo2EXIT >#49#return; 51059#L13-1 call #t~ret1 := fibo2(~n - 2);< 51099#fibo2ENTRY ~n := #in~n; 51809#L18 assume !(~n < 1); 51167#L20 assume !(1 == ~n); 51805#L23 call #t~ret2 := fibo1(~n - 1);< 51818#fibo1ENTRY ~n := #in~n; 52746#L8 assume !(~n < 1); 52745#L10 assume 1 == ~n;#res := 1; 52744#fibo1FINAL assume true; 52743#fibo1EXIT >#45#return; 51057#L23-1 call #t~ret3 := fibo1(~n - 2);< 51062#fibo1ENTRY ~n := #in~n; 52823#L8 assume ~n < 1;#res := 0; 51102#fibo1FINAL assume true; 51089#fibo1EXIT >#47#return; 51091#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52747#fibo2FINAL assume true; 51747#fibo2EXIT >#51#return; 51623#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51741#fibo1FINAL assume true; 51636#fibo1EXIT >#45#return; 51108#L23-1 call #t~ret3 := fibo1(~n - 2);< 51641#fibo1ENTRY [2019-11-16 00:01:31,366 INFO L793 eck$LassoCheckResult]: Loop: 51641#fibo1ENTRY ~n := #in~n; 51715#L8 assume !(~n < 1); 51633#L10 assume !(1 == ~n); 51620#L13 call #t~ret0 := fibo2(~n - 1);< 51625#fibo2ENTRY ~n := #in~n; 51664#L18 assume !(~n < 1); 51652#L20 assume !(1 == ~n); 51648#L23 call #t~ret2 := fibo1(~n - 1);< 51650#fibo1ENTRY ~n := #in~n; 51846#L8 assume !(~n < 1); 51843#L10 assume !(1 == ~n); 51840#L13 call #t~ret0 := fibo2(~n - 1);< 51841#fibo2ENTRY ~n := #in~n; 51863#L18 assume !(~n < 1); 51861#L20 assume !(1 == ~n); 51856#L23 call #t~ret2 := fibo1(~n - 1);< 51860#fibo1ENTRY ~n := #in~n; 51929#L8 assume !(~n < 1); 51927#L10 assume !(1 == ~n); 51871#L13 call #t~ret0 := fibo2(~n - 1);< 51925#fibo2ENTRY ~n := #in~n; 51924#L18 assume !(~n < 1); 51920#L20 assume 1 == ~n;#res := 1; 51921#fibo2FINAL assume true; 52161#fibo2EXIT >#49#return; 52144#L13-1 call #t~ret1 := fibo2(~n - 2);< 52146#fibo2ENTRY ~n := #in~n; 52166#L18 assume ~n < 1;#res := 0; 52164#fibo2FINAL assume true; 52143#fibo2EXIT >#51#return; 52145#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52118#fibo1FINAL assume true; 52119#fibo1EXIT >#45#return; 51969#L23-1 call #t~ret3 := fibo1(~n - 2);< 51970#fibo1ENTRY ~n := #in~n; 52738#L8 assume !(~n < 1); 52190#L10 assume 1 == ~n;#res := 1; 52120#fibo1FINAL assume true; 52123#fibo1EXIT >#47#return; 51961#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51866#fibo2FINAL assume true; 51865#fibo2EXIT >#49#return; 51834#L13-1 call #t~ret1 := fibo2(~n - 2);< 51836#fibo2ENTRY ~n := #in~n; 51981#L18 assume !(~n < 1); 51980#L20 assume !(1 == ~n); 51948#L23 call #t~ret2 := fibo1(~n - 1);< 51950#fibo1ENTRY ~n := #in~n; 52116#L8 assume !(~n < 1); 51984#L10 assume 1 == ~n;#res := 1; 51985#fibo1FINAL assume true; 51947#fibo1EXIT >#45#return; 51932#L23-1 call #t~ret3 := fibo1(~n - 2);< 52128#fibo1ENTRY ~n := #in~n; 52125#L8 assume ~n < 1;#res := 0; 52126#fibo1FINAL assume true; 51931#fibo1EXIT >#47#return; 51872#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51869#fibo2FINAL assume true; 51832#fibo2EXIT >#51#return; 51662#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51829#fibo1FINAL assume true; 51647#fibo1EXIT >#45#return; 51107#L23-1 call #t~ret3 := fibo1(~n - 2);< 51642#fibo1ENTRY ~n := #in~n; 51706#L8 assume !(~n < 1); 51705#L10 assume !(1 == ~n); 51688#L13 call #t~ret0 := fibo2(~n - 1);< 51704#fibo2ENTRY ~n := #in~n; 51703#L18 assume !(~n < 1); 51701#L20 assume !(1 == ~n); 51699#L23 call #t~ret2 := fibo1(~n - 1);< 51700#fibo1ENTRY ~n := #in~n; 51714#L8 assume !(~n < 1); 51712#L10 assume 1 == ~n;#res := 1; 51708#fibo1FINAL assume true; 51697#fibo1EXIT >#45#return; 51683#L23-1 call #t~ret3 := fibo1(~n - 2);< 51686#fibo1ENTRY ~n := #in~n; 51696#L8 assume ~n < 1;#res := 0; 51687#fibo1FINAL assume true; 51682#fibo1EXIT >#47#return; 51685#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51713#fibo2FINAL assume true; 51709#fibo2EXIT >#49#return; 51668#L13-1 call #t~ret1 := fibo2(~n - 2);< 51671#fibo2ENTRY ~n := #in~n; 51677#L18 assume !(~n < 1); 51675#L20 assume 1 == ~n;#res := 1; 51672#fibo2FINAL assume true; 51667#fibo2EXIT >#51#return; 51665#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51644#fibo1FINAL assume true; 51639#fibo1EXIT >#47#return; 51635#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51631#fibo2FINAL assume true; 51619#fibo2EXIT >#49#return; 51085#L13-1 call #t~ret1 := fibo2(~n - 2);< 51632#fibo2ENTRY ~n := #in~n; 51247#L18 assume !(~n < 1); 51232#L20 assume !(1 == ~n); 51073#L23 call #t~ret2 := fibo1(~n - 1);< 51645#fibo1ENTRY ~n := #in~n; 51194#L8 assume !(~n < 1); 51195#L10 assume !(1 == ~n); 51170#L13 call #t~ret0 := fibo2(~n - 1);< 51172#fibo2ENTRY ~n := #in~n; 51193#L18 assume !(~n < 1); 51187#L20 assume !(1 == ~n); 51185#L23 call #t~ret2 := fibo1(~n - 1);< 51186#fibo1ENTRY ~n := #in~n; 51217#L8 assume !(~n < 1); 51216#L10 assume !(1 == ~n); 51213#L13 call #t~ret0 := fibo2(~n - 1);< 51215#fibo2ENTRY ~n := #in~n; 51403#L18 assume !(~n < 1); 51401#L20 assume !(1 == ~n); 51236#L23 call #t~ret2 := fibo1(~n - 1);< 51241#fibo1ENTRY ~n := #in~n; 51240#L8 assume !(~n < 1); 51239#L10 assume !(1 == ~n); 51214#L13 call #t~ret0 := fibo2(~n - 1);< 51215#fibo2ENTRY ~n := #in~n; 51403#L18 assume !(~n < 1); 51401#L20 assume 1 == ~n;#res := 1; 51402#fibo2FINAL assume true; 51438#fibo2EXIT >#49#return; 51434#L13-1 call #t~ret1 := fibo2(~n - 2);< 51436#fibo2ENTRY ~n := #in~n; 51442#L18 assume ~n < 1;#res := 0; 51439#fibo2FINAL assume true; 51432#fibo2EXIT >#51#return; 51435#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51615#fibo1FINAL assume true; 51616#fibo1EXIT >#45#return; 51536#L23-1 call #t~ret3 := fibo1(~n - 2);< 51730#fibo1ENTRY ~n := #in~n; 51726#L8 assume !(~n < 1); 51723#L10 assume 1 == ~n;#res := 1; 51724#fibo1FINAL assume true; 51534#fibo1EXIT >#47#return; 51246#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51233#fibo2FINAL assume true; 51234#fibo2EXIT >#49#return; 51201#L13-1 call #t~ret1 := fibo2(~n - 2);< 51209#fibo2ENTRY ~n := #in~n; 53385#L18 assume !(~n < 1); 51506#L20 assume !(1 == ~n); 51501#L23 call #t~ret2 := fibo1(~n - 1);< 51504#fibo1ENTRY ~n := #in~n; 51527#L8 assume !(~n < 1); 51514#L10 assume 1 == ~n;#res := 1; 51515#fibo1FINAL assume true; 51500#fibo1EXIT >#45#return; 51502#L23-1 call #t~ret3 := fibo1(~n - 2);< 51719#fibo1ENTRY ~n := #in~n; 51716#L8 assume ~n < 1;#res := 0; 51627#fibo1FINAL assume true; 51628#fibo1EXIT >#47#return; 51245#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51222#fibo2FINAL assume true; 51200#fibo2EXIT >#51#return; 51196#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51190#fibo1FINAL assume true; 51182#fibo1EXIT >#45#return; 51177#L23-1 call #t~ret3 := fibo1(~n - 2);< 51181#fibo1ENTRY ~n := #in~n; 51293#L8 assume !(~n < 1); 51292#L10 assume !(1 == ~n); 51288#L13 call #t~ret0 := fibo2(~n - 1);< 51289#fibo2ENTRY ~n := #in~n; 51310#L18 assume !(~n < 1); 51309#L20 assume !(1 == ~n); 51306#L23 call #t~ret2 := fibo1(~n - 1);< 51308#fibo1ENTRY ~n := #in~n; 51315#L8 assume !(~n < 1); 51314#L10 assume 1 == ~n;#res := 1; 51311#fibo1FINAL assume true; 51305#fibo1EXIT >#45#return; 51303#L23-1 call #t~ret3 := fibo1(~n - 2);< 51304#fibo1ENTRY ~n := #in~n; 51317#L8 assume ~n < 1;#res := 0; 51316#fibo1FINAL assume true; 51301#fibo1EXIT >#47#return; 51298#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51295#fibo2FINAL assume true; 51287#fibo2EXIT >#49#return; 51279#L13-1 call #t~ret1 := fibo2(~n - 2);< 51281#fibo2ENTRY ~n := #in~n; 51290#L18 assume !(~n < 1); 51286#L20 assume 1 == ~n;#res := 1; 51283#fibo2FINAL assume true; 51277#fibo2EXIT >#51#return; 51280#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51282#fibo1FINAL assume true; 51175#fibo1EXIT >#47#return; 51174#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51173#fibo2FINAL assume true; 51169#fibo2EXIT >#49#return; 51061#L13-1 call #t~ret1 := fibo2(~n - 2);< 51168#fibo2ENTRY ~n := #in~n; 51165#L18 assume !(~n < 1); 51166#L20 assume !(1 == ~n); 51098#L23 call #t~ret2 := fibo1(~n - 1);< 51645#fibo1ENTRY ~n := #in~n; 51194#L8 assume !(~n < 1); 51195#L10 assume !(1 == ~n); 51139#L13 call #t~ret0 := fibo2(~n - 1);< 51867#fibo2ENTRY ~n := #in~n; 51164#L18 assume !(~n < 1); 51138#L20 assume !(1 == ~n); 51140#L23 call #t~ret2 := fibo1(~n - 1);< 51909#fibo1ENTRY ~n := #in~n; 51922#L8 assume !(~n < 1); 51918#L10 assume 1 == ~n;#res := 1; 51915#fibo1FINAL assume true; 51908#fibo1EXIT >#45#return; 51897#L23-1 call #t~ret3 := fibo1(~n - 2);< 51898#fibo1ENTRY ~n := #in~n; 51907#L8 assume ~n < 1;#res := 0; 51906#fibo1FINAL assume true; 51896#fibo1EXIT >#47#return; 51893#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51890#fibo2FINAL assume true; 51887#fibo2EXIT >#49#return; 51880#L13-1 call #t~ret1 := fibo2(~n - 2);< 51881#fibo2ENTRY ~n := #in~n; 51930#L18 assume !(~n < 1); 51928#L20 assume 1 == ~n;#res := 1; 51926#fibo2FINAL assume true; 51879#fibo2EXIT >#51#return; 51877#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51875#fibo1FINAL assume true; 51873#fibo1EXIT >#45#return; 51093#L23-1 call #t~ret3 := fibo1(~n - 2);< 51754#fibo1ENTRY ~n := #in~n; 52091#L8 assume !(~n < 1); 52090#L10 assume !(1 == ~n); 51067#L13 call #t~ret0 := fibo2(~n - 1);< 51094#fibo2ENTRY ~n := #in~n; 51119#L18 assume !(~n < 1); 51129#L20 assume 1 == ~n;#res := 1; 51066#fibo2FINAL assume true; 51068#fibo2EXIT >#49#return; 51124#L13-1 call #t~ret1 := fibo2(~n - 2);< 51945#fibo2ENTRY ~n := #in~n; 51946#L18 assume ~n < 1;#res := 0; 51678#fibo2FINAL assume true; 51944#fibo2EXIT >#51#return; 51939#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51938#fibo1FINAL assume true; 51753#fibo1EXIT >#47#return; 51752#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51750#fibo2FINAL assume true; 51748#fibo2EXIT >#51#return; 51106#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51110#fibo1FINAL assume true; 51640#fibo1EXIT >#45#return; 51109#L23-1 call #t~ret3 := fibo1(~n - 2);< 51641#fibo1ENTRY [2019-11-16 00:01:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:31,367 INFO L82 PathProgramCache]: Analyzing trace with hash 535019962, now seen corresponding path program 2 times [2019-11-16 00:01:31,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:31,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440915364] [2019-11-16 00:01:31,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:31,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 724 proven. 685 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2019-11-16 00:01:32,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440915364] [2019-11-16 00:01:32,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810849814] [2019-11-16 00:01:32,204 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:32,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:32,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:32,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:01:32,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 1271 proven. 160 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2019-11-16 00:01:32,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:32,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 31 [2019-11-16 00:01:32,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593161191] [2019-11-16 00:01:32,543 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1921463404, now seen corresponding path program 1 times [2019-11-16 00:01:32,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:32,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142238451] [2019-11-16 00:01:32,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:32,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:32,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 249 proven. 621 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2019-11-16 00:01:33,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142238451] [2019-11-16 00:01:33,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107317756] [2019-11-16 00:01:33,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:33,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:01:33,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 189 proven. 573 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-11-16 00:01:33,469 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:33,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 32 [2019-11-16 00:01:33,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773015246] [2019-11-16 00:01:33,471 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:33,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:01:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:01:33,472 INFO L87 Difference]: Start difference. First operand 2337 states and 2749 transitions. cyclomatic complexity: 422 Second operand 32 states. [2019-11-16 00:01:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:34,482 INFO L93 Difference]: Finished difference Result 3804 states and 4737 transitions. [2019-11-16 00:01:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:01:34,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3804 states and 4737 transitions. [2019-11-16 00:01:34,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-16 00:01:34,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3804 states to 3153 states and 3819 transitions. [2019-11-16 00:01:34,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2019-11-16 00:01:34,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-16 00:01:34,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3153 states and 3819 transitions. [2019-11-16 00:01:34,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:34,538 INFO L688 BuchiCegarLoop]: Abstraction has 3153 states and 3819 transitions. [2019-11-16 00:01:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states and 3819 transitions. [2019-11-16 00:01:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2767. [2019-11-16 00:01:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2767 states. [2019-11-16 00:01:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 3257 transitions. [2019-11-16 00:01:34,609 INFO L711 BuchiCegarLoop]: Abstraction has 2767 states and 3257 transitions. [2019-11-16 00:01:34,609 INFO L591 BuchiCegarLoop]: Abstraction has 2767 states and 3257 transitions. [2019-11-16 00:01:34,609 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:01:34,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2767 states and 3257 transitions. [2019-11-16 00:01:34,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-16 00:01:34,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:34,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:34,627 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 30, 29, 25, 25, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 10, 9, 7, 5, 1, 1] [2019-11-16 00:01:34,627 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [24, 23, 22, 21, 19, 18, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 7, 7, 6, 3] [2019-11-16 00:01:34,628 INFO L791 eck$LassoCheckResult]: Stem: 61053#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 61025#L37 call main_#t~ret4 := fibo1(main_~x~0);< 61026#fibo1ENTRY ~n := #in~n; 61202#L8 assume !(~n < 1); 61199#L10 assume !(1 == ~n); 61196#L13 call #t~ret0 := fibo2(~n - 1);< 61197#fibo2ENTRY ~n := #in~n; 61331#L18 assume !(~n < 1); 61330#L20 assume !(1 == ~n); 61286#L23 call #t~ret2 := fibo1(~n - 1);< 61287#fibo1ENTRY ~n := #in~n; 61824#L8 assume !(~n < 1); 61823#L10 assume !(1 == ~n); 61820#L13 call #t~ret0 := fibo2(~n - 1);< 61822#fibo2ENTRY ~n := #in~n; 61821#L18 assume !(~n < 1); 61819#L20 assume !(1 == ~n); 61807#L23 call #t~ret2 := fibo1(~n - 1);< 61813#fibo1ENTRY ~n := #in~n; 61814#L8 assume !(~n < 1); 61806#L10 assume !(1 == ~n); 61002#L13 call #t~ret0 := fibo2(~n - 1);< 61805#fibo2ENTRY ~n := #in~n; 61804#L18 assume !(~n < 1); 61803#L20 assume !(1 == ~n); 61063#L23 call #t~ret2 := fibo1(~n - 1);< 61816#fibo1ENTRY ~n := #in~n; 61062#L8 assume !(~n < 1); 61064#L10 assume !(1 == ~n); 62620#L13 call #t~ret0 := fibo2(~n - 1);< 62621#fibo2ENTRY ~n := #in~n; 62625#L18 assume !(~n < 1); 62624#L20 assume 1 == ~n;#res := 1; 62623#fibo2FINAL assume true; 62619#fibo2EXIT >#49#return; 62616#L13-1 call #t~ret1 := fibo2(~n - 2);< 62617#fibo2ENTRY ~n := #in~n; 62622#L18 assume ~n < 1;#res := 0; 62618#fibo2FINAL assume true; 62615#fibo2EXIT >#51#return; 62614#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62612#fibo1FINAL assume true; 62610#fibo1EXIT >#45#return; 62606#L23-1 call #t~ret3 := fibo1(~n - 2);< 62607#fibo1ENTRY ~n := #in~n; 62613#L8 assume !(~n < 1); 62611#L10 assume 1 == ~n;#res := 1; 62609#fibo1FINAL assume true; 62605#fibo1EXIT >#47#return; 62602#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62596#fibo2FINAL assume true; 62408#fibo2EXIT >#49#return; 62397#L13-1 call #t~ret1 := fibo2(~n - 2);< 62406#fibo2ENTRY ~n := #in~n; 62663#L18 assume !(~n < 1); 62662#L20 assume !(1 == ~n); 62599#L23 call #t~ret2 := fibo1(~n - 1);< 62601#fibo1ENTRY ~n := #in~n; 62660#L8 assume !(~n < 1); 62608#L10 assume 1 == ~n;#res := 1; 62604#fibo1FINAL assume true; 62598#fibo1EXIT >#45#return; 62594#L23-1 call #t~ret3 := fibo1(~n - 2);< 62595#fibo1ENTRY ~n := #in~n; 62603#L8 assume ~n < 1;#res := 0; 62597#fibo1FINAL assume true; 62593#fibo1EXIT >#47#return; 62592#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62589#fibo2FINAL assume true; 62394#fibo2EXIT >#51#return; 62390#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62389#fibo1FINAL assume true; 62388#fibo1EXIT >#45#return; 62383#L23-1 call #t~ret3 := fibo1(~n - 2);< 62387#fibo1ENTRY ~n := #in~n; 63065#L8 assume !(~n < 1); 63063#L10 assume !(1 == ~n); 62543#L13 call #t~ret0 := fibo2(~n - 1);< 62544#fibo2ENTRY ~n := #in~n; 62814#L18 assume !(~n < 1); 62802#L20 assume !(1 == ~n); 62572#L23 call #t~ret2 := fibo1(~n - 1);< 62573#fibo1ENTRY ~n := #in~n; 62780#L8 assume !(~n < 1); 62579#L10 assume 1 == ~n;#res := 1; 62578#fibo1FINAL assume true; 62571#fibo1EXIT >#45#return; 62566#L23-1 call #t~ret3 := fibo1(~n - 2);< 62567#fibo1ENTRY ~n := #in~n; 62574#L8 assume ~n < 1;#res := 0; 62570#fibo1FINAL assume true; 62565#fibo1EXIT >#47#return; 62559#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62547#fibo2FINAL assume true; 62542#fibo2EXIT >#49#return; 62538#L13-1 call #t~ret1 := fibo2(~n - 2);< 62539#fibo2ENTRY ~n := #in~n; 62557#L18 assume !(~n < 1); 62546#L20 assume 1 == ~n;#res := 1; 62541#fibo2FINAL assume true; 62537#fibo2EXIT >#51#return; 62535#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62391#fibo1FINAL assume true; 62381#fibo1EXIT >#47#return; 62380#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62379#fibo2FINAL assume true; 62378#fibo2EXIT >#49#return; 62147#L13-1 call #t~ret1 := fibo2(~n - 2);< 62148#fibo2ENTRY ~n := #in~n; 63428#L18 assume !(~n < 1); 63427#L20 assume !(1 == ~n); 62975#L23 call #t~ret2 := fibo1(~n - 1);< 63426#fibo1ENTRY ~n := #in~n; 63425#L8 assume !(~n < 1); 63424#L10 assume !(1 == ~n); 62264#L13 call #t~ret0 := fibo2(~n - 1);< 63421#fibo2ENTRY ~n := #in~n; 63420#L18 assume !(~n < 1); 63419#L20 assume !(1 == ~n); 63051#L23 call #t~ret2 := fibo1(~n - 1);< 63052#fibo1ENTRY ~n := #in~n; 63431#L8 assume !(~n < 1); 63397#L10 assume 1 == ~n;#res := 1; 63396#fibo1FINAL assume true; 63049#fibo1EXIT >#45#return; 63039#L23-1 call #t~ret3 := fibo1(~n - 2);< 63048#fibo1ENTRY ~n := #in~n; 63053#L8 assume ~n < 1;#res := 0; 63054#fibo1FINAL assume true; 63038#fibo1EXIT >#47#return; 63035#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 63036#fibo2FINAL assume true; 62983#fibo2EXIT >#49#return; 62980#L13-1 call #t~ret1 := fibo2(~n - 2);< 62981#fibo2ENTRY ~n := #in~n; 62986#L18 assume !(~n < 1); 62985#L20 assume 1 == ~n;#res := 1; 62982#fibo2FINAL assume true; 62979#fibo2EXIT >#51#return; 62978#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62977#fibo1FINAL assume true; 62973#fibo1EXIT >#45#return; 62958#L23-1 call #t~ret3 := fibo1(~n - 2);< 62959#fibo1ENTRY ~n := #in~n; 62995#L8 assume !(~n < 1); 62988#L10 assume !(1 == ~n); 62968#L13 call #t~ret0 := fibo2(~n - 1);< 62969#fibo2ENTRY ~n := #in~n; 62987#L18 assume !(~n < 1); 62972#L20 assume 1 == ~n;#res := 1; 62971#fibo2FINAL assume true; 62967#fibo2EXIT >#49#return; 62964#L13-1 call #t~ret1 := fibo2(~n - 2);< 62965#fibo2ENTRY ~n := #in~n; 62970#L18 assume ~n < 1;#res := 0; 62966#fibo2FINAL assume true; 62962#fibo2EXIT >#51#return; 62961#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62960#fibo1FINAL assume true; 62957#fibo1EXIT >#47#return; 62956#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62955#fibo2FINAL assume true; 62953#fibo2EXIT >#51#return; 62145#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62144#fibo1FINAL assume true; 61285#fibo1EXIT >#45#return; 61132#L23-1 call #t~ret3 := fibo1(~n - 2);< 61209#fibo1ENTRY ~n := #in~n; 61290#L8 assume !(~n < 1); 61288#L10 assume !(1 == ~n); 61106#L13 call #t~ret0 := fibo2(~n - 1);< 61110#fibo2ENTRY ~n := #in~n; 61146#L18 assume !(~n < 1); 61144#L20 assume !(1 == ~n); 61126#L23 call #t~ret2 := fibo1(~n - 1);< 61127#fibo1ENTRY ~n := #in~n; 61534#L8 assume !(~n < 1); 61531#L10 assume !(1 == ~n); 61527#L13 call #t~ret0 := fibo2(~n - 1);< 61529#fibo2ENTRY ~n := #in~n; 61535#L18 assume !(~n < 1); 61532#L20 assume 1 == ~n;#res := 1; 61530#fibo2FINAL assume true; 61526#fibo2EXIT >#49#return; 61522#L13-1 call #t~ret1 := fibo2(~n - 2);< 61524#fibo2ENTRY ~n := #in~n; 61538#L18 assume ~n < 1;#res := 0; 61537#fibo2FINAL assume true; 61520#fibo2EXIT >#51#return; 61518#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61513#fibo1FINAL assume true; 61497#fibo1EXIT >#45#return; 61050#L23-1 call #t~ret3 := fibo1(~n - 2);< 61049#fibo1ENTRY ~n := #in~n; 61051#L8 assume !(~n < 1); 61495#L10 assume 1 == ~n;#res := 1; 61496#fibo1FINAL assume true; 61379#fibo1EXIT >#47#return; 61319#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61318#fibo2FINAL assume true; 61284#fibo2EXIT >#49#return; 61280#L13-1 call #t~ret1 := fibo2(~n - 2);< 61267#fibo2ENTRY ~n := #in~n; 61441#L18 assume !(~n < 1); 61437#L20 assume !(1 == ~n); 61335#L23 call #t~ret2 := fibo1(~n - 1);< 61337#fibo1ENTRY ~n := #in~n; 61655#L8 assume !(~n < 1); 61385#L10 assume 1 == ~n;#res := 1; 61384#fibo1FINAL assume true; 61334#fibo1EXIT >#45#return; 61323#L23-1 call #t~ret3 := fibo1(~n - 2);< 61325#fibo1ENTRY ~n := #in~n; 61383#L8 assume ~n < 1;#res := 0; 61382#fibo1FINAL assume true; 61322#fibo1EXIT >#47#return; 61321#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61296#fibo2FINAL assume true; 61279#fibo2EXIT >#51#return; 61278#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61277#fibo1FINAL assume true; 61208#fibo1EXIT >#47#return; 61133#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61203#fibo2FINAL assume true; 61195#fibo2EXIT >#49#return; 61129#L13-1 call #t~ret1 := fibo2(~n - 2);< 61193#fibo2ENTRY ~n := #in~n; 61190#L18 assume !(~n < 1); 61189#L20 assume !(1 == ~n); 61083#L23 call #t~ret2 := fibo1(~n - 1);< 61134#fibo1ENTRY ~n := #in~n; 61775#L8 assume !(~n < 1); 61774#L10 assume !(1 == ~n); 61009#L13 call #t~ret0 := fibo2(~n - 1);< 61084#fibo2ENTRY ~n := #in~n; 61101#L18 assume !(~n < 1); 61100#L20 assume !(1 == ~n); 61096#L23 call #t~ret2 := fibo1(~n - 1);< 61099#fibo1ENTRY ~n := #in~n; 61378#L8 assume !(~n < 1); 61374#L10 assume !(1 == ~n); 61368#L13 call #t~ret0 := fibo2(~n - 1);< 61370#fibo2ENTRY ~n := #in~n; 61776#L18 assume !(~n < 1); 61435#L20 assume !(1 == ~n); 61404#L23 call #t~ret2 := fibo1(~n - 1);< 61410#fibo1ENTRY ~n := #in~n; 61408#L8 assume !(~n < 1); 61407#L10 assume !(1 == ~n); 61369#L13 call #t~ret0 := fibo2(~n - 1);< 61370#fibo2ENTRY ~n := #in~n; 61776#L18 assume !(~n < 1); 61435#L20 assume 1 == ~n;#res := 1; 61436#fibo2FINAL assume true; 61367#fibo2EXIT >#49#return; 61362#L13-1 call #t~ret1 := fibo2(~n - 2);< 61365#fibo2ENTRY ~n := #in~n; 61764#L18 assume ~n < 1;#res := 0; 61762#fibo2FINAL assume true; 61361#fibo2EXIT >#51#return; 61364#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61604#fibo1FINAL assume true; 61602#fibo1EXIT >#45#return; 61595#L23-1 call #t~ret3 := fibo1(~n - 2);< 61600#fibo1ENTRY ~n := #in~n; 61606#L8 assume !(~n < 1); 61603#L10 assume 1 == ~n;#res := 1; 61601#fibo1FINAL assume true; 61594#fibo1EXIT >#47#return; 61598#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61654#fibo2FINAL assume true; 61653#fibo2EXIT >#49#return; 61583#L13-1 call #t~ret1 := fibo2(~n - 2);< 61586#fibo2ENTRY ~n := #in~n; 61791#L18 assume !(~n < 1); 61789#L20 assume !(1 == ~n); 61668#L23 call #t~ret2 := fibo1(~n - 1);< 61670#fibo1ENTRY ~n := #in~n; 61677#L8 assume !(~n < 1); 61676#L10 assume 1 == ~n;#res := 1; 61675#fibo1FINAL assume true; 61667#fibo1EXIT >#45#return; 61662#L23-1 call #t~ret3 := fibo1(~n - 2);< 61663#fibo1ENTRY ~n := #in~n; 61682#L8 assume ~n < 1;#res := 0; 61681#fibo1FINAL assume true; 61661#fibo1EXIT >#47#return; 61659#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61650#fibo2FINAL assume true; 61582#fibo2EXIT >#51#return; 61585#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62141#fibo1FINAL assume true; 62140#fibo1EXIT >#45#return; 61091#L23-1 call #t~ret3 := fibo1(~n - 2);< 62139#fibo1ENTRY ~n := #in~n; 62137#L8 assume !(~n < 1); 62135#L10 assume !(1 == ~n); 61417#L13 call #t~ret0 := fibo2(~n - 1);< 61418#fibo2ENTRY ~n := #in~n; 62143#L18 assume !(~n < 1); 62142#L20 assume !(1 == ~n); 61698#L23 call #t~ret2 := fibo1(~n - 1);< 61700#fibo1ENTRY ~n := #in~n; 61760#L8 assume !(~n < 1); 61758#L10 assume 1 == ~n;#res := 1; 61757#fibo1FINAL assume true; 61697#fibo1EXIT >#45#return; 61693#L23-1 call #t~ret3 := fibo1(~n - 2);< 61696#fibo1ENTRY ~n := #in~n; 61761#L8 assume ~n < 1;#res := 0; 61759#fibo1FINAL assume true; 61692#fibo1EXIT >#47#return; 61690#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61691#fibo2FINAL assume true; 61416#fibo2EXIT >#49#return; 61341#L13-1 call #t~ret1 := fibo2(~n - 2);< 61413#fibo2ENTRY ~n := #in~n; 61414#L18 assume !(~n < 1); 62101#L20 assume 1 == ~n;#res := 1; 62100#fibo2FINAL assume true; 62098#fibo2EXIT >#51#return; 62099#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62138#fibo1FINAL assume true; 61087#fibo1EXIT >#47#return; 61027#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61007#fibo2FINAL assume true; 61010#fibo2EXIT >#49#return; 61058#L13-1 call #t~ret1 := fibo2(~n - 2);< 61301#fibo2ENTRY ~n := #in~n; 61642#L18 assume !(~n < 1); 61640#L20 assume !(1 == ~n); 61031#L23 call #t~ret2 := fibo1(~n - 1);< 61444#fibo1ENTRY ~n := #in~n; 61801#L8 assume !(~n < 1); 61799#L10 assume !(1 == ~n); 61015#L13 call #t~ret0 := fibo2(~n - 1);< 61032#fibo2ENTRY ~n := #in~n; 61054#L18 assume !(~n < 1); 61065#L20 assume !(1 == ~n); 61020#L23 call #t~ret2 := fibo1(~n - 1);< 61800#fibo1ENTRY ~n := #in~n; 61826#L8 assume !(~n < 1); 61019#L10 assume 1 == ~n;#res := 1; 61021#fibo1FINAL assume true; 61029#fibo1EXIT >#45#return; 61014#L23-1 call #t~ret3 := fibo1(~n - 2);< 61016#fibo1ENTRY ~n := #in~n; 61797#L8 assume ~n < 1;#res := 0; 61796#fibo1FINAL assume true; 61795#fibo1EXIT >#47#return; 61794#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61793#fibo2FINAL assume true; 61792#fibo2EXIT >#49#return; 61037#L13-1 call #t~ret1 := fibo2(~n - 2);< 61038#fibo2ENTRY ~n := #in~n; 61787#L18 assume !(~n < 1); 61786#L20 assume 1 == ~n;#res := 1; 61785#fibo2FINAL assume true; 61784#fibo2EXIT >#51#return; 61779#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61778#fibo1FINAL assume true; 61442#fibo1EXIT >#45#return; 61316#L23-1 call #t~ret3 := fibo1(~n - 2);< 61317#fibo1ENTRY ~n := #in~n; 61477#L8 assume !(~n < 1); 61476#L10 assume !(1 == ~n); 61376#L13 call #t~ret0 := fibo2(~n - 1);< 61377#fibo2ENTRY ~n := #in~n; 61475#L18 assume !(~n < 1); 61389#L20 assume 1 == ~n;#res := 1; 61387#fibo2FINAL assume true; 61375#fibo2EXIT >#49#return; 61372#L13-1 call #t~ret1 := fibo2(~n - 2);< 61373#fibo2ENTRY ~n := #in~n; 61393#L18 assume ~n < 1;#res := 0; 61201#fibo2FINAL assume true; 61371#fibo2EXIT >#51#return; 61366#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61360#fibo1FINAL assume true; 61315#fibo1EXIT >#47#return; 61313#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61300#fibo2FINAL assume true; 61299#fibo2EXIT >#51#return; 61109#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62162#fibo1FINAL assume true; 61131#fibo1EXIT >#45#return; 61042#L23-1 call #t~ret3 := fibo1(~n - 2);< 61121#fibo1ENTRY [2019-11-16 00:01:34,628 INFO L793 eck$LassoCheckResult]: Loop: 61121#fibo1ENTRY ~n := #in~n; 61115#L8 assume !(~n < 1); 61113#L10 assume !(1 == ~n); 61107#L13 call #t~ret0 := fibo2(~n - 1);< 61110#fibo2ENTRY ~n := #in~n; 61146#L18 assume !(~n < 1); 61144#L20 assume !(1 == ~n); 61126#L23 call #t~ret2 := fibo1(~n - 1);< 61128#fibo1ENTRY ~n := #in~n; 61166#L8 assume !(~n < 1); 61165#L10 assume !(1 == ~n); 61162#L13 call #t~ret0 := fibo2(~n - 1);< 61164#fibo2ENTRY ~n := #in~n; 61272#L18 assume !(~n < 1); 61269#L20 assume !(1 == ~n); 61186#L23 call #t~ret2 := fibo1(~n - 1);< 61188#fibo1ENTRY ~n := #in~n; 61217#L8 assume !(~n < 1); 61215#L10 assume !(1 == ~n); 61192#L13 call #t~ret0 := fibo2(~n - 1);< 61211#fibo2ENTRY ~n := #in~n; 61293#L18 assume !(~n < 1); 61291#L20 assume !(1 == ~n); 61292#L23 call #t~ret2 := fibo1(~n - 1);< 61468#fibo1ENTRY ~n := #in~n; 61472#L8 assume !(~n < 1); 61471#L10 assume 1 == ~n;#res := 1; 61470#fibo1FINAL assume true; 61467#fibo1EXIT >#45#return; 61459#L23-1 call #t~ret3 := fibo1(~n - 2);< 61464#fibo1ENTRY ~n := #in~n; 61469#L8 assume ~n < 1;#res := 0; 61465#fibo1FINAL assume true; 61458#fibo1EXIT >#47#return; 61462#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62237#fibo2FINAL assume true; 62236#fibo2EXIT >#49#return; 62234#L13-1 call #t~ret1 := fibo2(~n - 2);< 62235#fibo2ENTRY ~n := #in~n; 62240#L18 assume !(~n < 1); 62239#L20 assume 1 == ~n;#res := 1; 62238#fibo2FINAL assume true; 62233#fibo2EXIT >#51#return; 62232#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62215#fibo1FINAL assume true; 62211#fibo1EXIT >#45#return; 62194#L23-1 call #t~ret3 := fibo1(~n - 2);< 62199#fibo1ENTRY ~n := #in~n; 62254#L8 assume !(~n < 1); 62252#L10 assume !(1 == ~n); 62248#L13 call #t~ret0 := fibo2(~n - 1);< 62249#fibo2ENTRY ~n := #in~n; 62255#L18 assume !(~n < 1); 62253#L20 assume 1 == ~n;#res := 1; 62251#fibo2FINAL assume true; 62247#fibo2EXIT >#49#return; 62223#L13-1 call #t~ret1 := fibo2(~n - 2);< 62225#fibo2ENTRY ~n := #in~n; 62250#L18 assume ~n < 1;#res := 0; 62243#fibo2FINAL assume true; 62222#fibo2EXIT >#51#return; 62214#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62210#fibo1FINAL assume true; 62193#fibo1EXIT >#47#return; 62189#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62183#fibo2FINAL assume true; 62177#fibo2EXIT >#49#return; 61150#L13-1 call #t~ret1 := fibo2(~n - 2);< 62175#fibo2ENTRY ~n := #in~n; 61643#L18 assume !(~n < 1); 61641#L20 assume !(1 == ~n); 61228#L23 call #t~ret2 := fibo1(~n - 1);< 61229#fibo1ENTRY ~n := #in~n; 61993#L8 assume !(~n < 1); 61237#L10 assume 1 == ~n;#res := 1; 61235#fibo1FINAL assume true; 61226#fibo1EXIT >#45#return; 61219#L23-1 call #t~ret3 := fibo1(~n - 2);< 61222#fibo1ENTRY ~n := #in~n; 61230#L8 assume ~n < 1;#res := 0; 61223#fibo1FINAL assume true; 61218#fibo1EXIT >#47#return; 61216#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61212#fibo2FINAL assume true; 61148#fibo2EXIT >#51#return; 61155#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62163#fibo1FINAL assume true; 61125#fibo1EXIT >#45#return; 61044#L23-1 call #t~ret3 := fibo1(~n - 2);< 61122#fibo1ENTRY ~n := #in~n; 61768#L8 assume !(~n < 1); 61069#L10 assume !(1 == ~n); 61070#L13 call #t~ret0 := fibo2(~n - 1);< 61142#fibo2ENTRY ~n := #in~n; 61802#L18 assume !(~n < 1); 61798#L20 assume !(1 == ~n); 61254#L23 call #t~ret2 := fibo1(~n - 1);< 61255#fibo1ENTRY ~n := #in~n; 61992#L8 assume !(~n < 1); 61259#L10 assume 1 == ~n;#res := 1; 61258#fibo1FINAL assume true; 61252#fibo1EXIT >#45#return; 61245#L23-1 call #t~ret3 := fibo1(~n - 2);< 61248#fibo1ENTRY ~n := #in~n; 61257#L8 assume ~n < 1;#res := 0; 61250#fibo1FINAL assume true; 61244#fibo1EXIT >#47#return; 61240#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61239#fibo2FINAL assume true; 61141#fibo2EXIT >#49#return; 61136#L13-1 call #t~ret1 := fibo2(~n - 2);< 61139#fibo2ENTRY ~n := #in~n; 61200#L18 assume !(~n < 1); 61198#L20 assume 1 == ~n;#res := 1; 61194#fibo2FINAL assume true; 61135#fibo2EXIT >#51#return; 61130#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61123#fibo1FINAL assume true; 61119#fibo1EXIT >#47#return; 61114#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61112#fibo2FINAL assume true; 61105#fibo2EXIT >#49#return; 61077#L13-1 call #t~ret1 := fibo2(~n - 2);< 61081#fibo2ENTRY ~n := #in~n; 61080#L18 assume !(~n < 1); 61079#L20 assume !(1 == ~n); 61033#L23 call #t~ret2 := fibo1(~n - 1);< 61074#fibo1ENTRY ~n := #in~n; 61073#L8 assume !(~n < 1); 61072#L10 assume !(1 == ~n); 61008#L13 call #t~ret0 := fibo2(~n - 1);< 61084#fibo2ENTRY ~n := #in~n; 61101#L18 assume !(~n < 1); 61100#L20 assume !(1 == ~n); 61096#L23 call #t~ret2 := fibo1(~n - 1);< 61099#fibo1ENTRY ~n := #in~n; 61378#L8 assume !(~n < 1); 61374#L10 assume !(1 == ~n); 61368#L13 call #t~ret0 := fibo2(~n - 1);< 61370#fibo2ENTRY ~n := #in~n; 61776#L18 assume !(~n < 1); 61435#L20 assume !(1 == ~n); 61404#L23 call #t~ret2 := fibo1(~n - 1);< 61410#fibo1ENTRY ~n := #in~n; 61408#L8 assume !(~n < 1); 61407#L10 assume !(1 == ~n); 61369#L13 call #t~ret0 := fibo2(~n - 1);< 61370#fibo2ENTRY ~n := #in~n; 61776#L18 assume !(~n < 1); 61435#L20 assume 1 == ~n;#res := 1; 61436#fibo2FINAL assume true; 61367#fibo2EXIT >#49#return; 61362#L13-1 call #t~ret1 := fibo2(~n - 2);< 61365#fibo2ENTRY ~n := #in~n; 61764#L18 assume ~n < 1;#res := 0; 61762#fibo2FINAL assume true; 61361#fibo2EXIT >#51#return; 61364#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61604#fibo1FINAL assume true; 61602#fibo1EXIT >#45#return; 61595#L23-1 call #t~ret3 := fibo1(~n - 2);< 61600#fibo1ENTRY ~n := #in~n; 61606#L8 assume !(~n < 1); 61603#L10 assume 1 == ~n;#res := 1; 61601#fibo1FINAL assume true; 61594#fibo1EXIT >#47#return; 61598#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61654#fibo2FINAL assume true; 61653#fibo2EXIT >#49#return; 61583#L13-1 call #t~ret1 := fibo2(~n - 2);< 61586#fibo2ENTRY ~n := #in~n; 61791#L18 assume !(~n < 1); 61789#L20 assume !(1 == ~n); 61668#L23 call #t~ret2 := fibo1(~n - 1);< 61670#fibo1ENTRY ~n := #in~n; 61677#L8 assume !(~n < 1); 61676#L10 assume 1 == ~n;#res := 1; 61675#fibo1FINAL assume true; 61667#fibo1EXIT >#45#return; 61662#L23-1 call #t~ret3 := fibo1(~n - 2);< 61663#fibo1ENTRY ~n := #in~n; 61682#L8 assume ~n < 1;#res := 0; 61681#fibo1FINAL assume true; 61661#fibo1EXIT >#47#return; 61659#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61650#fibo2FINAL assume true; 61582#fibo2EXIT >#51#return; 61585#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62141#fibo1FINAL assume true; 62140#fibo1EXIT >#45#return; 61091#L23-1 call #t~ret3 := fibo1(~n - 2);< 62139#fibo1ENTRY ~n := #in~n; 62137#L8 assume !(~n < 1); 62135#L10 assume !(1 == ~n); 61417#L13 call #t~ret0 := fibo2(~n - 1);< 61418#fibo2ENTRY ~n := #in~n; 62143#L18 assume !(~n < 1); 62142#L20 assume !(1 == ~n); 61698#L23 call #t~ret2 := fibo1(~n - 1);< 61700#fibo1ENTRY ~n := #in~n; 61760#L8 assume !(~n < 1); 61758#L10 assume 1 == ~n;#res := 1; 61757#fibo1FINAL assume true; 61697#fibo1EXIT >#45#return; 61693#L23-1 call #t~ret3 := fibo1(~n - 2);< 61696#fibo1ENTRY ~n := #in~n; 61761#L8 assume ~n < 1;#res := 0; 61759#fibo1FINAL assume true; 61692#fibo1EXIT >#47#return; 61690#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61691#fibo2FINAL assume true; 61416#fibo2EXIT >#49#return; 61341#L13-1 call #t~ret1 := fibo2(~n - 2);< 61413#fibo2ENTRY ~n := #in~n; 61414#L18 assume !(~n < 1); 62101#L20 assume 1 == ~n;#res := 1; 62100#fibo2FINAL assume true; 62098#fibo2EXIT >#51#return; 62099#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62138#fibo1FINAL assume true; 61087#fibo1EXIT >#47#return; 61027#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61007#fibo2FINAL assume true; 61010#fibo2EXIT >#49#return; 61059#L13-1 call #t~ret1 := fibo2(~n - 2);< 61301#fibo2ENTRY ~n := #in~n; 61642#L18 assume !(~n < 1); 61640#L20 assume !(1 == ~n); 61031#L23 call #t~ret2 := fibo1(~n - 1);< 61444#fibo1ENTRY ~n := #in~n; 61801#L8 assume !(~n < 1); 61799#L10 assume !(1 == ~n); 61015#L13 call #t~ret0 := fibo2(~n - 1);< 61032#fibo2ENTRY ~n := #in~n; 61054#L18 assume !(~n < 1); 61065#L20 assume !(1 == ~n); 61020#L23 call #t~ret2 := fibo1(~n - 1);< 61800#fibo1ENTRY ~n := #in~n; 61826#L8 assume !(~n < 1); 61019#L10 assume 1 == ~n;#res := 1; 61021#fibo1FINAL assume true; 61029#fibo1EXIT >#45#return; 61014#L23-1 call #t~ret3 := fibo1(~n - 2);< 61016#fibo1ENTRY ~n := #in~n; 61797#L8 assume ~n < 1;#res := 0; 61796#fibo1FINAL assume true; 61795#fibo1EXIT >#47#return; 61794#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61793#fibo2FINAL assume true; 61792#fibo2EXIT >#49#return; 61037#L13-1 call #t~ret1 := fibo2(~n - 2);< 61038#fibo2ENTRY ~n := #in~n; 61787#L18 assume !(~n < 1); 61786#L20 assume 1 == ~n;#res := 1; 61785#fibo2FINAL assume true; 61784#fibo2EXIT >#51#return; 61779#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61778#fibo1FINAL assume true; 61442#fibo1EXIT >#45#return; 61316#L23-1 call #t~ret3 := fibo1(~n - 2);< 61317#fibo1ENTRY ~n := #in~n; 61477#L8 assume !(~n < 1); 61476#L10 assume !(1 == ~n); 61376#L13 call #t~ret0 := fibo2(~n - 1);< 61377#fibo2ENTRY ~n := #in~n; 61475#L18 assume !(~n < 1); 61389#L20 assume 1 == ~n;#res := 1; 61387#fibo2FINAL assume true; 61375#fibo2EXIT >#49#return; 61372#L13-1 call #t~ret1 := fibo2(~n - 2);< 61373#fibo2ENTRY ~n := #in~n; 61393#L18 assume ~n < 1;#res := 0; 61201#fibo2FINAL assume true; 61371#fibo2EXIT >#51#return; 61366#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61360#fibo1FINAL assume true; 61315#fibo1EXIT >#47#return; 61313#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61300#fibo2FINAL assume true; 61299#fibo2EXIT >#51#return; 61047#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61041#fibo1FINAL assume true; 61045#fibo1EXIT >#45#return; 61043#L23-1 call #t~ret3 := fibo1(~n - 2);< 61121#fibo1ENTRY [2019-11-16 00:01:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash -100717608, now seen corresponding path program 3 times [2019-11-16 00:01:34,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:34,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252325376] [2019-11-16 00:01:34,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:34,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:34,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 762 proven. 1188 refuted. 0 times theorem prover too weak. 2900 trivial. 0 not checked. [2019-11-16 00:01:35,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252325376] [2019-11-16 00:01:35,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102706254] [2019-11-16 00:01:35,633 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:35,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-16 00:01:35,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:35,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:01:35,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 590 proven. 181 refuted. 0 times theorem prover too weak. 4079 trivial. 0 not checked. [2019-11-16 00:01:36,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:36,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 35 [2019-11-16 00:01:36,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989584808] [2019-11-16 00:01:36,037 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash -162680412, now seen corresponding path program 2 times [2019-11-16 00:01:36,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:36,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910605403] [2019-11-16 00:01:36,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:36,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:36,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 381 proven. 692 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-11-16 00:01:36,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910605403] [2019-11-16 00:01:36,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834390134] [2019-11-16 00:01:36,791 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:36,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:01:36,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:36,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:01:36,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1208 proven. 52 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2019-11-16 00:01:37,180 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:37,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 34 [2019-11-16 00:01:37,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410006402] [2019-11-16 00:01:37,182 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:01:37,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:01:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:01:37,183 INFO L87 Difference]: Start difference. First operand 2767 states and 3257 transitions. cyclomatic complexity: 500 Second operand 34 states. [2019-11-16 00:01:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:38,344 INFO L93 Difference]: Finished difference Result 2905 states and 3408 transitions. [2019-11-16 00:01:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:01:38,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2905 states and 3408 transitions. [2019-11-16 00:01:38,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-16 00:01:38,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2905 states to 2857 states and 3360 transitions. [2019-11-16 00:01:38,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2019-11-16 00:01:38,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2019-11-16 00:01:38,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2857 states and 3360 transitions. [2019-11-16 00:01:38,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:38,389 INFO L688 BuchiCegarLoop]: Abstraction has 2857 states and 3360 transitions. [2019-11-16 00:01:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states and 3360 transitions. [2019-11-16 00:01:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2698. [2019-11-16 00:01:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-16 00:01:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3097 transitions. [2019-11-16 00:01:38,454 INFO L711 BuchiCegarLoop]: Abstraction has 2698 states and 3097 transitions. [2019-11-16 00:01:38,455 INFO L591 BuchiCegarLoop]: Abstraction has 2698 states and 3097 transitions. [2019-11-16 00:01:38,455 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:01:38,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2698 states and 3097 transitions. [2019-11-16 00:01:38,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-16 00:01:38,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:01:38,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:01:38,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 20, 20, 19, 18, 13, 12, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 6, 4, 4, 1, 1] [2019-11-16 00:01:38,467 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1] [2019-11-16 00:01:38,467 INFO L791 eck$LassoCheckResult]: Stem: 71400#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 71373#L37 call main_#t~ret4 := fibo1(main_~x~0);< 71374#fibo1ENTRY ~n := #in~n; 71753#L8 assume !(~n < 1); 71752#L10 assume !(1 == ~n); 71510#L13 call #t~ret0 := fibo2(~n - 1);< 71511#fibo2ENTRY ~n := #in~n; 71637#L18 assume !(~n < 1); 71635#L20 assume !(1 == ~n); 71632#L23 call #t~ret2 := fibo1(~n - 1);< 71633#fibo1ENTRY ~n := #in~n; 72060#L8 assume !(~n < 1); 72059#L10 assume !(1 == ~n); 72056#L13 call #t~ret0 := fibo2(~n - 1);< 72058#fibo2ENTRY ~n := #in~n; 72057#L18 assume !(~n < 1); 72055#L20 assume !(1 == ~n); 72049#L23 call #t~ret2 := fibo1(~n - 1);< 72048#fibo1ENTRY ~n := #in~n; 72050#L8 assume !(~n < 1); 73285#L10 assume !(1 == ~n); 71349#L13 call #t~ret0 := fibo2(~n - 1);< 71914#fibo2ENTRY ~n := #in~n; 71913#L18 assume !(~n < 1); 71910#L20 assume !(1 == ~n); 71911#L23 call #t~ret2 := fibo1(~n - 1);< 72052#fibo1ENTRY ~n := #in~n; 73026#L8 assume !(~n < 1); 73573#L10 assume !(1 == ~n); 73570#L13 call #t~ret0 := fibo2(~n - 1);< 73571#fibo2ENTRY ~n := #in~n; 73578#L18 assume !(~n < 1); 73576#L20 assume 1 == ~n;#res := 1; 73575#fibo2FINAL assume true; 73569#fibo2EXIT >#49#return; 73565#L13-1 call #t~ret1 := fibo2(~n - 2);< 73566#fibo2ENTRY ~n := #in~n; 73572#L18 assume ~n < 1;#res := 0; 73568#fibo2FINAL assume true; 73564#fibo2EXIT >#51#return; 73563#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73562#fibo1FINAL assume true; 73560#fibo1EXIT >#45#return; 73545#L23-1 call #t~ret3 := fibo1(~n - 2);< 73546#fibo1ENTRY ~n := #in~n; 73574#L8 assume !(~n < 1); 73567#L10 assume 1 == ~n;#res := 1; 73558#fibo1FINAL assume true; 73544#fibo1EXIT >#47#return; 73542#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73536#fibo2FINAL assume true; 73531#fibo2EXIT >#49#return; 73349#L13-1 call #t~ret1 := fibo2(~n - 2);< 73353#fibo2ENTRY ~n := #in~n; 73498#L18 assume !(~n < 1); 73497#L20 assume !(1 == ~n); 73494#L23 call #t~ret2 := fibo1(~n - 1);< 73495#fibo1ENTRY ~n := #in~n; 73502#L8 assume !(~n < 1); 73500#L10 assume 1 == ~n;#res := 1; 73499#fibo1FINAL assume true; 73493#fibo1EXIT >#45#return; 73490#L23-1 call #t~ret3 := fibo1(~n - 2);< 73491#fibo1ENTRY ~n := #in~n; 73503#L8 assume ~n < 1;#res := 0; 73501#fibo1FINAL assume true; 73489#fibo1EXIT >#47#return; 73480#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73477#fibo2FINAL assume true; 73347#fibo2EXIT >#51#return; 73351#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73585#fibo1FINAL assume true; 73582#fibo1EXIT >#45#return; 73319#L23-1 call #t~ret3 := fibo1(~n - 2);< 73323#fibo1ENTRY ~n := #in~n; 73374#L8 assume !(~n < 1); 73373#L10 assume !(1 == ~n); 73371#L13 call #t~ret0 := fibo2(~n - 1);< 73372#fibo2ENTRY ~n := #in~n; 73386#L18 assume !(~n < 1); 73384#L20 assume !(1 == ~n); 73382#L23 call #t~ret2 := fibo1(~n - 1);< 73383#fibo1ENTRY ~n := #in~n; 73456#L8 assume !(~n < 1); 73455#L10 assume 1 == ~n;#res := 1; 73454#fibo1FINAL assume true; 73381#fibo1EXIT >#45#return; 73379#L23-1 call #t~ret3 := fibo1(~n - 2);< 73380#fibo1ENTRY ~n := #in~n; 73458#L8 assume ~n < 1;#res := 0; 73457#fibo1FINAL assume true; 73378#fibo1EXIT >#47#return; 73377#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73375#fibo2FINAL assume true; 73370#fibo2EXIT >#49#return; 73368#L13-1 call #t~ret1 := fibo2(~n - 2);< 73369#fibo2ENTRY ~n := #in~n; 73462#L18 assume !(~n < 1); 73460#L20 assume 1 == ~n;#res := 1; 73459#fibo2FINAL assume true; 73367#fibo2EXIT >#51#return; 73365#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73360#fibo1FINAL assume true; 73317#fibo1EXIT >#47#return; 73322#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73698#fibo2FINAL assume true; 73697#fibo2EXIT >#49#return; 71647#L13-1 call #t~ret1 := fibo2(~n - 2);< 71648#fibo2ENTRY ~n := #in~n; 73636#L18 assume !(~n < 1); 73635#L20 assume !(1 == ~n); 73629#L23 call #t~ret2 := fibo1(~n - 1);< 73634#fibo1ENTRY ~n := #in~n; 73632#L8 assume !(~n < 1); 73630#L10 assume !(1 == ~n); 72008#L13 call #t~ret0 := fibo2(~n - 1);< 73628#fibo2ENTRY ~n := #in~n; 73627#L18 assume !(~n < 1); 73625#L20 assume !(1 == ~n); 73617#L23 call #t~ret2 := fibo1(~n - 1);< 73619#fibo1ENTRY ~n := #in~n; 73633#L8 assume !(~n < 1); 73631#L10 assume 1 == ~n;#res := 1; 73624#fibo1FINAL assume true; 73616#fibo1EXIT >#45#return; 73611#L23-1 call #t~ret3 := fibo1(~n - 2);< 73614#fibo1ENTRY ~n := #in~n; 73638#L8 assume ~n < 1;#res := 0; 73637#fibo1FINAL assume true; 73610#fibo1EXIT >#47#return; 73613#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73743#fibo2FINAL assume true; 73742#fibo2EXIT >#49#return; 73738#L13-1 call #t~ret1 := fibo2(~n - 2);< 73739#fibo2ENTRY ~n := #in~n; 73752#L18 assume !(~n < 1); 73751#L20 assume 1 == ~n;#res := 1; 73748#fibo2FINAL assume true; 73737#fibo2EXIT >#51#return; 73733#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73729#fibo1FINAL assume true; 73727#fibo1EXIT >#45#return; 73710#L23-1 call #t~ret3 := fibo1(~n - 2);< 73711#fibo1ENTRY ~n := #in~n; 73750#L8 assume !(~n < 1); 73747#L10 assume !(1 == ~n); 73735#L13 call #t~ret0 := fibo2(~n - 1);< 73736#fibo2ENTRY ~n := #in~n; 73749#L18 assume !(~n < 1); 73746#L20 assume 1 == ~n;#res := 1; 73745#fibo2FINAL assume true; 73734#fibo2EXIT >#49#return; 73731#L13-1 call #t~ret1 := fibo2(~n - 2);< 73732#fibo2ENTRY ~n := #in~n; 73740#L18 assume ~n < 1;#res := 0; 72340#fibo2FINAL assume true; 73730#fibo2EXIT >#51#return; 73728#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73725#fibo1FINAL assume true; 73709#fibo1EXIT >#47#return; 73706#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 71755#fibo2FINAL assume true; 71760#fibo2EXIT >#51#return; 71636#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 71634#fibo1FINAL assume true; 71631#fibo1EXIT >#45#return; 71386#L23-1 call #t~ret3 := fibo1(~n - 2);< 71629#fibo1ENTRY ~n := #in~n; 71659#L8 assume !(~n < 1); 71658#L10 assume !(1 == ~n); 71430#L13 call #t~ret0 := fibo2(~n - 1);< 71435#fibo2ENTRY ~n := #in~n; 71462#L18 assume !(~n < 1); 71459#L20 assume !(1 == ~n); 71455#L23 call #t~ret2 := fibo1(~n - 1);< 71456#fibo1ENTRY ~n := #in~n; 71527#L8 assume !(~n < 1); 71526#L10 assume !(1 == ~n); 71523#L13 call #t~ret0 := fibo2(~n - 1);< 71525#fibo2ENTRY ~n := #in~n; 71552#L18 assume !(~n < 1); 71548#L20 assume !(1 == ~n); 71546#L23 call #t~ret2 := fibo1(~n - 1);< 71547#fibo1ENTRY ~n := #in~n; 71583#L8 assume !(~n < 1); 71580#L10 assume !(1 == ~n); 71576#L13 call #t~ret0 := fibo2(~n - 1);< 71577#fibo2ENTRY ~n := #in~n; 71584#L18 assume !(~n < 1); 71581#L20 assume !(1 == ~n); 71582#L23 call #t~ret2 := fibo1(~n - 1);< 71832#fibo1ENTRY ~n := #in~n; 71840#L8 assume !(~n < 1); 71836#L10 assume 1 == ~n;#res := 1; 71835#fibo1FINAL assume true; 71831#fibo1EXIT >#45#return; 71825#L23-1 call #t~ret3 := fibo1(~n - 2);< 71830#fibo1ENTRY ~n := #in~n; 71842#L8 assume ~n < 1;#res := 0; 71838#fibo1FINAL assume true; 71824#fibo1EXIT >#47#return; 71828#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72198#fibo2FINAL assume true; 72196#fibo2EXIT >#49#return; 72193#L13-1 call #t~ret1 := fibo2(~n - 2);< 72194#fibo2ENTRY ~n := #in~n; 72199#L18 assume !(~n < 1); 72197#L20 assume 1 == ~n;#res := 1; 72195#fibo2FINAL assume true; 72192#fibo2EXIT >#51#return; 72191#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72190#fibo1FINAL assume true; 72174#fibo1EXIT >#45#return; 72139#L23-1 call #t~ret3 := fibo1(~n - 2);< 72142#fibo1ENTRY ~n := #in~n; 72189#L8 assume !(~n < 1); 72187#L10 assume !(1 == ~n); 72171#L13 call #t~ret0 := fibo2(~n - 1);< 72172#fibo2ENTRY ~n := #in~n; 72180#L18 assume !(~n < 1); 72179#L20 assume 1 == ~n;#res := 1; 72178#fibo2FINAL assume true; 72170#fibo2EXIT >#49#return; 72166#L13-1 call #t~ret1 := fibo2(~n - 2);< 72168#fibo2ENTRY ~n := #in~n; 72185#L18 assume ~n < 1;#res := 0; 72183#fibo2FINAL assume true; 72165#fibo2EXIT >#51#return; 72164#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72163#fibo1FINAL assume true; 72136#fibo1EXIT >#47#return; 72131#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72125#fibo2FINAL assume true; 72122#fibo2EXIT >#49#return; 72118#L13-1 call #t~ret1 := fibo2(~n - 2);< 72120#fibo2ENTRY ~n := #in~n; 72158#L18 assume !(~n < 1); 72156#L20 assume !(1 == ~n); 72134#L23 call #t~ret2 := fibo1(~n - 1);< 72135#fibo1ENTRY ~n := #in~n; 72188#L8 assume !(~n < 1); 72173#L10 assume !(1 == ~n); 72160#L13 call #t~ret0 := fibo2(~n - 1);< 72162#fibo2ENTRY ~n := #in~n; 72182#L18 assume !(~n < 1); 72181#L20 assume 1 == ~n;#res := 1; 72169#fibo2FINAL assume true; 72159#fibo2EXIT >#49#return; 72152#L13-1 call #t~ret1 := fibo2(~n - 2);< 72155#fibo2ENTRY ~n := #in~n; 72177#L18 assume ~n < 1;#res := 0; 72157#fibo2FINAL assume true; 72151#fibo2EXIT >#51#return; 72149#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72147#fibo1FINAL assume true; 72133#fibo1EXIT >#45#return; 72127#L23-1 call #t~ret3 := fibo1(~n - 2);< 72130#fibo1ENTRY ~n := #in~n; 72175#L8 assume !(~n < 1); 72143#L10 assume 1 == ~n;#res := 1; 72132#fibo1FINAL assume true; 72126#fibo1EXIT >#47#return; 72123#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72121#fibo2FINAL assume true; 72116#fibo2EXIT >#51#return; 71646#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72957#fibo1FINAL assume true; 71454#fibo1EXIT >#45#return; 71434#L23-1 call #t~ret3 := fibo1(~n - 2);< 71450#fibo1ENTRY ~n := #in~n; 71502#L8 assume !(~n < 1); 71503#L10 assume !(1 == ~n); 71432#L13 [2019-11-16 00:01:38,468 INFO L793 eck$LassoCheckResult]: Loop: 71432#L13 call #t~ret0 := fibo2(~n - 1);< 71435#fibo2ENTRY ~n := #in~n; 71462#L18 assume !(~n < 1); 71459#L20 assume !(1 == ~n); 71455#L23 call #t~ret2 := fibo1(~n - 1);< 71456#fibo1ENTRY ~n := #in~n; 71527#L8 assume !(~n < 1); 71526#L10 assume !(1 == ~n); 71523#L13 call #t~ret0 := fibo2(~n - 1);< 71525#fibo2ENTRY ~n := #in~n; 71552#L18 assume !(~n < 1); 71548#L20 assume !(1 == ~n); 71546#L23 call #t~ret2 := fibo1(~n - 1);< 71547#fibo1ENTRY ~n := #in~n; 71583#L8 assume !(~n < 1); 71580#L10 assume !(1 == ~n); 71576#L13 call #t~ret0 := fibo2(~n - 1);< 71577#fibo2ENTRY ~n := #in~n; 71584#L18 assume !(~n < 1); 71581#L20 assume !(1 == ~n); 71582#L23 call #t~ret2 := fibo1(~n - 1);< 71832#fibo1ENTRY ~n := #in~n; 71840#L8 assume !(~n < 1); 71836#L10 assume 1 == ~n;#res := 1; 71835#fibo1FINAL assume true; 71831#fibo1EXIT >#45#return; 71825#L23-1 call #t~ret3 := fibo1(~n - 2);< 71830#fibo1ENTRY ~n := #in~n; 71842#L8 assume ~n < 1;#res := 0; 71838#fibo1FINAL assume true; 71824#fibo1EXIT >#47#return; 71828#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72198#fibo2FINAL assume true; 72196#fibo2EXIT >#49#return; 72193#L13-1 call #t~ret1 := fibo2(~n - 2);< 72194#fibo2ENTRY ~n := #in~n; 72199#L18 assume !(~n < 1); 72197#L20 assume 1 == ~n;#res := 1; 72195#fibo2FINAL assume true; 72192#fibo2EXIT >#51#return; 72191#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72190#fibo1FINAL assume true; 72174#fibo1EXIT >#45#return; 72139#L23-1 call #t~ret3 := fibo1(~n - 2);< 72142#fibo1ENTRY ~n := #in~n; 72189#L8 assume !(~n < 1); 72187#L10 assume !(1 == ~n); 72171#L13 call #t~ret0 := fibo2(~n - 1);< 72172#fibo2ENTRY ~n := #in~n; 72180#L18 assume !(~n < 1); 72179#L20 assume 1 == ~n;#res := 1; 72178#fibo2FINAL assume true; 72170#fibo2EXIT >#49#return; 72166#L13-1 call #t~ret1 := fibo2(~n - 2);< 72168#fibo2ENTRY ~n := #in~n; 72185#L18 assume ~n < 1;#res := 0; 72183#fibo2FINAL assume true; 72165#fibo2EXIT >#51#return; 72164#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72163#fibo1FINAL assume true; 72136#fibo1EXIT >#47#return; 72131#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72125#fibo2FINAL assume true; 72122#fibo2EXIT >#49#return; 72118#L13-1 call #t~ret1 := fibo2(~n - 2);< 72120#fibo2ENTRY ~n := #in~n; 72158#L18 assume !(~n < 1); 72156#L20 assume !(1 == ~n); 72134#L23 call #t~ret2 := fibo1(~n - 1);< 72135#fibo1ENTRY ~n := #in~n; 72188#L8 assume !(~n < 1); 72173#L10 assume !(1 == ~n); 72160#L13 call #t~ret0 := fibo2(~n - 1);< 72162#fibo2ENTRY ~n := #in~n; 72182#L18 assume !(~n < 1); 72181#L20 assume 1 == ~n;#res := 1; 72169#fibo2FINAL assume true; 72159#fibo2EXIT >#49#return; 72152#L13-1 call #t~ret1 := fibo2(~n - 2);< 72155#fibo2ENTRY ~n := #in~n; 72177#L18 assume ~n < 1;#res := 0; 72157#fibo2FINAL assume true; 72151#fibo2EXIT >#51#return; 72149#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72147#fibo1FINAL assume true; 72133#fibo1EXIT >#45#return; 72127#L23-1 call #t~ret3 := fibo1(~n - 2);< 72130#fibo1ENTRY ~n := #in~n; 72175#L8 assume !(~n < 1); 72143#L10 assume 1 == ~n;#res := 1; 72132#fibo1FINAL assume true; 72126#fibo1EXIT >#47#return; 72123#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72121#fibo2FINAL assume true; 72116#fibo2EXIT >#51#return; 71646#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72957#fibo1FINAL assume true; 71454#fibo1EXIT >#45#return; 71434#L23-1 call #t~ret3 := fibo1(~n - 2);< 71450#fibo1ENTRY ~n := #in~n; 71502#L8 assume !(~n < 1); 71503#L10 assume !(1 == ~n); 71432#L13 [2019-11-16 00:01:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1387384655, now seen corresponding path program 4 times [2019-11-16 00:01:38,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:38,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65490553] [2019-11-16 00:01:38,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:38,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:38,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 463 proven. 260 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-16 00:01:38,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65490553] [2019-11-16 00:01:38,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424460137] [2019-11-16 00:01:38,912 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:39,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:01:39,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:01:39,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:01:39,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 398 proven. 239 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-11-16 00:01:39,256 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:39,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 28 [2019-11-16 00:01:39,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470675099] [2019-11-16 00:01:39,258 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:01:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2000726677, now seen corresponding path program 3 times [2019-11-16 00:01:39,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:39,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533831647] [2019-11-16 00:01:39,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:39,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:39,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:39,276 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:40,292 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:40,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:40,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:40,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:40,293 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:01:40,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:40,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:40,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:40,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration15_Loop [2019-11-16 00:01:40,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:40,293 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:40,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:40,297 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-16 00:01:40,299 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-16 00:01:40,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:40,303 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-16 00:01:40,313 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-16 00:01:40,315 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-16 00:01:40,317 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-16 00:01:40,319 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-16 00:01:40,366 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:40,366 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:40,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:40,376 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:40,380 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:40,380 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/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) [2019-11-16 00:01:40,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:40,390 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:40,394 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:40,394 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:01:40,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:40,401 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:40,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:40,405 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:01:40,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:40,416 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:40,420 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:01:40,420 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_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:01:40,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:01:40,427 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba076b5-e9aa-400e-8adf-e429b77e5f5f/bin/uautomizer/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:01:40,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:01:40,437 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:42,185 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:01:42,187 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:01:42,187 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:01:42,187 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:01:42,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:01:42,187 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:01:42,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:01:42,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:01:42,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:01:42,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration15_Loop [2019-11-16 00:01:42,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:01:42,188 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:01:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:42,190 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-16 00:01:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:42,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:42,194 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-16 00:01:42,196 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-16 00:01:42,201 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-16 00:01:42,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-16 00:01:42,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:01:42,258 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:01:42,259 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:01:42,259 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-16 00:01:42,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:42,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:42,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:42,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:42,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:42,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:42,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:42,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:42,261 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-16 00:01:42,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:42,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:42,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:42,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:42,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:42,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:42,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:42,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:42,263 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-16 00:01:42,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:42,263 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:42,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:42,263 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:42,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:42,264 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:42,264 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:42,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:42,264 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-16 00:01:42,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:42,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:42,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:42,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:42,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:42,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:42,266 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:42,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:42,266 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-16 00:01:42,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:42,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:42,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:42,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:42,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:42,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:42,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:42,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:01:42,268 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-16 00:01:42,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:01:42,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:01:42,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:01:42,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:01:42,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:01:42,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:01:42,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:01:42,274 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:01:42,276 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:01:42,276 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:01:42,276 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:01:42,277 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:01:42,277 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:01:42,277 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-16 00:01:42,277 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:01:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:42,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-16 00:01:42,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:42,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:42,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-16 00:01:42,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 31 proven. 131 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-16 00:01:42,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2019-11-16 00:01:42,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2698 states and 3097 transitions. cyclomatic complexity: 409 Second operand 15 states. [2019-11-16 00:01:43,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2698 states and 3097 transitions. cyclomatic complexity: 409. Second operand 15 states. Result 5897 states and 6736 transitions. Complement of second has 79 states. [2019-11-16 00:01:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-16 00:01:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:01:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2019-11-16 00:01:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 272 letters. Loop has 102 letters. [2019-11-16 00:01:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 374 letters. Loop has 102 letters. [2019-11-16 00:01:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 272 letters. Loop has 204 letters. [2019-11-16 00:01:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:01:43,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5897 states and 6736 transitions. [2019-11-16 00:01:43,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-16 00:01:43,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5897 states to 3928 states and 4485 transitions. [2019-11-16 00:01:43,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-11-16 00:01:43,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2019-11-16 00:01:43,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3928 states and 4485 transitions. [2019-11-16 00:01:43,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:01:43,897 INFO L688 BuchiCegarLoop]: Abstraction has 3928 states and 4485 transitions. [2019-11-16 00:01:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states and 4485 transitions. [2019-11-16 00:01:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3899. [2019-11-16 00:01:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-11-16 00:01:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 4454 transitions. [2019-11-16 00:01:43,985 INFO L711 BuchiCegarLoop]: Abstraction has 3899 states and 4454 transitions. [2019-11-16 00:01:43,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:01:43,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:01:43,986 INFO L87 Difference]: Start difference. First operand 3899 states and 4454 transitions. Second operand 28 states. [2019-11-16 00:01:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:45,320 INFO L93 Difference]: Finished difference Result 2470 states and 2702 transitions. [2019-11-16 00:01:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:01:45,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2470 states and 2702 transitions. [2019-11-16 00:01:45,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:01:45,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2470 states to 0 states and 0 transitions. [2019-11-16 00:01:45,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:01:45,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:01:45,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:01:45,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:01:45,339 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:01:45,340 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:01:45,340 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:01:45,340 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:01:45,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:01:45,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:01:45,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:01:45,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:01:45 BoogieIcfgContainer [2019-11-16 00:01:45,353 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:01:45,354 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:01:45,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:01:45,354 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:01:45,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:00" (3/4) ... [2019-11-16 00:01:45,362 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:01:45,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:01:45,364 INFO L168 Benchmark]: Toolchain (without parser) took 45141.88 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 944.7 MB in the beginning and 778.5 MB in the end (delta: 166.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:01:45,365 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:01:45,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:01:45,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.83 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-16 00:01:45,366 INFO L168 Benchmark]: Boogie Preprocessor took 16.95 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-16 00:01:45,367 INFO L168 Benchmark]: RCFGBuilder took 303.83 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:01:45,367 INFO L168 Benchmark]: BuchiAutomizer took 44519.44 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 948.4 MB). Free memory was 1.1 GB in the beginning and 778.5 MB in the end (delta: 303.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:01:45,367 INFO L168 Benchmark]: Witness Printer took 8.89 ms. Allocated memory is still 2.1 GB. Free memory is still 778.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:01:45,370 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.83 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 16.95 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. * RCFGBuilder took 303.83 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44519.44 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 948.4 MB). Free memory was 1.1 GB in the beginning and 778.5 MB in the end (delta: 303.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 8.89 ms. Allocated memory is still 2.1 GB. Free memory is still 778.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 21 terminating modules (14 trivial, 3 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 deterministic module has affine ranking function n and consists of 17 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 14 locations. One nondeterministic module has affine ranking function n and consists of 14 locations. 14 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.4s and 16 iterations. TraceHistogramMax:48. Analysis of lassos took 24.3s. Construction of modules took 6.9s. Büchi inclusion checks took 11.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 20. Automata minimization 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1844 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 2767 states and ocurred in iteration 13. Nontrivial modules had stage [3, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 200/391 HoareTripleCheckerStatistics: 733 SDtfs, 1863 SDslu, 3574 SDs, 0 SdLazy, 8969 SolverSat, 1546 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI8 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf99 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq199 hnf90 smp92 dnf100 smp100 tf109 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 30 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...