./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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:20,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:20,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:20,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:20,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:20,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:20,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:20,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:20,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:20,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:20,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:20,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:20,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:20,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:20,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:20,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:20,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:20,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:20,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:20,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:20,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:20,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:20,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:20,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:20,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:20,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:20,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:20,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:20,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:20,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:20,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:20,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:20,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:20,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:20,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:20,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:20,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:20,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:20,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:20,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:20,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:20,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:20,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:20,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:20,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:20,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:20,480 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:20,480 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:20,480 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:20,480 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:20,480 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:20,480 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:20,480 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:20,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:20,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:20,481 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:20,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:20,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:20,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:20,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:20,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:20,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:20,488 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:20,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:20,488 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:20,488 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:20,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:20,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:20,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:20,489 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:20,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:20,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:20,490 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:20,491 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:20,491 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:20,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:20,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:20,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:20,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:20,537 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:20,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-10-22 09:00:20,586 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/data/ee01e4de7/08fe4e91d06c417698351b5dcb1a1086/FLAGf8a5b0243 [2019-10-22 09:00:20,962 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:20,962 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-10-22 09:00:20,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/data/ee01e4de7/08fe4e91d06c417698351b5dcb1a1086/FLAGf8a5b0243 [2019-10-22 09:00:20,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/data/ee01e4de7/08fe4e91d06c417698351b5dcb1a1086 [2019-10-22 09:00:20,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:20,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:20,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:20,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:20,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:20,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:20" (1/1) ... [2019-10-22 09:00:20,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56110345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:20, skipping insertion in model container [2019-10-22 09:00:20,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:20" (1/1) ... [2019-10-22 09:00:20,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:21,012 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:21,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:21,145 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:21,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:21,230 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:21,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21 WrapperNode [2019-10-22 09:00:21,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:21,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:21,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:21,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:21,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:21,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:21,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:21,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:21,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... [2019-10-22 09:00:21,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:21,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:21,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:21,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:21,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:21,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:21,351 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-10-22 09:00:21,351 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-10-22 09:00:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-10-22 09:00:21,352 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-10-22 09:00:21,561 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:21,561 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 09:00:21,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:21 BoogieIcfgContainer [2019-10-22 09:00:21,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:21,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:21,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:21,573 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:21,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:21,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:20" (1/3) ... [2019-10-22 09:00:21,575 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@423de86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:21, skipping insertion in model container [2019-10-22 09:00:21,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:21,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:21" (2/3) ... [2019-10-22 09:00:21,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@423de86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:21, skipping insertion in model container [2019-10-22 09:00:21,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:21,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:21" (3/3) ... [2019-10-22 09:00:21,590 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-1.c [2019-10-22 09:00:21,675 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:21,687 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:21,688 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:21,688 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:21,688 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:21,688 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:21,688 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:21,688 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:21,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-10-22 09:00:21,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:21,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:21,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:21,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:21,762 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,762 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:21,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-10-22 09:00:21,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:21,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:21,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:21,766 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:21,766 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,775 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-10-22 09:00:21,775 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-10-22 09:00:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-10-22 09:00:21,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228659348] [2019-10-22 09:00:21,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:21,900 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-10-22 09:00:21,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184381489] [2019-10-22 09:00:21,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:21,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-10-22 09:00:21,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19157537] [2019-10-22 09:00:21,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:21,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:22,112 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:22,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:22,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:22,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:22,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:22,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:22,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:22,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:22,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-10-22 09:00:22,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:22,117 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:22,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-10-22 09:00:22,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:22,256 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,270 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-10-22 09:00:22,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,281 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:22,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,293 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:22,299 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,299 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,308 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-10-22 09:00:22,316 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,316 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:22,335 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,335 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,344 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-10-22 09:00:22,349 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,349 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:22,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,358 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:22,365 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,365 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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) [2019-10-22 09:00:22,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,380 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:22,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,388 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:22,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,409 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:22,420 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:22,421 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:22,434 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:22,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:22,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:22,496 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:22,497 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:22,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:22,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:22,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:22,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:22,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:22,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:22,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:22,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-10-22 09:00:22,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:22,498 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:22,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,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-10-22 09:00:22,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:22,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:22,596 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:22,598 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-10-22 09:00:22,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,602 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,607 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-10-22 09:00:22,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,608 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,609 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,610 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-10-22 09:00:22,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,612 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,614 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-10-22 09:00:22,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,618 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-10-22 09:00:22,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,618 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:22,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,625 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-10-22 09:00:22,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,628 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-10-22 09:00:22,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:22,632 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-10-22 09:00:22,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:22,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:22,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:22,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:22,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:22,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:22,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:22,640 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:22,645 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:22,645 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:22,647 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:22,647 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:22,648 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:22,648 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-10-22 09:00:22,651 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:22,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:22,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:22,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:22,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:22,799 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-10-22 09:00:22,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-10-22 09:00:23,062 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-10-22 09:00:23,066 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-10-22 09:00:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-10-22 09:00:23,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 09:00:23,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:23,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 09:00:23,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:23,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-10-22 09:00:23,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:23,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-10-22 09:00:23,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:23,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-10-22 09:00:23,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-10-22 09:00:23,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-10-22 09:00:23,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-10-22 09:00:23,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:23,112 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-10-22 09:00:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-10-22 09:00:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-10-22 09:00:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 09:00:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-10-22 09:00:23,150 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-10-22 09:00:23,150 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-10-22 09:00:23,151 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:23,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-10-22 09:00:23,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:23,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:23,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:23,154 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:23,154 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:23,154 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-10-22 09:00:23,155 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-10-22 09:00:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-10-22 09:00:23,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:23,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893009105] [2019-10-22 09:00:23,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:23,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893009105] [2019-10-22 09:00:23,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176699165] [2019-10-22 09:00:23,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:23,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:23,338 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:23,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-22 09:00:23,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818925757] [2019-10-22 09:00:23,341 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-10-22 09:00:23,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:23,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235429819] [2019-10-22 09:00:23,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:23,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235429819] [2019-10-22 09:00:23,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:23,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:23,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133815017] [2019-10-22 09:00:23,388 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:23,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:23,393 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-10-22 09:00:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:23,476 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-10-22 09:00:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:00:23,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-10-22 09:00:23,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:23,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-10-22 09:00:23,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-10-22 09:00:23,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-10-22 09:00:23,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-10-22 09:00:23,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:23,488 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-10-22 09:00:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-10-22 09:00:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-10-22 09:00:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 09:00:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-10-22 09:00:23,504 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-10-22 09:00:23,504 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-10-22 09:00:23,504 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:23,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-10-22 09:00:23,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:23,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:23,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:23,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:23,510 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:23,510 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-10-22 09:00:23,510 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-10-22 09:00:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-10-22 09:00:23,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:23,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210365582] [2019-10-22 09:00:23,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:23,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210365582] [2019-10-22 09:00:23,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142560963] [2019-10-22 09:00:23,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:23,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:23,642 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:23,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-22 09:00:23,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621061984] [2019-10-22 09:00:23,643 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-10-22 09:00:23,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:23,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925794854] [2019-10-22 09:00:23,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:23,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:23,866 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:23,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:23,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:23,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:23,867 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:23,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:23,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:23,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:23,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-10-22 09:00:23,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:23,868 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:23,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:23,939 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:23,939 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:23,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:23,950 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-10-22 09:00:23,957 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:23,957 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:23,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:23,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:23,969 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:23,970 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:23,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:23,978 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:23,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:23,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:24,793 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:24,795 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:24,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:24,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:24,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:24,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:24,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:24,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:24,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:24,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-10-22 09:00:24,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:24,796 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:24,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,867 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:24,867 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:24,868 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-10-22 09:00:24,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:24,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:24,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:24,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:24,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:24,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:24,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:24,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:24,873 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-10-22 09:00:24,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:24,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:24,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:24,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:24,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:24,875 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:24,875 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:24,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:24,876 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-10-22 09:00:24,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:24,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:24,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:24,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:24,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:24,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:24,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:24,883 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:24,887 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:24,887 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:24,887 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:24,887 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:24,888 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:24,888 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-10-22 09:00:24,888 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:24,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 09:00:24,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:25,032 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-10-22 09:00:25,032 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-10-22 09:00:25,353 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-10-22 09:00:25,354 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-10-22 09:00:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 09:00:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-10-22 09:00:25,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-10-22 09:00:25,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:25,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-10-22 09:00:25,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:25,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-10-22 09:00:25,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:25,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-10-22 09:00:25,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:25,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-10-22 09:00:25,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-10-22 09:00:25,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-10-22 09:00:25,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-10-22 09:00:25,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:25,373 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-10-22 09:00:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-10-22 09:00:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-10-22 09:00:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-22 09:00:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-10-22 09:00:25,395 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-10-22 09:00:25,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:25,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:25,396 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-10-22 09:00:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:25,536 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-10-22 09:00:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:25,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-10-22 09:00:25,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:25,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-10-22 09:00:25,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-10-22 09:00:25,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-10-22 09:00:25,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-10-22 09:00:25,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:25,546 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-10-22 09:00:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-10-22 09:00:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-10-22 09:00:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-22 09:00:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-10-22 09:00:25,565 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-10-22 09:00:25,565 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-10-22 09:00:25,565 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:25,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-10-22 09:00:25,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:25,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:25,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:25,571 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-10-22 09:00:25,571 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-10-22 09:00:25,571 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~ret1;havoc #t~ret0; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 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~ret1;havoc #t~ret0; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-10-22 09:00:25,572 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~ret1;havoc #t~ret0; 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~ret1;havoc #t~ret0; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-10-22 09:00:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-10-22 09:00:25,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:25,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267573645] [2019-10-22 09:00:25,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 89 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-22 09:00:25,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267573645] [2019-10-22 09:00:25,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930024586] [2019-10-22 09:00:25,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:00:25,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-22 09:00:26,070 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:26,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-10-22 09:00:26,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203771478] [2019-10-22 09:00:26,071 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-10-22 09:00:26,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876102861] [2019-10-22 09:00:26,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-22 09:00:26,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876102861] [2019-10-22 09:00:26,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118311267] [2019-10-22 09:00:26,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:26,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:00:26,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:26,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-10-22 09:00:26,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703583413] [2019-10-22 09:00:26,273 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:26,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:00:26,274 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-10-22 09:00:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:26,325 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-10-22 09:00:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:00:26,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-10-22 09:00:26,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:26,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-10-22 09:00:26,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-10-22 09:00:26,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-10-22 09:00:26,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-10-22 09:00:26,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:26,340 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-10-22 09:00:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-10-22 09:00:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-10-22 09:00:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-22 09:00:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-10-22 09:00:26,353 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-10-22 09:00:26,353 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-10-22 09:00:26,353 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:26,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-10-22 09:00:26,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:26,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:26,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:26,359 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-10-22 09:00:26,359 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-10-22 09:00:26,359 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~ret1;havoc #t~ret0; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 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~ret1;havoc #t~ret0; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-10-22 09:00:26,360 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~ret1;havoc #t~ret0; 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~ret1;havoc #t~ret0; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-10-22 09:00:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-10-22 09:00:26,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961920795] [2019-10-22 09:00:26,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-22 09:00:26,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961920795] [2019-10-22 09:00:26,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085410058] [2019-10-22 09:00:26,676 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:26,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:26,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:26,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:00:26,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:00:26,844 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:26,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-10-22 09:00:26,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114604032] [2019-10-22 09:00:26,845 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-10-22 09:00:26,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929822792] [2019-10-22 09:00:26,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-22 09:00:26,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929822792] [2019-10-22 09:00:26,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528490239] [2019-10-22 09:00:26,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:00:27,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 09:00:27,123 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:27,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-10-22 09:00:27,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571880312] [2019-10-22 09:00:27,124 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:27,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:00:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:27,125 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-10-22 09:00:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:27,370 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-10-22 09:00:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:00:27,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-10-22 09:00:27,373 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-10-22 09:00:27,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-10-22 09:00:27,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-10-22 09:00:27,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-10-22 09:00:27,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-10-22 09:00:27,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:27,376 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-10-22 09:00:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-10-22 09:00:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-10-22 09:00:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 09:00:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-10-22 09:00:27,383 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-10-22 09:00:27,383 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-10-22 09:00:27,383 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:27,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-10-22 09:00:27,384 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-10-22 09:00:27,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:27,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:27,385 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-10-22 09:00:27,385 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:27,385 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~ret1;havoc #t~ret0; 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-10-22 09:00:27,386 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-10-22 09:00:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-10-22 09:00:27,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350071514] [2019-10-22 09:00:27,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:27,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350071514] [2019-10-22 09:00:27,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140318277] [2019-10-22 09:00:27,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:27,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:27,684 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:27,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-10-22 09:00:27,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121754225] [2019-10-22 09:00:27,684 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-10-22 09:00:27,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577152547] [2019-10-22 09:00:27,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,691 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:27,782 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:27,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:27,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:27,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:27,782 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:27,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:27,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:27,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:27,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-10-22 09:00:27,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:27,783 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:27,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:27,860 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:27,870 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:27,870 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:27,878 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:27,878 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:27,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:27,893 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:27,901 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:27,901 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:27,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:27,908 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:27,914 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:27,915 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:27,919 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:27,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:27,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:28,772 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:28,774 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:28,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:28,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:28,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:28,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:28,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:28,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:28,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-10-22 09:00:28,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:28,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:28,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,839 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:28,839 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:28,840 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-10-22 09:00:28,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,841 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,842 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-10-22 09:00:28,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,843 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,843 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,848 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-10-22 09:00:28,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,850 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-10-22 09:00:28,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,864 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-10-22 09:00:28,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,866 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-10-22 09:00:28,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,867 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,868 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-10-22 09:00:28,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,871 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:28,875 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:28,876 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:28,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:28,877 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:28,877 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:28,877 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-10-22 09:00:28,878 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:28,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:29,032 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-10-22 09:00:29,032 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-10-22 09:00:29,133 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-10-22 09:00:29,134 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-10-22 09:00:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:00:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-10-22 09:00:29,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-10-22 09:00:29,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,135 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:29,250 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-10-22 09:00:29,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-10-22 09:00:29,394 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-10-22 09:00:29,398 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-10-22 09:00:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:00:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-10-22 09:00:29,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-10-22 09:00:29,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,399 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:29,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:29,550 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-10-22 09:00:29,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-10-22 09:00:29,682 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-10-22 09:00:29,682 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-10-22 09:00:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:00:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-10-22 09:00:29,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-10-22 09:00:29,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-10-22 09:00:29,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-10-22 09:00:29,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-10-22 09:00:29,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-10-22 09:00:29,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-10-22 09:00:29,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-10-22 09:00:29,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-10-22 09:00:29,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-10-22 09:00:29,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:29,695 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-10-22 09:00:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-10-22 09:00:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-10-22 09:00:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-22 09:00:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-10-22 09:00:29,704 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-10-22 09:00:29,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:00:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:29,704 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-10-22 09:00:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:29,985 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-10-22 09:00:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:00:29,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-10-22 09:00:29,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-10-22 09:00:29,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-10-22 09:00:29,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-10-22 09:00:29,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-10-22 09:00:29,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-10-22 09:00:29,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:29,992 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-10-22 09:00:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-10-22 09:00:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-10-22 09:00:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 09:00:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-10-22 09:00:29,998 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-10-22 09:00:29,998 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-10-22 09:00:29,998 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:29,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-10-22 09:00:29,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-10-22 09:00:29,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:29,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:30,000 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-10-22 09:00:30,000 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-10-22 09:00:30,001 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~ret1;havoc #t~ret0; 5257#fibo1FINAL assume true; 5249#fibo1EXIT >#45#return; 5237#L23-1 call #t~ret3 := fibo1(~n - 2);< 5242#fibo1ENTRY ~n := #in~n; 5258#L8 assume ~n < 1;#res := 0; 5238#fibo1FINAL assume true; 5253#fibo1EXIT >#47#return; 5247#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-10-22 09:00:30,001 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~ret3;havoc #t~ret2; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-10-22 09:00:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-10-22 09:00:30,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48574088] [2019-10-22 09:00:30,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:30,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48574088] [2019-10-22 09:00:30,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422874560] [2019-10-22 09:00:30,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:00:30,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:00:30,235 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:30,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-10-22 09:00:30,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526044809] [2019-10-22 09:00:30,236 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-10-22 09:00:30,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370712273] [2019-10-22 09:00:30,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:30,454 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:30,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:30,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:30,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:30,455 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:30,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:30,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:30,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:30,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-10-22 09:00:30,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:30,455 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:30,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:30,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:30,513 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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) [2019-10-22 09:00:30,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:30,517 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:30,521 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:30,521 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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) [2019-10-22 09:00:30,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:30,528 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:30,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:30,531 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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) [2019-10-22 09:00:30,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:30,540 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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) [2019-10-22 09:00:30,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:30,551 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:31,218 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:31,219 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:31,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:31,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:31,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:31,220 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:31,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:31,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:31,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:31,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-10-22 09:00:31,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:31,220 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:31,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:31,260 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:31,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-10-22 09:00:31,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,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-10-22 09:00:31,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,263 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,264 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,264 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,265 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-10-22 09:00:31,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,266 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,266 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,268 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:31,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:31,270 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:31,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:31,270 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:31,270 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:31,271 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-10-22 09:00:31,271 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:00:31,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:31,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 09:00:31,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:31,446 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-10-22 09:00:31,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-10-22 09:00:31,737 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-10-22 09:00:31,738 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-10-22 09:00:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-10-22 09:00:31,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-10-22 09:00:31,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:31,740 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:00:31,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:31,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 09:00:31,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:31,902 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-10-22 09:00:31,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-10-22 09:00:32,108 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-10-22 09:00:32,109 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-10-22 09:00:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-10-22 09:00:32,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-10-22 09:00:32,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:32,110 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:00:32,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:32,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:32,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:32,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:32,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 09:00:32,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:32,277 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-10-22 09:00:32,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-10-22 09:00:32,571 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-10-22 09:00:32,574 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-10-22 09:00:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-10-22 09:00:32,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-10-22 09:00:32,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:32,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-10-22 09:00:32,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:32,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-10-22 09:00:32,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:32,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-10-22 09:00:32,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-10-22 09:00:32,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-10-22 09:00:32,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-10-22 09:00:32,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-10-22 09:00:32,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-10-22 09:00:32,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:32,592 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-10-22 09:00:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-10-22 09:00:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-10-22 09:00:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-10-22 09:00:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-10-22 09:00:32,606 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-10-22 09:00:32,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 09:00:32,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:00:32,607 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-10-22 09:00:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:32,978 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-10-22 09:00:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 09:00:32,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-10-22 09:00:32,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:32,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-10-22 09:00:32,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-10-22 09:00:32,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-10-22 09:00:32,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-10-22 09:00:32,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:32,990 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-10-22 09:00:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-10-22 09:00:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-10-22 09:00:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-22 09:00:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-10-22 09:00:33,003 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-10-22 09:00:33,003 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-10-22 09:00:33,003 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:33,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-10-22 09:00:33,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:33,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:33,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:33,008 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-10-22 09:00:33,008 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-10-22 09:00:33,008 INFO L791 eck$LassoCheckResult]: Stem: 8604#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8567#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8568#fibo1ENTRY ~n := #in~n; 8646#L8 assume !(~n < 1); 8645#L10 assume !(1 == ~n); 8637#L13 call #t~ret0 := fibo2(~n - 1);< 8644#fibo2ENTRY ~n := #in~n; 8643#L18 assume !(~n < 1); 8642#L20 assume !(1 == ~n); 8639#L23 call #t~ret2 := fibo1(~n - 1);< 8641#fibo1ENTRY ~n := #in~n; 8640#L8 assume !(~n < 1); 8638#L10 assume !(1 == ~n); 8631#L13 call #t~ret0 := fibo2(~n - 1);< 8636#fibo2ENTRY ~n := #in~n; 8635#L18 assume !(~n < 1); 8633#L20 assume !(1 == ~n); 8577#L23 call #t~ret2 := fibo1(~n - 1);< 8627#fibo1ENTRY ~n := #in~n; 8628#L8 assume !(~n < 1); 8722#L10 assume !(1 == ~n); 8632#L13 call #t~ret0 := fibo2(~n - 1);< 8636#fibo2ENTRY ~n := #in~n; 8635#L18 assume !(~n < 1); 8633#L20 assume !(1 == ~n); 8577#L23 call #t~ret2 := fibo1(~n - 1);< 8627#fibo1ENTRY ~n := #in~n; 8625#L8 assume !(~n < 1); 8626#L10 assume !(1 == ~n); 8576#L13 call #t~ret0 := fibo2(~n - 1);< 8578#fibo2ENTRY ~n := #in~n; 8824#L18 assume !(~n < 1); 8823#L20 assume 1 == ~n;#res := 1; 8822#fibo2FINAL assume true; 8819#fibo2EXIT >#49#return; 8815#L13-1 call #t~ret1 := fibo2(~n - 2);< 8816#fibo2ENTRY ~n := #in~n; 8821#L18 assume ~n < 1;#res := 0; 8818#fibo2FINAL assume true; 8814#fibo2EXIT >#51#return; 8813#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8812#fibo1FINAL assume true; 8809#fibo1EXIT >#45#return; 8806#L23-1 call #t~ret3 := fibo1(~n - 2);< 8807#fibo1ENTRY ~n := #in~n; 8845#L8 assume ~n < 1;#res := 0; 8844#fibo1FINAL assume true; 8805#fibo1EXIT >#47#return; 8802#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8800#fibo2FINAL assume true; 8719#fibo2EXIT >#49#return; 8669#L13-1 [2019-10-22 09:00:33,008 INFO L793 eck$LassoCheckResult]: Loop: 8669#L13-1 call #t~ret1 := fibo2(~n - 2);< 8595#fibo2ENTRY ~n := #in~n; 8693#L18 assume !(~n < 1); 8689#L20 assume !(1 == ~n); 8594#L23 call #t~ret2 := fibo1(~n - 1);< 8671#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8749#fibo2ENTRY ~n := #in~n; 8792#L18 assume !(~n < 1); 8787#L20 assume !(1 == ~n); 8788#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8855#L8 assume !(~n < 1); 8854#L10 assume 1 == ~n;#res := 1; 8853#fibo1FINAL assume true; 8852#fibo1EXIT >#45#return; 8560#L23-1 call #t~ret3 := fibo1(~n - 2);< 8556#fibo1ENTRY ~n := #in~n; 8613#L8 assume ~n < 1;#res := 0; 8562#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8653#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8847#fibo2FINAL assume true; 8748#fibo2EXIT >#49#return; 8741#L13-1 call #t~ret1 := fibo2(~n - 2);< 8742#fibo2ENTRY ~n := #in~n; 8782#L18 assume ~n < 1;#res := 0; 8772#fibo2FINAL assume true; 8766#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8708#fibo1FINAL assume true; 8709#fibo1EXIT >#45#return; 8622#L23-1 call #t~ret3 := fibo1(~n - 2);< 8629#fibo1ENTRY ~n := #in~n; 8630#L8 assume !(~n < 1); 8620#L10 assume !(1 == ~n); 8624#L13 call #t~ret0 := fibo2(~n - 1);< 8698#fibo2ENTRY ~n := #in~n; 8692#L18 assume !(~n < 1); 8687#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8667#fibo1ENTRY ~n := #in~n; 8780#L8 assume !(~n < 1); 8777#L10 assume 1 == ~n;#res := 1; 8774#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8744#L23-1 call #t~ret3 := fibo1(~n - 2);< 8747#fibo1ENTRY ~n := #in~n; 8803#L8 assume ~n < 1;#res := 0; 8801#fibo1FINAL assume true; 8743#fibo1EXIT >#47#return; 8738#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 8726#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8669#L13-1 [2019-10-22 09:00:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-10-22 09:00:33,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156520070] [2019-10-22 09:00:33,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:00:33,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156520070] [2019-10-22 09:00:33,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208558640] [2019-10-22 09:00:33,173 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:33,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:33,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:33,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:33,285 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:33,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-10-22 09:00:33,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052105130] [2019-10-22 09:00:33,286 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash -564433099, now seen corresponding path program 1 times [2019-10-22 09:00:33,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567002900] [2019-10-22 09:00:33,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-22 09:00:33,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567002900] [2019-10-22 09:00:33,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285423144] [2019-10-22 09:00:33,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:00:33,513 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:33,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-10-22 09:00:33,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785084046] [2019-10-22 09:00:33,513 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:33,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:33,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-22 09:00:33,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-22 09:00:33,514 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-10-22 09:00:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:33,911 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-10-22 09:00:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 09:00:33,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-10-22 09:00:33,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:33,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-10-22 09:00:33,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-10-22 09:00:33,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-10-22 09:00:33,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-10-22 09:00:33,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:33,920 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-10-22 09:00:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-10-22 09:00:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-10-22 09:00:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-22 09:00:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-10-22 09:00:33,934 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-10-22 09:00:33,934 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-10-22 09:00:33,934 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:33,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-10-22 09:00:33,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:33,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:33,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:33,939 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-10-22 09:00:33,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:33,939 INFO L791 eck$LassoCheckResult]: Stem: 10062#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 10007#L37 call main_#t~ret4 := fibo1(main_~x~0);< 10008#fibo1ENTRY ~n := #in~n; 10249#L8 assume !(~n < 1); 10238#L10 assume !(1 == ~n); 10225#L13 call #t~ret0 := fibo2(~n - 1);< 10252#fibo2ENTRY ~n := #in~n; 10251#L18 assume !(~n < 1); 10250#L20 assume !(1 == ~n); 10230#L23 call #t~ret2 := fibo1(~n - 1);< 10248#fibo1ENTRY ~n := #in~n; 10241#L8 assume !(~n < 1); 10242#L10 assume !(1 == ~n); 10005#L13 call #t~ret0 := fibo2(~n - 1);< 10231#fibo2ENTRY ~n := #in~n; 10299#L18 assume !(~n < 1); 10295#L20 assume !(1 == ~n); 10004#L23 call #t~ret2 := fibo1(~n - 1);< 10006#fibo1ENTRY ~n := #in~n; 10065#L8 assume !(~n < 1); 10398#L10 assume !(1 == ~n); 10001#L13 call #t~ret0 := fibo2(~n - 1);< 10229#fibo2ENTRY ~n := #in~n; 10247#L18 assume !(~n < 1); 10246#L20 assume !(1 == ~n); 10000#L23 call #t~ret2 := fibo1(~n - 1);< 10003#fibo1ENTRY ~n := #in~n; 10445#L8 assume !(~n < 1); 10443#L10 assume 1 == ~n;#res := 1; 10442#fibo1FINAL assume true; 10441#fibo1EXIT >#45#return; 10439#L23-1 call #t~ret3 := fibo1(~n - 2);< 10023#fibo1ENTRY ~n := #in~n; 10446#L8 assume !(~n < 1); 10447#L10 assume 1 == ~n;#res := 1; 10456#fibo1FINAL assume true; 10452#fibo1EXIT >#47#return; 10418#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10416#fibo2FINAL assume true; 10415#fibo2EXIT >#49#return; 10149#L13-1 call #t~ret1 := fibo2(~n - 2);< 10047#fibo2ENTRY ~n := #in~n; 10155#L18 assume !(~n < 1); 10146#L20 assume !(1 == ~n); 10107#L23 [2019-10-22 09:00:33,939 INFO L793 eck$LassoCheckResult]: Loop: 10107#L23 call #t~ret2 := fibo1(~n - 1);< 10118#fibo1ENTRY ~n := #in~n; 10114#L8 assume !(~n < 1); 10112#L10 assume !(1 == ~n); 10072#L13 call #t~ret0 := fibo2(~n - 1);< 10108#fibo2ENTRY ~n := #in~n; 10217#L18 assume !(~n < 1); 10216#L20 assume !(1 == ~n); 10165#L23 call #t~ret2 := fibo1(~n - 1);< 10169#fibo1ENTRY ~n := #in~n; 10181#L8 assume !(~n < 1); 10180#L10 assume 1 == ~n;#res := 1; 10173#fibo1FINAL assume true; 10163#fibo1EXIT >#45#return; 10041#L23-1 call #t~ret3 := fibo1(~n - 2);< 10025#fibo1ENTRY ~n := #in~n; 10213#L8 assume !(~n < 1); 10215#L10 assume 1 == ~n;#res := 1; 10040#fibo1FINAL assume true; 10043#fibo1EXIT >#47#return; 10106#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 10208#fibo2FINAL assume true; 10209#fibo2EXIT >#49#return; 10074#L13-1 call #t~ret1 := fibo2(~n - 2);< 10047#fibo2ENTRY ~n := #in~n; 10155#L18 assume !(~n < 1); 10146#L20 assume !(1 == ~n); 10107#L23 [2019-10-22 09:00:33,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-10-22 09:00:33,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901854606] [2019-10-22 09:00:33,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:00:34,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901854606] [2019-10-22 09:00:34,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169125809] [2019-10-22 09:00:34,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:34,343 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:34,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-10-22 09:00:34,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159608028] [2019-10-22 09:00:34,343 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash 781356392, now seen corresponding path program 1 times [2019-10-22 09:00:34,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112275497] [2019-10-22 09:00:34,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 09:00:34,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112275497] [2019-10-22 09:00:34,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186150059] [2019-10-22 09:00:34,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:34,543 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:34,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2019-10-22 09:00:34,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951188230] [2019-10-22 09:00:34,544 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:34,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 09:00:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:00:34,544 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-10-22 09:00:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:34,635 INFO L93 Difference]: Finished difference Result 500 states and 653 transitions. [2019-10-22 09:00:34,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:34,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 653 transitions. [2019-10-22 09:00:34,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:34,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 490 states and 642 transitions. [2019-10-22 09:00:34,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2019-10-22 09:00:34,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2019-10-22 09:00:34,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 490 states and 642 transitions. [2019-10-22 09:00:34,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:34,646 INFO L688 BuchiCegarLoop]: Abstraction has 490 states and 642 transitions. [2019-10-22 09:00:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states and 642 transitions. [2019-10-22 09:00:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2019-10-22 09:00:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-10-22 09:00:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 624 transitions. [2019-10-22 09:00:34,660 INFO L711 BuchiCegarLoop]: Abstraction has 478 states and 624 transitions. [2019-10-22 09:00:34,660 INFO L591 BuchiCegarLoop]: Abstraction has 478 states and 624 transitions. [2019-10-22 09:00:34,660 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:34,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 624 transitions. [2019-10-22 09:00:34,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:34,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:34,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:34,664 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:34,664 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-10-22 09:00:34,665 INFO L791 eck$LassoCheckResult]: Stem: 11351#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 11312#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11314#fibo1ENTRY ~n := #in~n; 11657#L8 assume !(~n < 1); 11311#L10 assume !(1 == ~n); 11313#L13 call #t~ret0 := fibo2(~n - 1);< 11521#fibo2ENTRY ~n := #in~n; 11548#L18 assume !(~n < 1); 11547#L20 assume !(1 == ~n); 11543#L23 call #t~ret2 := fibo1(~n - 1);< 11546#fibo1ENTRY ~n := #in~n; 11545#L8 assume !(~n < 1); 11544#L10 assume !(1 == ~n); 11327#L13 call #t~ret0 := fibo2(~n - 1);< 11542#fibo2ENTRY ~n := #in~n; 11541#L18 assume !(~n < 1); 11540#L20 assume !(1 == ~n); 11522#L23 call #t~ret2 := fibo1(~n - 1);< 11539#fibo1ENTRY ~n := #in~n; 11527#L8 assume !(~n < 1); 11528#L10 assume !(1 == ~n); 11516#L13 call #t~ret0 := fibo2(~n - 1);< 11523#fibo2ENTRY ~n := #in~n; 11538#L18 assume !(~n < 1); 11536#L20 assume !(1 == ~n); 11337#L23 call #t~ret2 := fibo1(~n - 1);< 11529#fibo1ENTRY ~n := #in~n; 11526#L8 assume !(~n < 1); 11524#L10 assume !(1 == ~n); 11336#L13 call #t~ret0 := fibo2(~n - 1);< 11338#fibo2ENTRY ~n := #in~n; 11739#L18 assume !(~n < 1); 11730#L20 assume 1 == ~n;#res := 1; 11728#fibo2FINAL assume true; 11720#fibo2EXIT >#49#return; 11353#L13-1 call #t~ret1 := fibo2(~n - 2);< 11352#fibo2ENTRY ~n := #in~n; 11354#L18 assume ~n < 1;#res := 0; 11371#fibo2FINAL assume true; 11718#fibo2EXIT >#51#return; 11716#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 11715#fibo1FINAL assume true; 11713#fibo1EXIT >#45#return; 11710#L23-1 call #t~ret3 := fibo1(~n - 2);< 11711#fibo1ENTRY ~n := #in~n; 11721#L8 assume !(~n < 1); 11719#L10 assume 1 == ~n;#res := 1; 11717#fibo1FINAL assume true; 11709#fibo1EXIT >#47#return; 11708#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11707#fibo2FINAL assume true; 11706#fibo2EXIT >#49#return; 11316#L13-1 call #t~ret1 := fibo2(~n - 2);< 11345#fibo2ENTRY ~n := #in~n; 11677#L18 assume !(~n < 1); 11443#L20 assume !(1 == ~n); 11403#L23 [2019-10-22 09:00:34,665 INFO L793 eck$LassoCheckResult]: Loop: 11403#L23 call #t~ret2 := fibo1(~n - 1);< 11413#fibo1ENTRY ~n := #in~n; 11410#L8 assume !(~n < 1); 11408#L10 assume !(1 == ~n); 11361#L13 call #t~ret0 := fibo2(~n - 1);< 11404#fibo2ENTRY ~n := #in~n; 11511#L18 assume !(~n < 1); 11510#L20 assume !(1 == ~n); 11460#L23 call #t~ret2 := fibo1(~n - 1);< 11465#fibo1ENTRY ~n := #in~n; 11474#L8 assume !(~n < 1); 11472#L10 assume 1 == ~n;#res := 1; 11469#fibo1FINAL assume true; 11459#fibo1EXIT >#45#return; 11455#L23-1 call #t~ret3 := fibo1(~n - 2);< 11325#fibo1ENTRY ~n := #in~n; 11488#L8 assume ~n < 1;#res := 0; 11485#fibo1FINAL assume true; 11453#fibo1EXIT >#47#return; 11456#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 11508#fibo2FINAL assume true; 11360#fibo2EXIT >#49#return; 11322#L13-1 call #t~ret1 := fibo2(~n - 2);< 11345#fibo2ENTRY ~n := #in~n; 11677#L18 assume !(~n < 1); 11443#L20 assume !(1 == ~n); 11403#L23 [2019-10-22 09:00:34,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -579432640, now seen corresponding path program 3 times [2019-10-22 09:00:34,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863791878] [2019-10-22 09:00:34,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-10-22 09:00:34,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290679259] [2019-10-22 09:00:34,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:34,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290679259] [2019-10-22 09:00:34,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901828870] [2019-10-22 09:00:34,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:34,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:34,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:34,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:34,852 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:34,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-22 09:00:34,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968122014] [2019-10-22 09:00:34,852 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:34,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 09:00:34,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:00:34,853 INFO L87 Difference]: Start difference. First operand 478 states and 624 transitions. cyclomatic complexity: 150 Second operand 13 states. [2019-10-22 09:00:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:35,011 INFO L93 Difference]: Finished difference Result 524 states and 696 transitions. [2019-10-22 09:00:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:00:35,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 524 states and 696 transitions. [2019-10-22 09:00:35,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:35,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 524 states to 503 states and 668 transitions. [2019-10-22 09:00:35,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2019-10-22 09:00:35,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 282 [2019-10-22 09:00:35,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 503 states and 668 transitions. [2019-10-22 09:00:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:35,021 INFO L688 BuchiCegarLoop]: Abstraction has 503 states and 668 transitions. [2019-10-22 09:00:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states and 668 transitions. [2019-10-22 09:00:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 483. [2019-10-22 09:00:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-10-22 09:00:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 634 transitions. [2019-10-22 09:00:35,036 INFO L711 BuchiCegarLoop]: Abstraction has 483 states and 634 transitions. [2019-10-22 09:00:35,036 INFO L591 BuchiCegarLoop]: Abstraction has 483 states and 634 transitions. [2019-10-22 09:00:35,036 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:35,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 483 states and 634 transitions. [2019-10-22 09:00:35,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-10-22 09:00:35,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,040 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:35,040 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-10-22 09:00:35,041 INFO L791 eck$LassoCheckResult]: Stem: 12485#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 12448#L37 call main_#t~ret4 := fibo1(main_~x~0);< 12449#fibo1ENTRY ~n := #in~n; 12673#L8 assume !(~n < 1); 12663#L10 assume !(1 == ~n); 12664#L13 call #t~ret0 := fibo2(~n - 1);< 12677#fibo2ENTRY ~n := #in~n; 12676#L18 assume !(~n < 1); 12675#L20 assume !(1 == ~n); 12660#L23 call #t~ret2 := fibo1(~n - 1);< 12674#fibo1ENTRY ~n := #in~n; 12666#L8 assume !(~n < 1); 12667#L10 assume !(1 == ~n); 12492#L13 call #t~ret0 := fibo2(~n - 1);< 12491#fibo2ENTRY ~n := #in~n; 12493#L18 assume !(~n < 1); 12499#L20 assume !(1 == ~n); 12500#L23 call #t~ret2 := fibo1(~n - 1);< 12698#fibo1ENTRY ~n := #in~n; 12714#L8 assume !(~n < 1); 12713#L10 assume !(1 == ~n); 12426#L13 call #t~ret0 := fibo2(~n - 1);< 12659#fibo2ENTRY ~n := #in~n; 12742#L18 assume !(~n < 1); 12741#L20 assume !(1 == ~n); 12443#L23 call #t~ret2 := fibo1(~n - 1);< 12740#fibo1ENTRY ~n := #in~n; 12760#L8 assume !(~n < 1); 12754#L10 assume !(1 == ~n); 12749#L13 call #t~ret0 := fibo2(~n - 1);< 12750#fibo2ENTRY ~n := #in~n; 12779#L18 assume !(~n < 1); 12776#L20 assume 1 == ~n;#res := 1; 12775#fibo2FINAL assume true; 12748#fibo2EXIT >#49#return; 12502#L13-1 call #t~ret1 := fibo2(~n - 2);< 12746#fibo2ENTRY ~n := #in~n; 12501#L18 assume ~n < 1;#res := 0; 12503#fibo2FINAL assume true; 12745#fibo2EXIT >#51#return; 12744#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 12743#fibo1FINAL assume true; 12739#fibo1EXIT >#45#return; 12737#L23-1 call #t~ret3 := fibo1(~n - 2);< 12738#fibo1ENTRY ~n := #in~n; 12869#L8 assume !(~n < 1); 12868#L10 assume 1 == ~n;#res := 1; 12867#fibo1FINAL assume true; 12736#fibo1EXIT >#47#return; 12735#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 12734#fibo2FINAL assume true; 12711#fibo2EXIT >#49#return; 12487#L13-1 call #t~ret1 := fibo2(~n - 2);< 12472#fibo2ENTRY ~n := #in~n; 12692#L18 assume !(~n < 1); 12646#L20 assume !(1 == ~n); 12632#L23 [2019-10-22 09:00:35,041 INFO L793 eck$LassoCheckResult]: Loop: 12632#L23 call #t~ret2 := fibo1(~n - 1);< 12643#fibo1ENTRY ~n := #in~n; 12642#L8 assume !(~n < 1); 12639#L10 assume !(1 == ~n); 12438#L13 call #t~ret0 := fibo2(~n - 1);< 12630#fibo2ENTRY ~n := #in~n; 12628#L18 assume !(~n < 1); 12627#L20 assume !(1 == ~n); 12518#L23 call #t~ret2 := fibo1(~n - 1);< 12523#fibo1ENTRY ~n := #in~n; 12552#L8 assume !(~n < 1); 12551#L10 assume !(1 == ~n); 12535#L13 call #t~ret0 := fibo2(~n - 1);< 12550#fibo2ENTRY ~n := #in~n; 12548#L18 assume !(~n < 1); 12545#L20 assume 1 == ~n;#res := 1; 12546#fibo2FINAL assume true; 12624#fibo2EXIT >#49#return; 12514#L13-1 call #t~ret1 := fibo2(~n - 2);< 12521#fibo2ENTRY ~n := #in~n; 12636#L18 assume ~n < 1;#res := 0; 12565#fibo2FINAL assume true; 12622#fibo2EXIT >#51#return; 12532#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 12533#fibo1FINAL assume true; 12599#fibo1EXIT >#45#return; 12529#L23-1 call #t~ret3 := fibo1(~n - 2);< 12562#fibo1ENTRY ~n := #in~n; 12563#L8 assume !(~n < 1); 12528#L10 assume 1 == ~n;#res := 1; 12531#fibo1FINAL assume true; 12598#fibo1EXIT >#47#return; 12453#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 12436#fibo2FINAL assume true; 12439#fibo2EXIT >#49#return; 12495#L13-1 call #t~ret1 := fibo2(~n - 2);< 12472#fibo2ENTRY ~n := #in~n; 12692#L18 assume !(~n < 1); 12646#L20 assume !(1 == ~n); 12632#L23 [2019-10-22 09:00:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash -579432640, now seen corresponding path program 4 times [2019-10-22 09:00:35,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910004192] [2019-10-22 09:00:35,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,064 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1831895155, now seen corresponding path program 1 times [2019-10-22 09:00:35,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191427573] [2019-10-22 09:00:35,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,075 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash 551901268, now seen corresponding path program 5 times [2019-10-22 09:00:35,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390812035] [2019-10-22 09:00:35,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 99 proven. 98 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-22 09:00:35,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390812035] [2019-10-22 09:00:35,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359452187] [2019-10-22 09:00:35,286 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:35,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-22 09:00:35,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:35,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-22 09:00:35,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:35,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 24 [2019-10-22 09:00:35,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106122341] [2019-10-22 09:00:35,741 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:35,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:35,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:35,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:35,742 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:35,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:35,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:35,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:35,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-10-22 09:00:35,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:35,742 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:35,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,830 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:35,830 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:35,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:35,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:35,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:35,837 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/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:35,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:35,843 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619f7f37-f7e1-4275-860d-cd2853e0d83a/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-10-22 09:00:35,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:35,850 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:37,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:37,956 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,956 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:37,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-10-22 09:00:37,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,956 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,031 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:38,031 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:38,031 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-10-22 09:00:38,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,033 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-10-22 09:00:38,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,034 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,034 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-10-22 09:00:38,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,040 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-10-22 09:00:38,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,042 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-10-22 09:00:38,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,044 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-10-22 09:00:38,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,048 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-10-22 09:00:38,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,049 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-10-22 09:00:38,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,050 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-10-22 09:00:38,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,053 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:38,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:38,055 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:38,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:38,056 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:38,056 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:38,056 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-10-22 09:00:38,056 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:38,320 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-10-22 09:00:38,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 483 states and 634 transitions. cyclomatic complexity: 155 Second operand 13 states. [2019-10-22 09:00:38,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 483 states and 634 transitions. cyclomatic complexity: 155. Second operand 13 states. Result 1527 states and 2015 transitions. Complement of second has 50 states. [2019-10-22 09:00:38,805 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-10-22 09:00:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:00:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2019-10-22 09:00:38,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 56 letters. Loop has 39 letters. [2019-10-22 09:00:38,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,812 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:39,098 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-10-22 09:00:39,098 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 483 states and 634 transitions. cyclomatic complexity: 155 Second operand 13 states. [2019-10-22 09:00:39,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 483 states and 634 transitions. cyclomatic complexity: 155. Second operand 13 states. Result 1626 states and 2156 transitions. Complement of second has 52 states. [2019-10-22 09:00:39,649 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-10-22 09:00:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:00:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2019-10-22 09:00:39,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 56 letters. Loop has 39 letters. [2019-10-22 09:00:39,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:00:39,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:39,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:39,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:39,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 09:00:39,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:39,926 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-10-22 09:00:39,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 483 states and 634 transitions. cyclomatic complexity: 155 Second operand 13 states. [2019-10-22 09:00:40,473 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 483 states and 634 transitions. cyclomatic complexity: 155. Second operand 13 states. Result 2024 states and 2469 transitions. Complement of second has 127 states. [2019-10-22 09:00:40,477 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-10-22 09:00:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:00:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-10-22 09:00:40,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 56 letters. Loop has 39 letters. [2019-10-22 09:00:40,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 95 letters. Loop has 39 letters. [2019-10-22 09:00:40,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 56 letters. Loop has 78 letters. [2019-10-22 09:00:40,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2469 transitions. [2019-10-22 09:00:40,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-10-22 09:00:40,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 1284 states and 1666 transitions. [2019-10-22 09:00:40,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2019-10-22 09:00:40,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2019-10-22 09:00:40,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1284 states and 1666 transitions. [2019-10-22 09:00:40,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:40,521 INFO L688 BuchiCegarLoop]: Abstraction has 1284 states and 1666 transitions. [2019-10-22 09:00:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states and 1666 transitions. [2019-10-22 09:00:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1094. [2019-10-22 09:00:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-10-22 09:00:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1369 transitions. [2019-10-22 09:00:40,549 INFO L711 BuchiCegarLoop]: Abstraction has 1094 states and 1369 transitions. [2019-10-22 09:00:40,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-22 09:00:40,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-10-22 09:00:40,549 INFO L87 Difference]: Start difference. First operand 1094 states and 1369 transitions. Second operand 24 states. [2019-10-22 09:00:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:41,111 INFO L93 Difference]: Finished difference Result 948 states and 1168 transitions. [2019-10-22 09:00:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-22 09:00:41,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 948 states and 1168 transitions. [2019-10-22 09:00:41,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:41,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 948 states to 0 states and 0 transitions. [2019-10-22 09:00:41,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:41,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:41,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:41,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:41,120 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:41,120 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:41,120 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:41,120 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:41,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:41,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:41,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:41,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:41 BoogieIcfgContainer [2019-10-22 09:00:41,128 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:41,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:41,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:41,129 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:41,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:21" (3/4) ... [2019-10-22 09:00:41,132 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:41,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:41,136 INFO L168 Benchmark]: Toolchain (without parser) took 20152.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 131.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:41,138 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:41,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:41,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:41,144 INFO L168 Benchmark]: Boogie Preprocessor took 19.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:41,144 INFO L168 Benchmark]: RCFGBuilder took 280.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:41,144 INFO L168 Benchmark]: BuchiAutomizer took 19564.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:41,145 INFO L168 Benchmark]: Witness Printer took 5.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:41,146 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 280.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19564.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (10 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function n and consists of 14 locations. 10 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 11.0s. Construction of modules took 2.7s. Büchi inclusion checks took 5.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 408 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 485 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 15/51 HoareTripleCheckerStatistics: 472 SDtfs, 1207 SDslu, 1630 SDs, 0 SdLazy, 4035 SolverSat, 764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT1 SILN0 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp84 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...